1 /*
2 * Copyright 2005 Sun Microsystems, Inc. All rights reserved.
3 * Use is subject to license terms.
4 */
5
6 #include "md5.h"
7
8 /*
9 **************************************************************************
10 ** md5.c -- the source code for MD5 routines **
11 ** RSA Data Security, Inc. MD5 Message-Digest Algorithm **
12 ** Created: 2/17/90 RLR **
13 ** Revised: 1/91 SRD, AJ, BSK, JT Reference C ver., 7/10 constant corr. **
14 **************************************************************************
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
42 /*
43 **************************************************************************
44 ** Message-digest routines: **
45 ** To form the message digest for a message M **
46 ** (1) Initialize a context buffer mdContext using MD5Init **
47 ** (2) Call MD5Update on mdContext and M **
48 ** (3) Call MD5Final on mdContext **
49 ** The message digest is now in mdContext->digest[0...15] **
50 **************************************************************************
51 */
52
53 /* forward declaration */
54 static void Transform (UINT4 *buf, UINT4 *in);
55
56 static unsigned char PADDING[64] = {
57 0x80, 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 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
64 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
65 };
66
67 /* F, G, H and I are basic MD5 functions */
68 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
69 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
70 #define H(x, y, z) ((x) ^ (y) ^ (z))
71 #define I(x, y, z) ((y) ^ ((x) | (~z)))
72
73 /* ROTATE_LEFT rotates x left n bits */
74 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
75
76 /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4 */
77 /* Rotation is separate from addition to prevent recomputation */
78 #define FF(a, b, c, d, x, s, ac) \
79 {(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
80 (a) = ROTATE_LEFT ((a), (s)); \
81 (a) += (b); \
82 }
83 #define GG(a, b, c, d, x, s, ac) \
84 {(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
85 (a) = ROTATE_LEFT ((a), (s)); \
86 (a) += (b); \
87 }
88 #define HH(a, b, c, d, x, s, ac) \
89 {(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
90 (a) = ROTATE_LEFT ((a), (s)); \
91 (a) += (b); \
92 }
93 #define II(a, b, c, d, x, s, ac) \
94 {(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
95 (a) = ROTATE_LEFT ((a), (s)); \
96 (a) += (b); \
97 }
98
99 /*
100 * The routine MD5Init initializes the message-digest context
101 * mdContext. All fields are set to zero.
102 */
MD5Init(MD5_CTX * mdContext)103 void MD5Init (MD5_CTX *mdContext)
104 {
105 mdContext->i[0] = mdContext->i[1] = (UINT4)0;
106
107 /*
108 * Load magic initialization constants.
109 */
110 mdContext->buf[0] = (UINT4)0x67452301;
111 mdContext->buf[1] = (UINT4)0xefcdab89;
112 mdContext->buf[2] = (UINT4)0x98badcfe;
113 mdContext->buf[3] = (UINT4)0x10325476;
114 }
115
116 /*
117 * The routine MD5Update updates the message-digest context to
118 * account for the presence of each of the characters inBuf[0..inLen-1]
119 * in the message whose digest is being computed.
120 */
MD5Update(MD5_CTX * mdContext,unsigned char * inBuf,unsigned int inLen)121 void MD5Update (MD5_CTX *mdContext, unsigned char *inBuf, unsigned int inLen)
122 {
123 UINT4 in[16];
124 int mdi;
125 unsigned int i, ii;
126
127 /* compute number of bytes mod 64 */
128 mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
129
130 /* update number of bits */
131 if ((mdContext->i[0] + ((UINT4)inLen << 3)) < mdContext->i[0])
132 mdContext->i[1]++;
133 mdContext->i[0] += ((UINT4)inLen << 3);
134 mdContext->i[1] += ((UINT4)inLen >> 29);
135
136 while (inLen--) {
137 /* add new character to buffer, increment mdi */
138 mdContext->in[mdi++] = *inBuf++;
139
140 /* transform if necessary */
141 if (mdi == 0x40) {
142 for (i = 0, ii = 0; i < 16; i++, ii += 4)
143 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
144 (((UINT4)mdContext->in[ii+2]) << 16) |
145 (((UINT4)mdContext->in[ii+1]) << 8) |
146 ((UINT4)mdContext->in[ii]);
147 Transform (mdContext->buf, in);
148 mdi = 0;
149 }
150 }
151 }
152
153 /*
154 * The routine MD5Final terminates the message-digest computation and
155 * ends with the desired message digest in mdContext->digest[0...15].
156 */
MD5Final(MD5_CTX * mdContext)157 void MD5Final (MD5_CTX *mdContext)
158 {
159 UINT4 in[16];
160 int mdi;
161 unsigned int i, ii;
162 unsigned int padLen;
163
164 /* save number of bits */
165 in[14] = mdContext->i[0];
166 in[15] = mdContext->i[1];
167
168 /* compute number of bytes mod 64 */
169 mdi = (int)((mdContext->i[0] >> 3) & 0x3F);
170
171 /* pad out to 56 mod 64 */
172 padLen = (mdi < 56) ? (56 - mdi) : (120 - mdi);
173 MD5Update (mdContext, PADDING, padLen);
174
175 /* append length in bits and transform */
176 for (i = 0, ii = 0; i < 14; i++, ii += 4)
177 in[i] = (((UINT4)mdContext->in[ii+3]) << 24) |
178 (((UINT4)mdContext->in[ii+2]) << 16) |
179 (((UINT4)mdContext->in[ii+1]) << 8) |
180 ((UINT4)mdContext->in[ii]);
181 Transform (mdContext->buf, in);
182
183 /* store buffer in digest */
184 for (i = 0, ii = 0; i < 4; i++, ii += 4) {
185 mdContext->digest[ii] =
186 (unsigned char)(mdContext->buf[i] & 0xFF);
187 mdContext->digest[ii+1] =
188 (unsigned char)((mdContext->buf[i] >> 8) & 0xFF);
189 mdContext->digest[ii+2] =
190 (unsigned char)((mdContext->buf[i] >> 16) & 0xFF);
191 mdContext->digest[ii+3] =
192 (unsigned char)((mdContext->buf[i] >> 24) & 0xFF);
193 }
194 }
195
196 /*
197 * Basic MD5 step. Transforms buf based on in.
198 */
Transform(UINT4 * buf,UINT4 * in)199 static void Transform (UINT4 *buf, UINT4 *in)
200 {
201 UINT4 a = buf[0], b = buf[1], c = buf[2], d = buf[3];
202
203 /* Round 1 */
204 #define S11 7
205 #define S12 12
206 #define S13 17
207 #define S14 22
208 FF (a, b, c, d, in[ 0], S11, 3614090360U); /* 1 */
209 FF (d, a, b, c, in[ 1], S12, 3905402710U); /* 2 */
210 FF (c, d, a, b, in[ 2], S13, 606105819U); /* 3 */
211 FF (b, c, d, a, in[ 3], S14, 3250441966U); /* 4 */
212 FF (a, b, c, d, in[ 4], S11, 4118548399U); /* 5 */
213 FF (d, a, b, c, in[ 5], S12, 1200080426U); /* 6 */
214 FF (c, d, a, b, in[ 6], S13, 2821735955U); /* 7 */
215 FF (b, c, d, a, in[ 7], S14, 4249261313U); /* 8 */
216 FF (a, b, c, d, in[ 8], S11, 1770035416U); /* 9 */
217 FF (d, a, b, c, in[ 9], S12, 2336552879U); /* 10 */
218 FF (c, d, a, b, in[10], S13, 4294925233U); /* 11 */
219 FF (b, c, d, a, in[11], S14, 2304563134U); /* 12 */
220 FF (a, b, c, d, in[12], S11, 1804603682U); /* 13 */
221 FF (d, a, b, c, in[13], S12, 4254626195U); /* 14 */
222 FF (c, d, a, b, in[14], S13, 2792965006U); /* 15 */
223 FF (b, c, d, a, in[15], S14, 1236535329U); /* 16 */
224
225 /* Round 2 */
226 #define S21 5
227 #define S22 9
228 #define S23 14
229 #define S24 20
230 GG (a, b, c, d, in[ 1], S21, 4129170786U); /* 17 */
231 GG (d, a, b, c, in[ 6], S22, 3225465664U); /* 18 */
232 GG (c, d, a, b, in[11], S23, 643717713U); /* 19 */
233 GG (b, c, d, a, in[ 0], S24, 3921069994U); /* 20 */
234 GG (a, b, c, d, in[ 5], S21, 3593408605U); /* 21 */
235 GG (d, a, b, c, in[10], S22, 38016083U); /* 22 */
236 GG (c, d, a, b, in[15], S23, 3634488961U); /* 23 */
237 GG (b, c, d, a, in[ 4], S24, 3889429448U); /* 24 */
238 GG (a, b, c, d, in[ 9], S21, 568446438U); /* 25 */
239 GG (d, a, b, c, in[14], S22, 3275163606U); /* 26 */
240 GG (c, d, a, b, in[ 3], S23, 4107603335U); /* 27 */
241 GG (b, c, d, a, in[ 8], S24, 1163531501U); /* 28 */
242 GG (a, b, c, d, in[13], S21, 2850285829U); /* 29 */
243 GG (d, a, b, c, in[ 2], S22, 4243563512U); /* 30 */
244 GG (c, d, a, b, in[ 7], S23, 1735328473U); /* 31 */
245 GG (b, c, d, a, in[12], S24, 2368359562U); /* 32 */
246
247 /* Round 3 */
248 #define S31 4
249 #define S32 11
250 #define S33 16
251 #define S34 23
252 HH (a, b, c, d, in[ 5], S31, 4294588738U); /* 33 */
253 HH (d, a, b, c, in[ 8], S32, 2272392833U); /* 34 */
254 HH (c, d, a, b, in[11], S33, 1839030562U); /* 35 */
255 HH (b, c, d, a, in[14], S34, 4259657740U); /* 36 */
256 HH (a, b, c, d, in[ 1], S31, 2763975236U); /* 37 */
257 HH (d, a, b, c, in[ 4], S32, 1272893353U); /* 38 */
258 HH (c, d, a, b, in[ 7], S33, 4139469664U); /* 39 */
259 HH (b, c, d, a, in[10], S34, 3200236656U); /* 40 */
260 HH (a, b, c, d, in[13], S31, 681279174U); /* 41 */
261 HH (d, a, b, c, in[ 0], S32, 3936430074U); /* 42 */
262 HH (c, d, a, b, in[ 3], S33, 3572445317U); /* 43 */
263 HH (b, c, d, a, in[ 6], S34, 76029189U); /* 44 */
264 HH (a, b, c, d, in[ 9], S31, 3654602809U); /* 45 */
265 HH (d, a, b, c, in[12], S32, 3873151461U); /* 46 */
266 HH (c, d, a, b, in[15], S33, 530742520U); /* 47 */
267 HH (b, c, d, a, in[ 2], S34, 3299628645U); /* 48 */
268
269 /* Round 4 */
270 #define S41 6
271 #define S42 10
272 #define S43 15
273 #define S44 21
274 II (a, b, c, d, in[ 0], S41, 4096336452U); /* 49 */
275 II (d, a, b, c, in[ 7], S42, 1126891415U); /* 50 */
276 II (c, d, a, b, in[14], S43, 2878612391U); /* 51 */
277 II (b, c, d, a, in[ 5], S44, 4237533241U); /* 52 */
278 II (a, b, c, d, in[12], S41, 1700485571U); /* 53 */
279 II (d, a, b, c, in[ 3], S42, 2399980690U); /* 54 */
280 II (c, d, a, b, in[10], S43, 4293915773U); /* 55 */
281 II (b, c, d, a, in[ 1], S44, 2240044497U); /* 56 */
282 II (a, b, c, d, in[ 8], S41, 1873313359U); /* 57 */
283 II (d, a, b, c, in[15], S42, 4264355552U); /* 58 */
284 II (c, d, a, b, in[ 6], S43, 2734768916U); /* 59 */
285 II (b, c, d, a, in[13], S44, 1309151649U); /* 60 */
286 II (a, b, c, d, in[ 4], S41, 4149444226U); /* 61 */
287 II (d, a, b, c, in[11], S42, 3174756917U); /* 62 */
288 II (c, d, a, b, in[ 2], S43, 718787259U); /* 63 */
289 II (b, c, d, a, in[ 9], S44, 3951481745U); /* 64 */
290
291 buf[0] += a;
292 buf[1] += b;
293 buf[2] += c;
294 buf[3] += d;
295 }
296