6 ***********************************************************************
7 ** md5.c -- the source code for MD5 routines **
8 ** RSA Data Security, Inc. MD5 Message-Digest Algorithm **
9 ** Created: 2/17/90 RLR **
10 ** Revised: 1/91 SRD,AJ,BSK,JT Reference C ver., 7/10 constant corr. **
11 ***********************************************************************
15 ***********************************************************************
16 ** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
18 ** License to copy and use this software is granted provided that **
19 ** it is identified as the "RSA Data Security, Inc. MD5 Message- **
20 ** Digest Algorithm" in all material mentioning or referencing this **
21 ** software or this function. **
23 ** License is also granted to make and use derivative works **
24 ** provided that such works are identified as "derived from the RSA **
25 ** Data Security, Inc. MD5 Message-Digest Algorithm" in all **
26 ** material mentioning or referencing the derived work. **
28 ** RSA Data Security, Inc. makes no representations concerning **
29 ** either the merchantability of this software or the suitability **
30 ** of this software for any particular purpose. It is provided "as **
31 ** is" without express or implied warranty of any kind. **
33 ** These notices must be retained in any copies of any part of this **
34 ** documentation and/or software. **
35 ***********************************************************************
38 #if defined(linux) && defined(_KERNEL)
39 extern void *memcpy(void *, const void *, unsigned long);
40 # define bcopy(a,b,c) memcpy(b,a,c)
42 # if defined(_KERNEL) && !defined(__sgi)
43 # include <sys/systm.h>
52 ***********************************************************************
53 ** Message-digest routines: **
54 ** To form the message digest for a message M **
55 ** (1) Initialize a context buffer mdContext using MD5Init **
56 ** (2) Call MD5Update on mdContext and M **
57 ** (3) Call MD5Final on mdContext **
58 ** The message digest is now in mdContext->digest[0...15] **
59 ***********************************************************************
62 /* forward declaration */
63 static void Transform __P((UINT4 *, UINT4 *));
65 static unsigned char PADDING[64] = {
66 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
67 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
68 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
69 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
70 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
71 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
72 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
73 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
76 /* F, G, H and I are basic MD5 functions */
77 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
78 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
79 #define H(x, y, z) ((x) ^ (y) ^ (z))
80 #define I(x, y, z) ((y) ^ ((x) | (~z)))
82 /* ROTATE_LEFT rotates x left n bits */
83 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
85 /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
86 /* Rotation is separate from addition to prevent recomputation */
87 #define FF(a, b, c, d, x, s, ac) \
88 {(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
89 (a) = ROTATE_LEFT ((a), (s)); \
92 #define GG(a, b, c, d, x, s, ac) \
93 {(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
94 (a) = ROTATE_LEFT ((a), (s)); \
97 #define HH(a, b, c, d, x, s, ac) \
98 {(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
99 (a) = ROTATE_LEFT ((a), (s)); \
102 #define II(a, b, c, d, x, s, ac) \
103 {(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
104 (a) = ROTATE_LEFT ((a), (s)); \
114 /* The routine MD5Init initializes the message-digest context
115 mdContext. All fields are set to zero.
117 void MD5Init (mdContext)
120 mdContext->i[0] = mdContext->i[1] = (UINT4)0;
122 /* Load magic initialization constants.
124 mdContext->buf[0] = (UINT4)0x67452301;
125 mdContext->buf[1] = (UINT4)0xefcdab89;
126 mdContext->buf[2] = (UINT4)0x98badcfe;
127 mdContext->buf[3] = (UINT4)0x10325476;
130 /* The routine MD5Update updates the message-digest context to
131 account for the presence of each of the characters inBuf[0..inLen-1]
132 in the message whose digest is being computed.
134 void MD5Update (mdContext, inBuf, inLen)
136 unsigned char *inBuf;
143 /* compute number of bytes mod 64 */
144 mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
146 /* update number of bits */
147 if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])
149 mdContext->i[0] += ((UINT4)inLen << 3);
150 mdContext->i[1] += ((UINT4)inLen >> 29);
153 /* add new character to buffer, increment mdi */
154 mdContext->in[mdi++] = *inBuf++;
156 /* transform if necessary */
158 for (i = 0, ii = 0; i < 16; i++, ii += 4)
159 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
160 (((UINT4)mdContext->in[ii+2]) << 16) |
161 (((UINT4)mdContext->in[ii+1]) << 8) |
162 ((UINT4)mdContext->in[ii]);
163 Transform (mdContext->buf, in);
169 /* The routine MD5Final terminates the message-digest computation and
170 ends with the desired message digest in mdContext->digest[0...15].
172 void MD5Final (hash, mdContext)
173 unsigned char hash[];
181 /* save number of bits */
182 in[14] = mdContext->i[0];
183 in[15] = mdContext->i[1];
185 /* compute number of bytes mod 64 */
186 mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
188 /* pad out to 56 mod 64 */
189 padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
190 MD5Update (mdContext, PADDING, padLen);
192 /* append length in bits and transform */
193 for (i = 0, ii = 0; i < 14; i++, ii += 4)
194 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
195 (((UINT4)mdContext->in[ii+2]) << 16) |
196 (((UINT4)mdContext->in[ii+1]) << 8) |
197 ((UINT4)mdContext->in[ii]);
198 Transform (mdContext->buf, in);
200 /* store buffer in digest */
201 for (i = 0, ii = 0; i < 4; i++, ii += 4) {
202 mdContext->digest[ii] = (unsigned char)(mdContext->buf[i] & 0xFF);
203 mdContext->digest[ii+1] =
204 (unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
205 mdContext->digest[ii+2] =
206 (unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
207 mdContext->digest[ii+3] =
208 (unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
210 bcopy((char *)mdContext->digest, (char *)hash, 16);
213 /* Basic MD5 step. Transforms buf based on in.
215 static void Transform (buf, in)
219 UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
226 FF ( a, b, c, d, in[ 0], S11, UL(3614090360)); /* 1 */
227 FF ( d, a, b, c, in[ 1], S12, UL(3905402710)); /* 2 */
228 FF ( c, d, a, b, in[ 2], S13, UL( 606105819)); /* 3 */
229 FF ( b, c, d, a, in[ 3], S14, UL(3250441966)); /* 4 */
230 FF ( a, b, c, d, in[ 4], S11, UL(4118548399)); /* 5 */
231 FF ( d, a, b, c, in[ 5], S12, UL(1200080426)); /* 6 */
232 FF ( c, d, a, b, in[ 6], S13, UL(2821735955)); /* 7 */
233 FF ( b, c, d, a, in[ 7], S14, UL(4249261313)); /* 8 */
234 FF ( a, b, c, d, in[ 8], S11, UL(1770035416)); /* 9 */
235 FF ( d, a, b, c, in[ 9], S12, UL(2336552879)); /* 10 */
236 FF ( c, d, a, b, in[10], S13, UL(4294925233)); /* 11 */
237 FF ( b, c, d, a, in[11], S14, UL(2304563134)); /* 12 */
238 FF ( a, b, c, d, in[12], S11, UL(1804603682)); /* 13 */
239 FF ( d, a, b, c, in[13], S12, UL(4254626195)); /* 14 */
240 FF ( c, d, a, b, in[14], S13, UL(2792965006)); /* 15 */
241 FF ( b, c, d, a, in[15], S14, UL(1236535329)); /* 16 */
248 GG ( a, b, c, d, in[ 1], S21, UL(4129170786)); /* 17 */
249 GG ( d, a, b, c, in[ 6], S22, UL(3225465664)); /* 18 */
250 GG ( c, d, a, b, in[11], S23, UL( 643717713)); /* 19 */
251 GG ( b, c, d, a, in[ 0], S24, UL(3921069994)); /* 20 */
252 GG ( a, b, c, d, in[ 5], S21, UL(3593408605)); /* 21 */
253 GG ( d, a, b, c, in[10], S22, UL( 38016083)); /* 22 */
254 GG ( c, d, a, b, in[15], S23, UL(3634488961)); /* 23 */
255 GG ( b, c, d, a, in[ 4], S24, UL(3889429448)); /* 24 */
256 GG ( a, b, c, d, in[ 9], S21, UL( 568446438)); /* 25 */
257 GG ( d, a, b, c, in[14], S22, UL(3275163606)); /* 26 */
258 GG ( c, d, a, b, in[ 3], S23, UL(4107603335)); /* 27 */
259 GG ( b, c, d, a, in[ 8], S24, UL(1163531501)); /* 28 */
260 GG ( a, b, c, d, in[13], S21, UL(2850285829)); /* 29 */
261 GG ( d, a, b, c, in[ 2], S22, UL(4243563512)); /* 30 */
262 GG ( c, d, a, b, in[ 7], S23, UL(1735328473)); /* 31 */
263 GG ( b, c, d, a, in[12], S24, UL(2368359562)); /* 32 */
270 HH ( a, b, c, d, in[ 5], S31, UL(4294588738)); /* 33 */
271 HH ( d, a, b, c, in[ 8], S32, UL(2272392833)); /* 34 */
272 HH ( c, d, a, b, in[11], S33, UL(1839030562)); /* 35 */
273 HH ( b, c, d, a, in[14], S34, UL(4259657740)); /* 36 */
274 HH ( a, b, c, d, in[ 1], S31, UL(2763975236)); /* 37 */
275 HH ( d, a, b, c, in[ 4], S32, UL(1272893353)); /* 38 */
276 HH ( c, d, a, b, in[ 7], S33, UL(4139469664)); /* 39 */
277 HH ( b, c, d, a, in[10], S34, UL(3200236656)); /* 40 */
278 HH ( a, b, c, d, in[13], S31, UL( 681279174)); /* 41 */
279 HH ( d, a, b, c, in[ 0], S32, UL(3936430074)); /* 42 */
280 HH ( c, d, a, b, in[ 3], S33, UL(3572445317)); /* 43 */
281 HH ( b, c, d, a, in[ 6], S34, UL( 76029189)); /* 44 */
282 HH ( a, b, c, d, in[ 9], S31, UL(3654602809)); /* 45 */
283 HH ( d, a, b, c, in[12], S32, UL(3873151461)); /* 46 */
284 HH ( c, d, a, b, in[15], S33, UL( 530742520)); /* 47 */
285 HH ( b, c, d, a, in[ 2], S34, UL(3299628645)); /* 48 */
292 II ( a, b, c, d, in[ 0], S41, UL(4096336452)); /* 49 */
293 II ( d, a, b, c, in[ 7], S42, UL(1126891415)); /* 50 */
294 II ( c, d, a, b, in[14], S43, UL(2878612391)); /* 51 */
295 II ( b, c, d, a, in[ 5], S44, UL(4237533241)); /* 52 */
296 II ( a, b, c, d, in[12], S41, UL(1700485571)); /* 53 */
297 II ( d, a, b, c, in[ 3], S42, UL(2399980690)); /* 54 */
298 II ( c, d, a, b, in[10], S43, UL(4293915773)); /* 55 */
299 II ( b, c, d, a, in[ 1], S44, UL(2240044497)); /* 56 */
300 II ( a, b, c, d, in[ 8], S41, UL(1873313359)); /* 57 */
301 II ( d, a, b, c, in[15], S42, UL(4264355552)); /* 58 */
302 II ( c, d, a, b, in[ 6], S43, UL(2734768916)); /* 59 */
303 II ( b, c, d, a, in[13], S44, UL(1309151649)); /* 60 */
304 II ( a, b, c, d, in[ 4], S41, UL(4149444226)); /* 61 */
305 II ( d, a, b, c, in[11], S42, UL(3174756917)); /* 62 */
306 II ( c, d, a, b, in[ 2], S43, UL( 718787259)); /* 63 */
307 II ( b, c, d, a, in[ 9], S44, UL(3951481745)); /* 64 */
316 ***********************************************************************
318 ******************************** (cut) ********************************