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