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