1 /*
2 ***********************************************************************
3 ** md5.c -- the source code for MD5 routines **
4 ** RSA Data Security, Inc. MD5 Message-Digest Algorithm **
5 ** Created: 2/17/90 RLR **
6 ** Revised: 1/91 SRD,AJ,BSK,JT Reference C Version **
7 ***********************************************************************
8 */
9
10 /*
11 * Edited 7 May 93 by CP to change the interface to match that
12 * of the MD5 routines in RSAREF. Due to this alteration, this
13 * code is "derived from the RSA Data Security, Inc. MD5 Message-
14 * Digest Algorithm". (See below.)
15 */
16
17 /*
18 ***********************************************************************
19 ** Copyright (C) 1990, RSA Data Security, Inc. All rights reserved. **
20 ** **
21 ** License to copy and use this software is granted provided that **
22 ** it is identified as the "RSA Data Security, Inc. MD5 Message- **
23 ** Digest Algorithm" in all material mentioning or referencing this **
24 ** software or this function. **
25 ** **
26 ** License is also granted to make and use derivative works **
27 ** provided that such works are identified as "derived from the RSA **
28 ** Data Security, Inc. MD5 Message-Digest Algorithm" in all **
29 ** material mentioning or referencing the derived work. **
30 ** **
31 ** RSA Data Security, Inc. makes no representations concerning **
32 ** either the merchantability of this software or the suitability **
33 ** of this software for any particular purpose. It is provided "as **
34 ** is" without express or implied warranty of any kind. **
35 ** **
36 ** These notices must be retained in any copies of any part of this **
37 ** documentation and/or software. **
38 ***********************************************************************
39 */
40
41 #include "md5.h"
42
43 /*
44 ***********************************************************************
45 ** Message-digest routines: **
46 ** To form the message digest for a message M **
47 ** (1) Initialize a context buffer mdContext using MD5Init **
48 ** (2) Call MD5Update on mdContext and M **
49 ** (3) Call MD5Final on mdContext **
50 ** The message digest is now in the bugffer passed to MD5Final **
51 ***********************************************************************
52 */
53
54 static unsigned char PADDING[64] = {
55 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
56 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
57 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
58 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
59 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
60 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
61 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
62 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
63 };
64
65 /* F, G, H and I are basic MD5 functions */
66 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
67 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
68 #define H(x, y, z) ((x) ^ (y) ^ (z))
69 #define I(x, y, z) ((y) ^ ((x) | (~z)))
70
71 /* ROTATE_LEFT rotates x left n bits */
72 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
73
74 /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
75 /* Rotation is separate from addition to prevent recomputation */
76 #define FF(a, b, c, d, x, s, ac) \
77 {(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
78 (a) = ROTATE_LEFT ((a), (s)); \
79 (a) += (b); \
80 }
81 #define GG(a, b, c, d, x, s, ac) \
82 {(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
83 (a) = ROTATE_LEFT ((a), (s)); \
84 (a) += (b); \
85 }
86 #define HH(a, b, c, d, x, s, ac) \
87 {(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
88 (a) = ROTATE_LEFT ((a), (s)); \
89 (a) += (b); \
90 }
91 #define II(a, b, c, d, x, s, ac) \
92 {(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
93 (a) = ROTATE_LEFT ((a), (s)); \
94 (a) += (b); \
95 }
96
97 /* The routine MD5Init initializes the message-digest context
98 mdContext. All fields are set to zero.
99 */
MD5Init(mdContext)100 void MD5Init (mdContext)
101 MD5_CTX *mdContext;
102 {
103 mdContext->i[0] = mdContext->i[1] = (UINT4)0;
104
105 /* Load magic initialization constants.
106 */
107 mdContext->buf[0] = (UINT4)0x67452301L;
108 mdContext->buf[1] = (UINT4)0xefcdab89L;
109 mdContext->buf[2] = (UINT4)0x98badcfeL;
110 mdContext->buf[3] = (UINT4)0x10325476L;
111 }
112
113 /* The routine MD5Update updates the message-digest context to
114 account for the presence of each of the characters inBuf[0..inLen-1]
115 in the message whose digest is being computed.
116 */
MD5Update(mdContext,inBuf,inLen)117 void MD5Update (mdContext, inBuf, inLen)
118 register MD5_CTX *mdContext; const unsigned char *inBuf;
119 unsigned int inLen;
120 {
121 register int i, ii;
122 int mdi;
123 UINT4 in[16];
124
125 /* compute number of bytes mod 64 */
126 mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
127
128 /* update number of bits */
129 if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])
130 mdContext->i[1]++;
131 mdContext->i[0] += ((UINT4)inLen << 3);
132 mdContext->i[1] += ((UINT4)inLen >> 29);
133
134 while (inLen--) {
135 /* add new character to buffer, increment mdi */
136 mdContext->in[mdi++] = *inBuf++;
137
138 /* transform if necessary */
139 if (mdi == 0x40) {
140 for (i = 0, ii = 0; i < 16; i++, ii += 4)
141 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
142 (((UINT4)mdContext->in[ii+2]) << 16) |
143 (((UINT4)mdContext->in[ii+1]) << 8) |
144 ((UINT4)mdContext->in[ii]);
145 Transform (mdContext->buf, in);
146 mdi = 0;
147 }
148 }
149 }
150
151 /* The routine MD5Final terminates the message-digest computation and
152 ends with the desired message digest in mdContext->digest[0...15].
153 */
MD5Final(digest,mdContext)154 void MD5Final (digest, mdContext)
155 unsigned char digest[16]; MD5_CTX *mdContext;
156 {
157 UINT4 in[16];
158 int mdi;
159 unsigned int i, ii;
160 unsigned int padLen;
161
162 /* save number of bits */
163 in[14] = mdContext->i[0];
164 in[15] = mdContext->i[1];
165
166 /* compute number of bytes mod 64 */
167 mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
168
169 /* pad out to 56 mod 64 */
170 padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
171 MD5Update (mdContext, PADDING, padLen);
172
173 /* append length in bits and transform */
174 for (i = 0, ii = 0; i < 14; i++, ii += 4)
175 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
176 (((UINT4)mdContext->in[ii+2]) << 16) |
177 (((UINT4)mdContext->in[ii+1]) << 8) |
178 ((UINT4)mdContext->in[ii]);
179 Transform (mdContext->buf, in);
180
181 /* store buffer in digest */
182 for (i = 0, ii = 0; i < 4; i++, ii += 4) {
183 digest[ii] = (unsigned char) (mdContext->buf[i] & 0xFF);
184 digest[ii+1] = (unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
185 digest[ii+2] = (unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
186 digest[ii+3] = (unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
187 }
188 }
189
190 /* Basic MD5 step. Transforms buf based on in. Note that if the Mysterious
191 Constants are arranged backwards in little-endian order and decrypted with
192 the DES they produce OCCULT MESSAGES!
193 */
Transform(buf,in)194 void Transform(buf, in)
195 register UINT4 *buf;
196 register UINT4 *in;
197 {
198 register UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
199
200 /* Round 1 */
201 #define S11 7
202 #define S12 12
203 #define S13 17
204 #define S14 22
205 FF ( a, b, c, d, in[ 0], S11, 0xD76AA478L); /* 1 */
206 FF ( d, a, b, c, in[ 1], S12, 0xE8C7B756L); /* 2 */
207 FF ( c, d, a, b, in[ 2], S13, 0x242070DBL); /* 3 */
208 FF ( b, c, d, a, in[ 3], S14, 0xC1BDCEEEL); /* 4 */
209 FF ( a, b, c, d, in[ 4], S11, 0xF57C0FAFL); /* 5 */
210 FF ( d, a, b, c, in[ 5], S12, 0x4787C62AL); /* 6 */
211 FF ( c, d, a, b, in[ 6], S13, 0xA8304613L); /* 7 */
212 FF ( b, c, d, a, in[ 7], S14, 0xFD469501L); /* 8 */
213 FF ( a, b, c, d, in[ 8], S11, 0x698098D8L); /* 9 */
214 FF ( d, a, b, c, in[ 9], S12, 0x8B44F7AFL); /* 10 */
215 FF ( c, d, a, b, in[10], S13, 0xFFFF5BB1L); /* 11 */
216 FF ( b, c, d, a, in[11], S14, 0x895CD7BEL); /* 12 */
217 FF ( a, b, c, d, in[12], S11, 0x6B901122L); /* 13 */
218 FF ( d, a, b, c, in[13], S12, 0xFD987193L); /* 14 */
219 FF ( c, d, a, b, in[14], S13, 0xA679438EL); /* 15 */
220 FF ( b, c, d, a, in[15], S14, 0x49B40821L); /* 16 */
221
222 /* Round 2 */
223 #define S21 5
224 #define S22 9
225 #define S23 14
226 #define S24 20
227 GG ( a, b, c, d, in[ 1], S21, 0xF61E2562L); /* 17 */
228 GG ( d, a, b, c, in[ 6], S22, 0xC040B340L); /* 18 */
229 GG ( c, d, a, b, in[11], S23, 0x265E5A51L); /* 19 */
230 GG ( b, c, d, a, in[ 0], S24, 0xE9B6C7AAL); /* 20 */
231 GG ( a, b, c, d, in[ 5], S21, 0xD62F105DL); /* 21 */
232 GG ( d, a, b, c, in[10], S22, 0x02441453L); /* 22 */
233 GG ( c, d, a, b, in[15], S23, 0xD8A1E681L); /* 23 */
234 GG ( b, c, d, a, in[ 4], S24, 0xE7D3FBC8L); /* 24 */
235 GG ( a, b, c, d, in[ 9], S21, 0x21E1CDE6L); /* 25 */
236 GG ( d, a, b, c, in[14], S22, 0xC33707D6L); /* 26 */
237 GG ( c, d, a, b, in[ 3], S23, 0xF4D50D87L); /* 27 */
238 GG ( b, c, d, a, in[ 8], S24, 0x455A14EDL); /* 28 */
239 GG ( a, b, c, d, in[13], S21, 0xA9E3E905L); /* 29 */
240 GG ( d, a, b, c, in[ 2], S22, 0xFCEFA3F8L); /* 30 */
241 GG ( c, d, a, b, in[ 7], S23, 0x676F02D9L); /* 31 */
242 GG ( b, c, d, a, in[12], S24, 0x8D2A4C8AL); /* 32 */
243
244 /* Round 3 */
245 #define S31 4
246 #define S32 11
247 #define S33 16
248 #define S34 23
249 HH ( a, b, c, d, in[ 5], S31, 0xFFFA3942L); /* 33 */
250 HH ( d, a, b, c, in[ 8], S32, 0x8771F681L); /* 34 */
251 HH ( c, d, a, b, in[11], S33, 0x6D9D6122L); /* 35 */
252 HH ( b, c, d, a, in[14], S34, 0xFDE5380CL); /* 36 */
253 HH ( a, b, c, d, in[ 1], S31, 0xA4BEEA44L); /* 37 */
254 HH ( d, a, b, c, in[ 4], S32, 0x4BDECFA9L); /* 38 */
255 HH ( c, d, a, b, in[ 7], S33, 0xF6BB4B60L); /* 39 */
256 HH ( b, c, d, a, in[10], S34, 0xBEBFBC70L); /* 40 */
257 HH ( a, b, c, d, in[13], S31, 0x289B7EC6L); /* 41 */
258 HH ( d, a, b, c, in[ 0], S32, 0xEAA127FAL); /* 42 */
259 HH ( c, d, a, b, in[ 3], S33, 0xD4EF3085L); /* 43 */
260 HH ( b, c, d, a, in[ 6], S34, 0x04881D05L); /* 44 */
261 HH ( a, b, c, d, in[ 9], S31, 0xD9D4D039L); /* 45 */
262 HH ( d, a, b, c, in[12], S32, 0xE6DB99E5L); /* 46 */
263 HH ( c, d, a, b, in[15], S33, 0x1FA27CF8L); /* 47 */
264 HH ( b, c, d, a, in[ 2], S34, 0xC4AC5665L); /* 48 */
265
266 /* Round 4 */
267 #define S41 6
268 #define S42 10
269 #define S43 15
270 #define S44 21
271 II ( a, b, c, d, in[ 0], S41, 0xF4292244L); /* 49 */
272 II ( d, a, b, c, in[ 7], S42, 0x432AFF97L); /* 50 */
273 II ( c, d, a, b, in[14], S43, 0xAB9423A7L); /* 51 */
274 II ( b, c, d, a, in[ 5], S44, 0xFC93A039L); /* 52 */
275 II ( a, b, c, d, in[12], S41, 0x655B59C3L); /* 53 */
276 II ( d, a, b, c, in[ 3], S42, 0x8F0CCC92L); /* 54 */
277 II ( c, d, a, b, in[10], S43, 0xFFEFF47DL); /* 55 */
278 II ( b, c, d, a, in[ 1], S44, 0x85845DD1L); /* 56 */
279 II ( a, b, c, d, in[ 8], S41, 0x6FA87E4FL); /* 57 */
280 II ( d, a, b, c, in[15], S42, 0xFE2CE6E0L); /* 58 */
281 II ( c, d, a, b, in[ 6], S43, 0xA3014314L); /* 59 */
282 II ( b, c, d, a, in[13], S44, 0x4E0811A1L); /* 60 */
283 II ( a, b, c, d, in[ 4], S41, 0xF7537E82L); /* 61 */
284 II ( d, a, b, c, in[11], S42, 0xBD3AF235L); /* 62 */
285 II ( c, d, a, b, in[ 2], S43, 0x2AD7D2BBL); /* 63 */
286 II ( b, c, d, a, in[ 9], S44, 0xEB86D391L); /* 64 */
287
288 buf[0] += a;
289 buf[1] += b;
290 buf[2] += c;
291 buf[3] += d;
292 }
293
294