Mercurial > dropbear

comparison src/hashes/md5.c @ 192:9cc34777b479 libtomcrypt

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