author | conber <conber> | 2002-06-15 09:46:14 (UTC) |
---|---|---|
committer | conber <conber> | 2002-06-15 09:46:14 (UTC) |
commit | 7f2eef29708380844922f34f59ba4e9beefbf7c3 (patch) (unidiff) | |
tree | f57125fbaabddecc35d6677f1b9e48a4594165d5 /noncore/unsupported/mail2/libmail/md5.cpp | |
parent | 0acbdd392814589df303b6e50c79d9822e3db27a (diff) | |
download | opie-7f2eef29708380844922f34f59ba4e9beefbf7c3.zip opie-7f2eef29708380844922f34f59ba4e9beefbf7c3.tar.gz opie-7f2eef29708380844922f34f59ba4e9beefbf7c3.tar.bz2 |
initial checkin
Diffstat (limited to 'noncore/unsupported/mail2/libmail/md5.cpp') (more/less context) (ignore whitespace changes)
-rw-r--r-- | noncore/unsupported/mail2/libmail/md5.cpp | 242 |
1 files changed, 242 insertions, 0 deletions
diff --git a/noncore/unsupported/mail2/libmail/md5.cpp b/noncore/unsupported/mail2/libmail/md5.cpp new file mode 100644 index 0000000..4ee2c42 --- a/dev/null +++ b/noncore/unsupported/mail2/libmail/md5.cpp | |||
@@ -0,0 +1,242 @@ | |||
1 | // This code was written by Colin Plumb. I've made some small changes. | ||
2 | // (Constantin Bergemann) | ||
3 | |||
4 | #ifdef __cplusplus | ||
5 | extern "C" { | ||
6 | #endif | ||
7 | |||
8 | #include <string.h> /* for memcpy() */ | ||
9 | #include "md5.h" | ||
10 | |||
11 | #if __BYTE_ORDER == 1234 | ||
12 | #define byteReverse(buf, len)/* Nothing */ | ||
13 | #else | ||
14 | void byteReverse(unsigned char *buf, unsigned longs); | ||
15 | |||
16 | /* | ||
17 | * Note: this code is harmless on little-endian machines. | ||
18 | */ | ||
19 | void byteReverse(unsigned char *buf, unsigned longs) | ||
20 | { | ||
21 | u_int32_t t; | ||
22 | do { | ||
23 | t = (u_int32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 | | ||
24 | ((unsigned) buf[1] << 8 | buf[0]); | ||
25 | *(u_int32_t *) buf = t; | ||
26 | buf += 4; | ||
27 | } while (--longs); | ||
28 | } | ||
29 | #endif | ||
30 | |||
31 | /* | ||
32 | * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious | ||
33 | * initialization constants. | ||
34 | */ | ||
35 | void MD5_Init(MD5_CTX *ctx) | ||
36 | { | ||
37 | ctx->buf[0] = 0x67452301; | ||
38 | ctx->buf[1] = 0xefcdab89; | ||
39 | ctx->buf[2] = 0x98badcfe; | ||
40 | ctx->buf[3] = 0x10325476; | ||
41 | |||
42 | ctx->bits[0] = 0; | ||
43 | ctx->bits[1] = 0; | ||
44 | } | ||
45 | |||
46 | /* | ||
47 | * Update context to reflect the concatenation of another buffer full | ||
48 | * of bytes. | ||
49 | */ | ||
50 | void MD5_Update(MD5_CTX *ctx, unsigned char const *buf, unsigned len) | ||
51 | { | ||
52 | u_int32_t t; | ||
53 | |||
54 | /* Update bitcount */ | ||
55 | |||
56 | t = ctx->bits[0]; | ||
57 | if ((ctx->bits[0] = t + ((u_int32_t) len << 3)) < t) | ||
58 | ctx->bits[1]++; /* Carry from low to high */ | ||
59 | ctx->bits[1] += len >> 29; | ||
60 | |||
61 | t = (t >> 3) & 0x3f;/* Bytes already in shsInfo->data */ | ||
62 | |||
63 | /* Handle any leading odd-sized chunks */ | ||
64 | |||
65 | if (t) { | ||
66 | unsigned char *p = (unsigned char *) ctx->in + t; | ||
67 | |||
68 | t = 64 - t; | ||
69 | if (len < t) { | ||
70 | memcpy(p, buf, len); | ||
71 | return; | ||
72 | } | ||
73 | memcpy(p, buf, t); | ||
74 | byteReverse(ctx->in, 16); | ||
75 | MD5Transform(ctx->buf, (u_int32_t *) ctx->in); | ||
76 | buf += t; | ||
77 | len -= t; | ||
78 | } | ||
79 | /* Process data in 64-byte chunks */ | ||
80 | |||
81 | while (len >= 64) { | ||
82 | memcpy(ctx->in, buf, 64); | ||
83 | byteReverse(ctx->in, 16); | ||
84 | MD5Transform(ctx->buf, (u_int32_t *) ctx->in); | ||
85 | buf += 64; | ||
86 | len -= 64; | ||
87 | } | ||
88 | |||
89 | /* Handle any remaining bytes of data. */ | ||
90 | |||
91 | memcpy(ctx->in, buf, len); | ||
92 | } | ||
93 | |||
94 | /* | ||
95 | * Final wrapup - pad to 64-byte boundary with the bit pattern | ||
96 | * 1 0* (64-bit count of bits processed, MSB-first) | ||
97 | */ | ||
98 | void MD5_Final(unsigned char digest[16], MD5_CTX *ctx) | ||
99 | { | ||
100 | unsigned count; | ||
101 | unsigned char *p; | ||
102 | |||
103 | /* Compute number of bytes mod 64 */ | ||
104 | count = (ctx->bits[0] >> 3) & 0x3F; | ||
105 | |||
106 | /* Set the first char of padding to 0x80. This is safe since there is | ||
107 | always at least one byte free */ | ||
108 | p = ctx->in + count; | ||
109 | *p++ = 0x80; | ||
110 | |||
111 | /* Bytes of padding needed to make 64 bytes */ | ||
112 | count = 64 - 1 - count; | ||
113 | |||
114 | /* Pad out to 56 mod 64 */ | ||
115 | if (count < 8) { | ||
116 | /* Two lots of padding: Pad the first block to 64 bytes */ | ||
117 | memset(p, 0, count); | ||
118 | byteReverse(ctx->in, 16); | ||
119 | MD5Transform(ctx->buf, (u_int32_t *) ctx->in); | ||
120 | |||
121 | /* Now fill the next block with 56 bytes */ | ||
122 | memset(ctx->in, 0, 56); | ||
123 | } else { | ||
124 | /* Pad block to 56 bytes */ | ||
125 | memset(p, 0, count - 8); | ||
126 | } | ||
127 | byteReverse(ctx->in, 14); | ||
128 | |||
129 | /* Append length in bits and transform */ | ||
130 | ((u_int32_t *) ctx->in)[14] = ctx->bits[0]; | ||
131 | ((u_int32_t *) ctx->in)[15] = ctx->bits[1]; | ||
132 | |||
133 | MD5Transform(ctx->buf, (u_int32_t *) ctx->in); | ||
134 | byteReverse((unsigned char *) ctx->buf, 4); | ||
135 | memcpy(digest, ctx->buf, 16); | ||
136 | memset((char *) ctx, 0, sizeof(ctx));/* In case it's sensitive */ | ||
137 | } | ||
138 | |||
139 | /* The four core functions - F1 is optimized somewhat */ | ||
140 | |||
141 | /* #define F1(x, y, z) (x & y | ~x & z) */ | ||
142 | #define F1(x, y, z) (z ^ (x & (y ^ z))) | ||
143 | #define F2(x, y, z) F1(z, x, y) | ||
144 | #define F3(x, y, z) (x ^ y ^ z) | ||
145 | #define F4(x, y, z) (y ^ (x | ~z)) | ||
146 | |||
147 | /* This is the central step in the MD5 algorithm. */ | ||
148 | #define MD5STEP(f, w, x, y, z, data, s) \ | ||
149 | ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) | ||
150 | |||
151 | /* | ||
152 | * The core of the MD5 algorithm, this alters an existing MD5 hash to | ||
153 | * reflect the addition of 16 longwords of new data. MD5Update blocks | ||
154 | * the data and converts bytes into longwords for this routine. | ||
155 | */ | ||
156 | void MD5Transform(u_int32_t buf[4], u_int32_t const in[16]) | ||
157 | { | ||
158 | register u_int32_t a, b, c, d; | ||
159 | |||
160 | a = buf[0]; | ||
161 | b = buf[1]; | ||
162 | c = buf[2]; | ||
163 | d = buf[3]; | ||
164 | |||
165 | MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); | ||
166 | MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); | ||
167 | MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); | ||
168 | MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); | ||
169 | MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); | ||
170 | MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); | ||
171 | MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); | ||
172 | MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); | ||
173 | MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); | ||
174 | MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); | ||
175 | MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); | ||
176 | MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); | ||
177 | MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); | ||
178 | MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); | ||
179 | MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); | ||
180 | MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); | ||
181 | |||
182 | MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); | ||
183 | MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); | ||
184 | MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); | ||
185 | MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); | ||
186 | MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); | ||
187 | MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); | ||
188 | MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); | ||
189 | MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); | ||
190 | MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); | ||
191 | MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); | ||
192 | MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); | ||
193 | MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); | ||
194 | MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); | ||
195 | MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); | ||
196 | MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); | ||
197 | MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); | ||
198 | |||
199 | MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); | ||
200 | MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); | ||
201 | MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); | ||
202 | MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); | ||
203 | MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); | ||
204 | MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); | ||
205 | MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); | ||
206 | MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); | ||
207 | MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); | ||
208 | MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); | ||
209 | MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); | ||
210 | MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); | ||
211 | MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); | ||
212 | MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); | ||
213 | MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); | ||
214 | MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); | ||
215 | |||
216 | MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); | ||
217 | MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); | ||
218 | MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); | ||
219 | MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); | ||
220 | MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); | ||
221 | MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); | ||
222 | MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); | ||
223 | MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); | ||
224 | MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); | ||
225 | MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); | ||
226 | MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); | ||
227 | MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); | ||
228 | MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); | ||
229 | MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); | ||
230 | MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); | ||
231 | MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); | ||
232 | |||
233 | buf[0] += a; | ||
234 | buf[1] += b; | ||
235 | buf[2] += c; | ||
236 | buf[3] += d; | ||
237 | } | ||
238 | |||
239 | #ifdef __cplusplus | ||
240 | } // extern "C" | ||
241 | #endif | ||
242 | |||