1 | /* |
---|
2 | * MD5 hashing code copied from Lepton's crack <http://usuarios.lycos.es/reinob/> |
---|
3 | * |
---|
4 | * Adapted to be API-compatible with the previous (GPL-incompatible) code. |
---|
5 | */ |
---|
6 | |
---|
7 | /* |
---|
8 | * This code implements the MD5 message-digest algorithm. |
---|
9 | * The algorithm is due to Ron Rivest. This code was |
---|
10 | * written by Colin Plumb in 1993, no copyright is claimed. |
---|
11 | * This code is in the public domain; do with it what you wish. |
---|
12 | * |
---|
13 | * Equivalent code is available from RSA Data Security, Inc. |
---|
14 | * This code has been tested against that, and is equivalent, |
---|
15 | * except that you don't need to include two pages of legalese |
---|
16 | * with every copy. |
---|
17 | * |
---|
18 | * To compute the message digest of a chunk of bytes, declare an |
---|
19 | * MD5Context structure, pass it to MD5Init, call MD5Update as |
---|
20 | * needed on buffers full of bytes, and then call MD5Final, which |
---|
21 | * will fill a supplied 16-byte array with the digest. |
---|
22 | */ |
---|
23 | |
---|
24 | #include <sys/types.h> |
---|
25 | #include <string.h> /* for memcpy() */ |
---|
26 | #include "md5.h" |
---|
27 | |
---|
28 | static void md5_transform(uint32_t buf[4], uint32_t const in[16]); |
---|
29 | |
---|
30 | /* |
---|
31 | * Wrapper function for all-in-one MD5 |
---|
32 | * |
---|
33 | * Bernardo Reino, aka Lepton. |
---|
34 | * 20021120 |
---|
35 | */ |
---|
36 | |
---|
37 | void md5_init(struct MD5Context *ctx) |
---|
38 | { |
---|
39 | ctx->buf[0] = 0x67452301; |
---|
40 | ctx->buf[1] = 0xefcdab89; |
---|
41 | ctx->buf[2] = 0x98badcfe; |
---|
42 | ctx->buf[3] = 0x10325476; |
---|
43 | |
---|
44 | ctx->bits[0] = 0; |
---|
45 | ctx->bits[1] = 0; |
---|
46 | } |
---|
47 | |
---|
48 | /* |
---|
49 | * Update context to reflect the concatenation of another buffer full |
---|
50 | * of bytes. |
---|
51 | */ |
---|
52 | void md5_append(struct MD5Context *ctx, const md5_byte_t *buf, |
---|
53 | unsigned int len) |
---|
54 | { |
---|
55 | uint32_t t; |
---|
56 | |
---|
57 | /* Update bitcount */ |
---|
58 | |
---|
59 | t = ctx->bits[0]; |
---|
60 | if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t) |
---|
61 | ctx->bits[1]++; /* Carry from low to high */ |
---|
62 | ctx->bits[1] += len >> 29; |
---|
63 | |
---|
64 | t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ |
---|
65 | |
---|
66 | /* Handle any leading odd-sized chunks */ |
---|
67 | |
---|
68 | if (t) { |
---|
69 | unsigned char *p = (unsigned char *) ctx->in + t; |
---|
70 | |
---|
71 | t = 64 - t; |
---|
72 | if (len < t) { |
---|
73 | memcpy(p, buf, len); |
---|
74 | return; |
---|
75 | } |
---|
76 | memcpy(p, buf, t); |
---|
77 | md5_transform(ctx->buf, (uint32_t *) ctx->in); |
---|
78 | buf += t; |
---|
79 | len -= t; |
---|
80 | } |
---|
81 | /* Process data in 64-byte chunks */ |
---|
82 | |
---|
83 | while (len >= 64) { |
---|
84 | memcpy(ctx->in, buf, 64); |
---|
85 | md5_transform(ctx->buf, (uint32_t *) ctx->in); |
---|
86 | buf += 64; |
---|
87 | len -= 64; |
---|
88 | } |
---|
89 | |
---|
90 | /* Handle any remaining bytes of data. */ |
---|
91 | |
---|
92 | memcpy(ctx->in, buf, len); |
---|
93 | } |
---|
94 | |
---|
95 | /* |
---|
96 | * Final wrapup - pad to 64-byte boundary with the bit pattern |
---|
97 | * 1 0* (64-bit count of bits processed, MSB-first) |
---|
98 | */ |
---|
99 | void md5_finish(struct MD5Context *ctx, md5_byte_t digest[16]) |
---|
100 | { |
---|
101 | unsigned count; |
---|
102 | unsigned char *p; |
---|
103 | |
---|
104 | /* Compute number of bytes mod 64 */ |
---|
105 | count = (ctx->bits[0] >> 3) & 0x3F; |
---|
106 | |
---|
107 | /* Set the first char of padding to 0x80. This is safe since there is |
---|
108 | always at least one byte free */ |
---|
109 | p = ctx->in + count; |
---|
110 | *p++ = 0x80; |
---|
111 | |
---|
112 | /* Bytes of padding needed to make 64 bytes */ |
---|
113 | count = 64 - 1 - count; |
---|
114 | |
---|
115 | /* Pad out to 56 mod 64 */ |
---|
116 | if (count < 8) { |
---|
117 | /* Two lots of padding: Pad the first block to 64 bytes */ |
---|
118 | memset(p, 0, count); |
---|
119 | md5_transform(ctx->buf, (uint32_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 | |
---|
128 | /* Append length in bits and transform */ |
---|
129 | ((uint32_t *) ctx->in)[14] = ctx->bits[0]; |
---|
130 | ((uint32_t *) ctx->in)[15] = ctx->bits[1]; |
---|
131 | |
---|
132 | md5_transform(ctx->buf, (uint32_t *) ctx->in); |
---|
133 | memcpy(digest, ctx->buf, 16); |
---|
134 | memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */ |
---|
135 | } |
---|
136 | |
---|
137 | /* The four core functions - F1 is optimized somewhat */ |
---|
138 | |
---|
139 | /* #define F1(x, y, z) (x & y | ~x & z) */ |
---|
140 | #define F1(x, y, z) (z ^ (x & (y ^ z))) |
---|
141 | #define F2(x, y, z) F1(z, x, y) |
---|
142 | #define F3(x, y, z) (x ^ y ^ z) |
---|
143 | #define F4(x, y, z) (y ^ (x | ~z)) |
---|
144 | |
---|
145 | /* This is the central step in the MD5 algorithm. */ |
---|
146 | #define MD5STEP(f, w, x, y, z, data, s) \ |
---|
147 | ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) |
---|
148 | |
---|
149 | /* |
---|
150 | * The core of the MD5 algorithm, this alters an existing MD5 hash to |
---|
151 | * reflect the addition of 16 longwords of new data. MD5Update blocks |
---|
152 | * the data and converts bytes into longwords for this routine. |
---|
153 | */ |
---|
154 | static void md5_transform(uint32_t buf[4], uint32_t const in[16]) |
---|
155 | { |
---|
156 | register uint32_t a, b, c, d; |
---|
157 | |
---|
158 | a = buf[0]; |
---|
159 | b = buf[1]; |
---|
160 | c = buf[2]; |
---|
161 | d = buf[3]; |
---|
162 | |
---|
163 | MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); |
---|
164 | MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); |
---|
165 | MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); |
---|
166 | MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); |
---|
167 | MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); |
---|
168 | MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); |
---|
169 | MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); |
---|
170 | MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); |
---|
171 | MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); |
---|
172 | MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); |
---|
173 | MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); |
---|
174 | MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); |
---|
175 | MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); |
---|
176 | MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); |
---|
177 | MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); |
---|
178 | MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); |
---|
179 | |
---|
180 | MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); |
---|
181 | MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); |
---|
182 | MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); |
---|
183 | MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); |
---|
184 | MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); |
---|
185 | MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); |
---|
186 | MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); |
---|
187 | MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); |
---|
188 | MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); |
---|
189 | MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); |
---|
190 | MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); |
---|
191 | MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); |
---|
192 | MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); |
---|
193 | MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); |
---|
194 | MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); |
---|
195 | MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); |
---|
196 | |
---|
197 | MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); |
---|
198 | MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); |
---|
199 | MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); |
---|
200 | MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); |
---|
201 | MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); |
---|
202 | MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); |
---|
203 | MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); |
---|
204 | MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); |
---|
205 | MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); |
---|
206 | MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); |
---|
207 | MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); |
---|
208 | MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); |
---|
209 | MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); |
---|
210 | MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); |
---|
211 | MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); |
---|
212 | MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); |
---|
213 | |
---|
214 | MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); |
---|
215 | MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); |
---|
216 | MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); |
---|
217 | MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); |
---|
218 | MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); |
---|
219 | MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); |
---|
220 | MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); |
---|
221 | MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); |
---|
222 | MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); |
---|
223 | MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); |
---|
224 | MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); |
---|
225 | MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); |
---|
226 | MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); |
---|
227 | MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); |
---|
228 | MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); |
---|
229 | MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); |
---|
230 | |
---|
231 | buf[0] += a; |
---|
232 | buf[1] += b; |
---|
233 | buf[2] += c; |
---|
234 | buf[3] += d; |
---|
235 | } |
---|