|
3
|
1 /* LibTomCrypt, modular cryptographic library -- Tom St Denis |
|
|
2 * |
|
|
3 * LibTomCrypt is a library that provides various cryptographic |
|
|
4 * algorithms in a highly modular and flexible manner. |
|
|
5 * |
|
|
6 * The library is free for all purposes without any express |
|
|
7 * guarantee it works. |
|
|
8 * |
|
|
9 * Tom St Denis, [email protected], http://libtomcrypt.org |
|
|
10 */ |
|
|
11 |
|
|
12 /* MD5 hash function by Tom St Denis */ |
|
|
13 |
|
|
14 #include "mycrypt.h" |
|
|
15 |
|
|
16 #ifdef MD5 |
|
|
17 |
|
|
18 const struct _hash_descriptor md5_desc = |
|
|
19 { |
|
|
20 "md5", |
|
|
21 3, |
|
|
22 16, |
|
|
23 64, |
|
15
|
24 |
|
|
25 /* DER identifier */ |
|
|
26 { 0x30, 0x20, 0x30, 0x0C, 0x06, 0x08, 0x2A, 0x86, |
|
|
27 0x48, 0x86, 0xF7, 0x0D, 0x02, 0x05, 0x05, 0x00, |
|
|
28 0x04, 0x10 }, |
|
|
29 18, |
|
|
30 |
|
3
|
31 &md5_init, |
|
|
32 &md5_process, |
|
|
33 &md5_done, |
|
|
34 &md5_test |
|
|
35 }; |
|
|
36 |
|
|
37 #define F(x,y,z) (z ^ (x & (y ^ z))) |
|
|
38 #define G(x,y,z) (y ^ (z & (y ^ x))) |
|
|
39 #define H(x,y,z) (x^y^z) |
|
|
40 #define I(x,y,z) (y^(x|(~z))) |
|
|
41 |
|
|
42 #define FF(a,b,c,d,M,s,t) \ |
|
|
43 a = (a + F(b,c,d) + M + t); a = ROL(a, s) + b; |
|
|
44 |
|
|
45 #define GG(a,b,c,d,M,s,t) \ |
|
|
46 a = (a + G(b,c,d) + M + t); a = ROL(a, s) + b; |
|
|
47 |
|
|
48 #define HH(a,b,c,d,M,s,t) \ |
|
|
49 a = (a + H(b,c,d) + M + t); a = ROL(a, s) + b; |
|
|
50 |
|
|
51 #define II(a,b,c,d,M,s,t) \ |
|
|
52 a = (a + I(b,c,d) + M + t); a = ROL(a, s) + b; |
|
|
53 |
|
15
|
54 #ifdef SMALL_CODE |
|
|
55 |
|
|
56 static const unsigned char Worder[64] = { |
|
|
57 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15, |
|
|
58 1,6,11,0,5,10,15,4,9,14,3,8,13,2,7,12, |
|
|
59 5,8,11,14,1,4,7,10,13,0,3,6,9,12,15,2, |
|
|
60 0,7,14,5,12,3,10,1,8,15,6,13,4,11,2,9 |
|
|
61 }; |
|
|
62 |
|
|
63 static const unsigned char Rorder[64] = { |
|
|
64 7,12,17,22,7,12,17,22,7,12,17,22,7,12,17,22, |
|
|
65 5,9,14,20,5,9,14,20,5,9,14,20,5,9,14,20, |
|
|
66 4,11,16,23,4,11,16,23,4,11,16,23,4,11,16,23, |
|
|
67 6,10,15,21,6,10,15,21,6,10,15,21,6,10,15,21 |
|
|
68 }; |
|
|
69 |
|
|
70 static const ulong32 Korder[64] = { |
|
|
71 0xd76aa478UL, 0xe8c7b756UL, 0x242070dbUL, 0xc1bdceeeUL, 0xf57c0fafUL, 0x4787c62aUL, 0xa8304613UL, 0xfd469501UL, |
|
|
72 0x698098d8UL, 0x8b44f7afUL, 0xffff5bb1UL, 0x895cd7beUL, 0x6b901122UL, 0xfd987193UL, 0xa679438eUL, 0x49b40821UL, |
|
|
73 0xf61e2562UL, 0xc040b340UL, 0x265e5a51UL, 0xe9b6c7aaUL, 0xd62f105dUL, 0x02441453UL, 0xd8a1e681UL, 0xe7d3fbc8UL, |
|
|
74 0x21e1cde6UL, 0xc33707d6UL, 0xf4d50d87UL, 0x455a14edUL, 0xa9e3e905UL, 0xfcefa3f8UL, 0x676f02d9UL, 0x8d2a4c8aUL, |
|
|
75 0xfffa3942UL, 0x8771f681UL, 0x6d9d6122UL, 0xfde5380cUL, 0xa4beea44UL, 0x4bdecfa9UL, 0xf6bb4b60UL, 0xbebfbc70UL, |
|
|
76 0x289b7ec6UL, 0xeaa127faUL, 0xd4ef3085UL, 0x04881d05UL, 0xd9d4d039UL, 0xe6db99e5UL, 0x1fa27cf8UL, 0xc4ac5665UL, |
|
|
77 0xf4292244UL, 0x432aff97UL, 0xab9423a7UL, 0xfc93a039UL, 0x655b59c3UL, 0x8f0ccc92UL, 0xffeff47dUL, 0x85845dd1UL, |
|
|
78 0x6fa87e4fUL, 0xfe2ce6e0UL, 0xa3014314UL, 0x4e0811a1UL, 0xf7537e82UL, 0xbd3af235UL, 0x2ad7d2bbUL, 0xeb86d391UL |
|
|
79 }; |
|
|
80 |
|
|
81 #endif |
|
|
82 |
|
3
|
83 #ifdef CLEAN_STACK |
|
|
84 static void _md5_compress(hash_state *md, unsigned char *buf) |
|
|
85 #else |
|
|
86 static void md5_compress(hash_state *md, unsigned char *buf) |
|
|
87 #endif |
|
|
88 { |
|
|
89 ulong32 i, W[16], a, b, c, d; |
|
15
|
90 #ifdef SMALL_CODE |
|
|
91 ulong32 t; |
|
|
92 #endif |
|
3
|
93 |
|
|
94 /* copy the state into 512-bits into W[0..15] */ |
|
|
95 for (i = 0; i < 16; i++) { |
|
|
96 LOAD32L(W[i], buf + (4*i)); |
|
|
97 } |
|
|
98 |
|
|
99 /* copy state */ |
|
|
100 a = md->md5.state[0]; |
|
|
101 b = md->md5.state[1]; |
|
|
102 c = md->md5.state[2]; |
|
|
103 d = md->md5.state[3]; |
|
|
104 |
|
15
|
105 #ifdef SMALL_CODE |
|
|
106 for (i = 0; i < 16; ++i) { |
|
|
107 FF(a,b,c,d,W[Worder[i]],Rorder[i],Korder[i]); |
|
|
108 t = d; d = c; c = b; b = a; a = t; |
|
|
109 } |
|
|
110 |
|
|
111 for (; i < 32; ++i) { |
|
|
112 GG(a,b,c,d,W[Worder[i]],Rorder[i],Korder[i]); |
|
|
113 t = d; d = c; c = b; b = a; a = t; |
|
|
114 } |
|
|
115 |
|
|
116 for (; i < 48; ++i) { |
|
|
117 HH(a,b,c,d,W[Worder[i]],Rorder[i],Korder[i]); |
|
|
118 t = d; d = c; c = b; b = a; a = t; |
|
|
119 } |
|
|
120 |
|
|
121 for (; i < 64; ++i) { |
|
|
122 II(a,b,c,d,W[Worder[i]],Rorder[i],Korder[i]); |
|
|
123 t = d; d = c; c = b; b = a; a = t; |
|
|
124 } |
|
|
125 |
|
|
126 #else |
|
3
|
127 FF(a,b,c,d,W[0],7,0xd76aa478UL) |
|
|
128 FF(d,a,b,c,W[1],12,0xe8c7b756UL) |
|
|
129 FF(c,d,a,b,W[2],17,0x242070dbUL) |
|
|
130 FF(b,c,d,a,W[3],22,0xc1bdceeeUL) |
|
|
131 FF(a,b,c,d,W[4],7,0xf57c0fafUL) |
|
|
132 FF(d,a,b,c,W[5],12,0x4787c62aUL) |
|
|
133 FF(c,d,a,b,W[6],17,0xa8304613UL) |
|
|
134 FF(b,c,d,a,W[7],22,0xfd469501UL) |
|
|
135 FF(a,b,c,d,W[8],7,0x698098d8UL) |
|
|
136 FF(d,a,b,c,W[9],12,0x8b44f7afUL) |
|
|
137 FF(c,d,a,b,W[10],17,0xffff5bb1UL) |
|
|
138 FF(b,c,d,a,W[11],22,0x895cd7beUL) |
|
|
139 FF(a,b,c,d,W[12],7,0x6b901122UL) |
|
|
140 FF(d,a,b,c,W[13],12,0xfd987193UL) |
|
|
141 FF(c,d,a,b,W[14],17,0xa679438eUL) |
|
|
142 FF(b,c,d,a,W[15],22,0x49b40821UL) |
|
|
143 GG(a,b,c,d,W[1],5,0xf61e2562UL) |
|
|
144 GG(d,a,b,c,W[6],9,0xc040b340UL) |
|
|
145 GG(c,d,a,b,W[11],14,0x265e5a51UL) |
|
|
146 GG(b,c,d,a,W[0],20,0xe9b6c7aaUL) |
|
|
147 GG(a,b,c,d,W[5],5,0xd62f105dUL) |
|
|
148 GG(d,a,b,c,W[10],9,0x02441453UL) |
|
|
149 GG(c,d,a,b,W[15],14,0xd8a1e681UL) |
|
|
150 GG(b,c,d,a,W[4],20,0xe7d3fbc8UL) |
|
|
151 GG(a,b,c,d,W[9],5,0x21e1cde6UL) |
|
|
152 GG(d,a,b,c,W[14],9,0xc33707d6UL) |
|
|
153 GG(c,d,a,b,W[3],14,0xf4d50d87UL) |
|
|
154 GG(b,c,d,a,W[8],20,0x455a14edUL) |
|
|
155 GG(a,b,c,d,W[13],5,0xa9e3e905UL) |
|
|
156 GG(d,a,b,c,W[2],9,0xfcefa3f8UL) |
|
|
157 GG(c,d,a,b,W[7],14,0x676f02d9UL) |
|
|
158 GG(b,c,d,a,W[12],20,0x8d2a4c8aUL) |
|
|
159 HH(a,b,c,d,W[5],4,0xfffa3942UL) |
|
|
160 HH(d,a,b,c,W[8],11,0x8771f681UL) |
|
|
161 HH(c,d,a,b,W[11],16,0x6d9d6122UL) |
|
|
162 HH(b,c,d,a,W[14],23,0xfde5380cUL) |
|
|
163 HH(a,b,c,d,W[1],4,0xa4beea44UL) |
|
|
164 HH(d,a,b,c,W[4],11,0x4bdecfa9UL) |
|
|
165 HH(c,d,a,b,W[7],16,0xf6bb4b60UL) |
|
|
166 HH(b,c,d,a,W[10],23,0xbebfbc70UL) |
|
|
167 HH(a,b,c,d,W[13],4,0x289b7ec6UL) |
|
|
168 HH(d,a,b,c,W[0],11,0xeaa127faUL) |
|
|
169 HH(c,d,a,b,W[3],16,0xd4ef3085UL) |
|
|
170 HH(b,c,d,a,W[6],23,0x04881d05UL) |
|
|
171 HH(a,b,c,d,W[9],4,0xd9d4d039UL) |
|
|
172 HH(d,a,b,c,W[12],11,0xe6db99e5UL) |
|
|
173 HH(c,d,a,b,W[15],16,0x1fa27cf8UL) |
|
|
174 HH(b,c,d,a,W[2],23,0xc4ac5665UL) |
|
|
175 II(a,b,c,d,W[0],6,0xf4292244UL) |
|
|
176 II(d,a,b,c,W[7],10,0x432aff97UL) |
|
|
177 II(c,d,a,b,W[14],15,0xab9423a7UL) |
|
|
178 II(b,c,d,a,W[5],21,0xfc93a039UL) |
|
|
179 II(a,b,c,d,W[12],6,0x655b59c3UL) |
|
|
180 II(d,a,b,c,W[3],10,0x8f0ccc92UL) |
|
|
181 II(c,d,a,b,W[10],15,0xffeff47dUL) |
|
|
182 II(b,c,d,a,W[1],21,0x85845dd1UL) |
|
|
183 II(a,b,c,d,W[8],6,0x6fa87e4fUL) |
|
|
184 II(d,a,b,c,W[15],10,0xfe2ce6e0UL) |
|
|
185 II(c,d,a,b,W[6],15,0xa3014314UL) |
|
|
186 II(b,c,d,a,W[13],21,0x4e0811a1UL) |
|
|
187 II(a,b,c,d,W[4],6,0xf7537e82UL) |
|
|
188 II(d,a,b,c,W[11],10,0xbd3af235UL) |
|
|
189 II(c,d,a,b,W[2],15,0x2ad7d2bbUL) |
|
|
190 II(b,c,d,a,W[9],21,0xeb86d391UL) |
|
15
|
191 #endif |
|
3
|
192 |
|
|
193 md->md5.state[0] = md->md5.state[0] + a; |
|
|
194 md->md5.state[1] = md->md5.state[1] + b; |
|
|
195 md->md5.state[2] = md->md5.state[2] + c; |
|
|
196 md->md5.state[3] = md->md5.state[3] + d; |
|
|
197 } |
|
|
198 |
|
|
199 #ifdef CLEAN_STACK |
|
|
200 static void md5_compress(hash_state *md, unsigned char *buf) |
|
|
201 { |
|
|
202 _md5_compress(md, buf); |
|
|
203 burn_stack(sizeof(ulong32) * 21); |
|
|
204 } |
|
|
205 #endif |
|
|
206 |
|
|
207 void md5_init(hash_state * md) |
|
|
208 { |
|
|
209 _ARGCHK(md != NULL); |
|
|
210 md->md5.state[0] = 0x67452301UL; |
|
|
211 md->md5.state[1] = 0xefcdab89UL; |
|
|
212 md->md5.state[2] = 0x98badcfeUL; |
|
|
213 md->md5.state[3] = 0x10325476UL; |
|
|
214 md->md5.curlen = 0; |
|
|
215 md->md5.length = 0; |
|
|
216 } |
|
|
217 |
|
|
218 HASH_PROCESS(md5_process, md5_compress, md5, 64) |
|
|
219 |
|
|
220 int md5_done(hash_state * md, unsigned char *hash) |
|
|
221 { |
|
|
222 int i; |
|
|
223 |
|
|
224 _ARGCHK(md != NULL); |
|
|
225 _ARGCHK(hash != NULL); |
|
|
226 |
|
|
227 if (md->md5.curlen >= sizeof(md->md5.buf)) { |
|
|
228 return CRYPT_INVALID_ARG; |
|
|
229 } |
|
|
230 |
|
|
231 |
|
|
232 /* increase the length of the message */ |
|
|
233 md->md5.length += md->md5.curlen * 8; |
|
|
234 |
|
|
235 /* append the '1' bit */ |
|
|
236 md->md5.buf[md->md5.curlen++] = (unsigned char)0x80; |
|
|
237 |
|
|
238 /* if the length is currently above 56 bytes we append zeros |
|
|
239 * then compress. Then we can fall back to padding zeros and length |
|
|
240 * encoding like normal. |
|
|
241 */ |
|
|
242 if (md->md5.curlen > 56) { |
|
|
243 while (md->md5.curlen < 64) { |
|
|
244 md->md5.buf[md->md5.curlen++] = (unsigned char)0; |
|
|
245 } |
|
|
246 md5_compress(md, md->md5.buf); |
|
|
247 md->md5.curlen = 0; |
|
|
248 } |
|
|
249 |
|
|
250 /* pad upto 56 bytes of zeroes */ |
|
|
251 while (md->md5.curlen < 56) { |
|
|
252 md->md5.buf[md->md5.curlen++] = (unsigned char)0; |
|
|
253 } |
|
|
254 |
|
|
255 /* store length */ |
|
|
256 STORE64L(md->md5.length, md->md5.buf+56); |
|
|
257 md5_compress(md, md->md5.buf); |
|
|
258 |
|
|
259 /* copy output */ |
|
|
260 for (i = 0; i < 4; i++) { |
|
|
261 STORE32L(md->md5.state[i], hash+(4*i)); |
|
|
262 } |
|
|
263 #ifdef CLEAN_STACK |
|
|
264 zeromem(md, sizeof(hash_state)); |
|
|
265 #endif |
|
|
266 return CRYPT_OK; |
|
|
267 } |
|
|
268 |
|
|
269 int md5_test(void) |
|
|
270 { |
|
|
271 #ifndef LTC_TEST |
|
|
272 return CRYPT_NOP; |
|
|
273 #else |
|
|
274 static const struct { |
|
|
275 char *msg; |
|
|
276 unsigned char hash[16]; |
|
|
277 } tests[] = { |
|
|
278 { "", |
|
|
279 { 0xd4, 0x1d, 0x8c, 0xd9, 0x8f, 0x00, 0xb2, 0x04, |
|
|
280 0xe9, 0x80, 0x09, 0x98, 0xec, 0xf8, 0x42, 0x7e } }, |
|
|
281 { "a", |
|
|
282 {0x0c, 0xc1, 0x75, 0xb9, 0xc0, 0xf1, 0xb6, 0xa8, |
|
|
283 0x31, 0xc3, 0x99, 0xe2, 0x69, 0x77, 0x26, 0x61 } }, |
|
|
284 { "abc", |
|
|
285 { 0x90, 0x01, 0x50, 0x98, 0x3c, 0xd2, 0x4f, 0xb0, |
|
|
286 0xd6, 0x96, 0x3f, 0x7d, 0x28, 0xe1, 0x7f, 0x72 } }, |
|
|
287 { "message digest", |
|
|
288 { 0xf9, 0x6b, 0x69, 0x7d, 0x7c, 0xb7, 0x93, 0x8d, |
|
|
289 0x52, 0x5a, 0x2f, 0x31, 0xaa, 0xf1, 0x61, 0xd0 } }, |
|
|
290 { "abcdefghijklmnopqrstuvwxyz", |
|
|
291 { 0xc3, 0xfc, 0xd3, 0xd7, 0x61, 0x92, 0xe4, 0x00, |
|
|
292 0x7d, 0xfb, 0x49, 0x6c, 0xca, 0x67, 0xe1, 0x3b } }, |
|
|
293 { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", |
|
|
294 { 0xd1, 0x74, 0xab, 0x98, 0xd2, 0x77, 0xd9, 0xf5, |
|
|
295 0xa5, 0x61, 0x1c, 0x2c, 0x9f, 0x41, 0x9d, 0x9f } }, |
|
|
296 { "12345678901234567890123456789012345678901234567890123456789012345678901234567890", |
|
|
297 { 0x57, 0xed, 0xf4, 0xa2, 0x2b, 0xe3, 0xc9, 0x55, |
|
|
298 0xac, 0x49, 0xda, 0x2e, 0x21, 0x07, 0xb6, 0x7a } }, |
|
|
299 { NULL, { 0 } } |
|
|
300 }; |
|
|
301 |
|
|
302 int i; |
|
|
303 unsigned char tmp[16]; |
|
|
304 hash_state md; |
|
|
305 |
|
|
306 for (i = 0; tests[i].msg != NULL; i++) { |
|
|
307 md5_init(&md); |
|
|
308 md5_process(&md, (unsigned char *)tests[i].msg, (unsigned long)strlen(tests[i].msg)); |
|
|
309 md5_done(&md, tmp); |
|
|
310 if (memcmp(tmp, tests[i].hash, 16) != 0) { |
|
|
311 return CRYPT_FAIL_TESTVECTOR; |
|
|
312 } |
|
|
313 } |
|
|
314 return CRYPT_OK; |
|
|
315 #endif |
|
|
316 } |
|
|
317 |
|
|
318 #endif |
|
|
319 |
|
|
320 |
