3 * adapted from libtomcrypt by Tom St. Denis
4 * by nathan wagner and released into the public domain
7 #define ENDIAN_NEUTRAL 1
8 #define LTC_SMALL_CODE 1
10 #include "tomcrypt_macros.h"
13 #define F(x,y,z) (z ^ (x & (y ^ z)))
14 #define G(x,y,z) (y ^ (z & (y ^ x)))
15 #define H(x,y,z) (x^y^z)
16 #define I(x,y,z) (y^(x|(~z)))
20 #define FF(a,b,c,d,M,s,t) \
21 a = (a + F(b,c,d) + M + t); a = ROL(a, s) + b;
23 #define GG(a,b,c,d,M,s,t) \
24 a = (a + G(b,c,d) + M + t); a = ROL(a, s) + b;
26 #define HH(a,b,c,d,M,s,t) \
27 a = (a + H(b,c,d) + M + t); a = ROL(a, s) + b;
29 #define II(a,b,c,d,M,s,t) \
30 a = (a + I(b,c,d) + M + t); a = ROL(a, s) + b;
32 static const unsigned char Worder[64] = {
33 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,
34 1,6,11,0,5,10,15,4,9,14,3,8,13,2,7,12,
35 5,8,11,14,1,4,7,10,13,0,3,6,9,12,15,2,
36 0,7,14,5,12,3,10,1,8,15,6,13,4,11,2,9
39 static const unsigned char Rorder[64] = {
40 7,12,17,22,7,12,17,22,7,12,17,22,7,12,17,22,
41 5,9,14,20,5,9,14,20,5,9,14,20,5,9,14,20,
42 4,11,16,23,4,11,16,23,4,11,16,23,4,11,16,23,
43 6,10,15,21,6,10,15,21,6,10,15,21,6,10,15,21
46 static const ulong32 Korder[64] = {
47 0xd76aa478UL, 0xe8c7b756UL, 0x242070dbUL, 0xc1bdceeeUL, 0xf57c0fafUL, 0x4787c62aUL, 0xa8304613UL, 0xfd469501UL,
48 0x698098d8UL, 0x8b44f7afUL, 0xffff5bb1UL, 0x895cd7beUL, 0x6b901122UL, 0xfd987193UL, 0xa679438eUL, 0x49b40821UL,
49 0xf61e2562UL, 0xc040b340UL, 0x265e5a51UL, 0xe9b6c7aaUL, 0xd62f105dUL, 0x02441453UL, 0xd8a1e681UL, 0xe7d3fbc8UL,
50 0x21e1cde6UL, 0xc33707d6UL, 0xf4d50d87UL, 0x455a14edUL, 0xa9e3e905UL, 0xfcefa3f8UL, 0x676f02d9UL, 0x8d2a4c8aUL,
51 0xfffa3942UL, 0x8771f681UL, 0x6d9d6122UL, 0xfde5380cUL, 0xa4beea44UL, 0x4bdecfa9UL, 0xf6bb4b60UL, 0xbebfbc70UL,
52 0x289b7ec6UL, 0xeaa127faUL, 0xd4ef3085UL, 0x04881d05UL, 0xd9d4d039UL, 0xe6db99e5UL, 0x1fa27cf8UL, 0xc4ac5665UL,
53 0xf4292244UL, 0x432aff97UL, 0xab9423a7UL, 0xfc93a039UL, 0x655b59c3UL, 0x8f0ccc92UL, 0xffeff47dUL, 0x85845dd1UL,
54 0x6fa87e4fUL, 0xfe2ce6e0UL, 0xa3014314UL, 0x4e0811a1UL, 0xf7537e82UL, 0xbd3af235UL, 0x2ad7d2bbUL, 0xeb86d391UL
59 #define FF(a,b,c,d,M,s,t) \
60 a = (a + F(b,c,d) + M + t); a = ROL(a, s) + b;
62 #define GG(a,b,c,d,M,s,t) \
63 a = (a + G(b,c,d) + M + t); a = ROL(a, s) + b;
65 #define HH(a,b,c,d,M,s,t) \
66 a = (a + H(b,c,d) + M + t); a = ROL(a, s) + b;
68 #define II(a,b,c,d,M,s,t) \
69 a = (a + I(b,c,d) + M + t); a = ROL(a, s) + b;
74 static int md5_compress(hash_state *md, unsigned char *buf) {
75 ulong32 i, W[16], a, b, c, d;
80 /* copy the state into 512-bits into W[0..15] */
81 for (i = 0; i < 16; i++) {
82 LOAD32L(W[i], buf + (4*i));
92 for (i = 0; i < 16; ++i) {
93 FF(a,b,c,d,W[Worder[i]],Rorder[i],Korder[i]);
94 t = d; d = c; c = b; b = a; a = t;
98 GG(a,b,c,d,W[Worder[i]],Rorder[i],Korder[i]);
99 t = d; d = c; c = b; b = a; a = t;
102 for (; i < 48; ++i) {
103 HH(a,b,c,d,W[Worder[i]],Rorder[i],Korder[i]);
104 t = d; d = c; c = b; b = a; a = t;
107 for (; i < 64; ++i) {
108 II(a,b,c,d,W[Worder[i]],Rorder[i],Korder[i]);
109 t = d; d = c; c = b; b = a; a = t;
113 FF(a,b,c,d,W[0],7,0xd76aa478UL)
114 FF(d,a,b,c,W[1],12,0xe8c7b756UL)
115 FF(c,d,a,b,W[2],17,0x242070dbUL)
116 FF(b,c,d,a,W[3],22,0xc1bdceeeUL)
117 FF(a,b,c,d,W[4],7,0xf57c0fafUL)
118 FF(d,a,b,c,W[5],12,0x4787c62aUL)
119 FF(c,d,a,b,W[6],17,0xa8304613UL)
120 FF(b,c,d,a,W[7],22,0xfd469501UL)
121 FF(a,b,c,d,W[8],7,0x698098d8UL)
122 FF(d,a,b,c,W[9],12,0x8b44f7afUL)
123 FF(c,d,a,b,W[10],17,0xffff5bb1UL)
124 FF(b,c,d,a,W[11],22,0x895cd7beUL)
125 FF(a,b,c,d,W[12],7,0x6b901122UL)
126 FF(d,a,b,c,W[13],12,0xfd987193UL)
127 FF(c,d,a,b,W[14],17,0xa679438eUL)
128 FF(b,c,d,a,W[15],22,0x49b40821UL)
129 GG(a,b,c,d,W[1],5,0xf61e2562UL)
130 GG(d,a,b,c,W[6],9,0xc040b340UL)
131 GG(c,d,a,b,W[11],14,0x265e5a51UL)
132 GG(b,c,d,a,W[0],20,0xe9b6c7aaUL)
133 GG(a,b,c,d,W[5],5,0xd62f105dUL)
134 GG(d,a,b,c,W[10],9,0x02441453UL)
135 GG(c,d,a,b,W[15],14,0xd8a1e681UL)
136 GG(b,c,d,a,W[4],20,0xe7d3fbc8UL)
137 GG(a,b,c,d,W[9],5,0x21e1cde6UL)
138 GG(d,a,b,c,W[14],9,0xc33707d6UL)
139 GG(c,d,a,b,W[3],14,0xf4d50d87UL)
140 GG(b,c,d,a,W[8],20,0x455a14edUL)
141 GG(a,b,c,d,W[13],5,0xa9e3e905UL)
142 GG(d,a,b,c,W[2],9,0xfcefa3f8UL)
143 GG(c,d,a,b,W[7],14,0x676f02d9UL)
144 GG(b,c,d,a,W[12],20,0x8d2a4c8aUL)
145 HH(a,b,c,d,W[5],4,0xfffa3942UL)
146 HH(d,a,b,c,W[8],11,0x8771f681UL)
147 HH(c,d,a,b,W[11],16,0x6d9d6122UL)
148 HH(b,c,d,a,W[14],23,0xfde5380cUL)
149 HH(a,b,c,d,W[1],4,0xa4beea44UL)
150 HH(d,a,b,c,W[4],11,0x4bdecfa9UL)
151 HH(c,d,a,b,W[7],16,0xf6bb4b60UL)
152 HH(b,c,d,a,W[10],23,0xbebfbc70UL)
153 HH(a,b,c,d,W[13],4,0x289b7ec6UL)
154 HH(d,a,b,c,W[0],11,0xeaa127faUL)
155 HH(c,d,a,b,W[3],16,0xd4ef3085UL)
156 HH(b,c,d,a,W[6],23,0x04881d05UL)
157 HH(a,b,c,d,W[9],4,0xd9d4d039UL)
158 HH(d,a,b,c,W[12],11,0xe6db99e5UL)
159 HH(c,d,a,b,W[15],16,0x1fa27cf8UL)
160 HH(b,c,d,a,W[2],23,0xc4ac5665UL)
161 II(a,b,c,d,W[0],6,0xf4292244UL)
162 II(d,a,b,c,W[7],10,0x432aff97UL)
163 II(c,d,a,b,W[14],15,0xab9423a7UL)
164 II(b,c,d,a,W[5],21,0xfc93a039UL)
165 II(a,b,c,d,W[12],6,0x655b59c3UL)
166 II(d,a,b,c,W[3],10,0x8f0ccc92UL)
167 II(c,d,a,b,W[10],15,0xffeff47dUL)
168 II(b,c,d,a,W[1],21,0x85845dd1UL)
169 II(a,b,c,d,W[8],6,0x6fa87e4fUL)
170 II(d,a,b,c,W[15],10,0xfe2ce6e0UL)
171 II(c,d,a,b,W[6],15,0xa3014314UL)
172 II(b,c,d,a,W[13],21,0x4e0811a1UL)
173 II(a,b,c,d,W[4],6,0xf7537e82UL)
174 II(d,a,b,c,W[11],10,0xbd3af235UL)
175 II(c,d,a,b,W[2],15,0x2ad7d2bbUL)
176 II(b,c,d,a,W[9],21,0xeb86d391UL)
179 md->md5.state[0] = md->md5.state[0] + a;
180 md->md5.state[1] = md->md5.state[1] + b;
181 md->md5.state[2] = md->md5.state[2] + c;
182 md->md5.state[3] = md->md5.state[3] + d;
187 int md5_init(hash_state * md) {
188 md->md5.state[0] = 0x67452301UL;
189 md->md5.state[1] = 0xefcdab89UL;
190 md->md5.state[2] = 0x98badcfeUL;
191 md->md5.state[3] = 0x10325476UL;
198 Process a block of memory though the hash
199 @param md The hash state
200 @param in The data to hash
201 @param inlen The length of the data (octets)
202 @return CRYPT_OK if successful
204 HASH_PROCESS(md5_process, md5_compress, md5, 64)
206 int md5_done(hash_state * md, unsigned char *out) {
209 if (md->md5.curlen >= sizeof(md->md5.buf)) {
210 return CRYPT_INVALID_ARG;
213 /* increase the length of the message */
214 md->md5.length += md->md5.curlen * 8;
216 /* append the '1' bit */
217 md->md5.buf[md->md5.curlen++] = (unsigned char)0x80;
219 /* if the length is currently above 56 bytes we append zeros
220 * then compress. Then we can fall back to padding zeros and length
221 * encoding like normal.
223 if (md->md5.curlen > 56) {
224 while (md->md5.curlen < 64) {
225 md->md5.buf[md->md5.curlen++] = (unsigned char)0;
227 md5_compress(md, md->md5.buf);
231 /* pad upto 56 bytes of zeroes */
232 while (md->md5.curlen < 56) {
233 md->md5.buf[md->md5.curlen++] = (unsigned char)0;
237 STORE64L(md->md5.length, md->md5.buf+56);
238 md5_compress(md, md->md5.buf);
241 for (i = 0; i < 4; i++) {
242 STORE32L(md->md5.state[i], out+(4*i));
252 static const struct {
254 unsigned char hash[16];
257 { 0xd4, 0x1d, 0x8c, 0xd9, 0x8f, 0x00, 0xb2, 0x04,
258 0xe9, 0x80, 0x09, 0x98, 0xec, 0xf8, 0x42, 0x7e } },
260 {0x0c, 0xc1, 0x75, 0xb9, 0xc0, 0xf1, 0xb6, 0xa8,
261 0x31, 0xc3, 0x99, 0xe2, 0x69, 0x77, 0x26, 0x61 } },
263 { 0x90, 0x01, 0x50, 0x98, 0x3c, 0xd2, 0x4f, 0xb0,
264 0xd6, 0x96, 0x3f, 0x7d, 0x28, 0xe1, 0x7f, 0x72 } },
266 { 0xf9, 0x6b, 0x69, 0x7d, 0x7c, 0xb7, 0x93, 0x8d,
267 0x52, 0x5a, 0x2f, 0x31, 0xaa, 0xf1, 0x61, 0xd0 } },
268 { "abcdefghijklmnopqrstuvwxyz",
269 { 0xc3, 0xfc, 0xd3, 0xd7, 0x61, 0x92, 0xe4, 0x00,
270 0x7d, 0xfb, 0x49, 0x6c, 0xca, 0x67, 0xe1, 0x3b } },
271 { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
272 { 0xd1, 0x74, 0xab, 0x98, 0xd2, 0x77, 0xd9, 0xf5,
273 0xa5, 0x61, 0x1c, 0x2c, 0x9f, 0x41, 0x9d, 0x9f } },
274 { "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
275 { 0x57, 0xed, 0xf4, 0xa2, 0x2b, 0xe3, 0xc9, 0x55,
276 0xac, 0x49, 0xda, 0x2e, 0x21, 0x07, 0xb6, 0x7a } },
281 unsigned char tmp[16];
284 for (i = 0; tests[i].msg != NULL; i++) {
286 md5_process(&md, (unsigned char *)tests[i].msg, (unsigned long)strlen(tests[i].msg));
288 if (XMEMCMP(tmp, tests[i].hash, 16) != 0) {
289 return CRYPT_FAIL_TESTVECTOR;