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