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