Commit becab5a2 becab5a25cdcc2c01ea4a9510e2a10b00fe6cd61 by Sergey Poznyakoff

Replaced RSA code with one from public domain

1 parent 6bd00726
1 /* MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
2 */
3
4 /* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
5 rights reserved.
6
7 License to copy and use this software is granted provided that it
8 is identified as the "RSA Data Security, Inc. MD5 Message-Digest
9 Algorithm" in all material mentioning or referencing this software
10 or this function.
11
12 License is also granted to make and use derivative works provided
13 that such works are identified as "derived from the RSA Data
14 Security, Inc. MD5 Message-Digest Algorithm" in all material
15 mentioning or referencing the derived work.
16
17 RSA Data Security, Inc. makes no representations concerning either
18 the merchantability of this software or the suitability of this
19 software for any particular purpose. It is provided "as is"
20 without express or implied warranty of any kind.
21
22 These notices must be retained in any copies of any part of this
23 documentation and/or software.
24 */
25
26 #include "md5-rsa.h"
27
28 /* Constants for MD5Transform routine.
29 */
30
31 #define S11 7
32 #define S12 12
33 #define S13 17
34 #define S14 22
35 #define S21 5
36 #define S22 9
37 #define S23 14
38 #define S24 20
39 #define S31 4
40 #define S32 11
41 #define S33 16
42 #define S34 23
43 #define S41 6
44 #define S42 10
45 #define S43 15
46 #define S44 21
47
48 static void MD5Transform PROTO_LIST ((UINT4 [4], unsigned char [64]));
49 static void Encode PROTO_LIST
50 ((unsigned char *, UINT4 *, unsigned int));
51 static void Decode PROTO_LIST
52 ((UINT4 *, unsigned char *, unsigned int));
53 static void MD5_memcpy PROTO_LIST ((POINTER, POINTER, unsigned int));
54 static void MD5_memset PROTO_LIST ((POINTER, int, unsigned int));
55
56 static unsigned char PADDING[64] = {
57 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
58 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
59 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
60 };
61
62 /* F, G, H and I are basic MD5 functions.
63 */
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 */
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 */
76 #define FF(a, b, c, d, x, s, ac) { \
77 (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
78 (a) = ROTATE_LEFT ((a), (s)); \
79 (a) += (b); \
80 }
81 #define GG(a, b, c, d, x, s, ac) { \
82 (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
83 (a) = ROTATE_LEFT ((a), (s)); \
84 (a) += (b); \
85 }
86 #define HH(a, b, c, d, x, s, ac) { \
87 (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
88 (a) = ROTATE_LEFT ((a), (s)); \
89 (a) += (b); \
90 }
91 #define II(a, b, c, d, x, s, ac) { \
92 (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
93 (a) = ROTATE_LEFT ((a), (s)); \
94 (a) += (b); \
95 }
96
97 /* MD5 initialization. Begins an MD5 operation, writing a new context.
98 */
99 void MD5Init (context)
100 MD5_CTX *context; /* context */
101 {
102 context->count[0] = context->count[1] = 0;
103 /* Load magic initialization constants.
104 */
105 context->state[0] = 0x67452301;
106 context->state[1] = 0xefcdab89;
107 context->state[2] = 0x98badcfe;
108 context->state[3] = 0x10325476;
109 }
110
111 /* MD5 block update operation. Continues an MD5 message-digest
112 operation, processing another message block, and updating the
113 context.
114 */
115 void MD5Update (context, input, inputLen)
116 MD5_CTX *context; /* context */
117 unsigned char *input; /* input block */
118 unsigned int inputLen; /* length of input block */
119 {
120 unsigned int i, indx, partLen;
121
122 /* Compute number of bytes mod 64 */
123 indx = (unsigned int)((context->count[0] >> 3) & 0x3F);
124
125 /* Update number of bits */
126 if ((context->count[0] += ((UINT4)inputLen << 3))
127 < ((UINT4)inputLen << 3))
128 context->count[1]++;
129 context->count[1] += ((UINT4)inputLen >> 29);
130
131 partLen = 64 - indx;
132
133 /* Transform as many times as possible.
134 */
135 if (inputLen >= partLen) {
136 MD5_memcpy
137 ((POINTER)&context->buffer[indx], (POINTER)input, partLen);
138 MD5Transform (context->state, context->buffer);
139
140 for (i = partLen; i + 63 < inputLen; i += 64)
141 MD5Transform (context->state, &input[i]);
142
143 indx = 0;
144 }
145 else
146 i = 0;
147
148 /* Buffer remaining input */
149 MD5_memcpy
150 ((POINTER)&context->buffer[indx], (POINTER)&input[i],
151 inputLen-i);
152 }
153
154 /* MD5 finalization. Ends an MD5 message-digest operation, writing the
155 the message digest and zeroizing the context.
156 */
157 void MD5Final (digest, context)
158 unsigned char digest[16]; /* message digest */
159 MD5_CTX *context; /* context */
160 {
161 unsigned char bits[8];
162 unsigned int indx, padLen;
163
164 /* Save number of bits */
165 Encode (bits, context->count, 8);
166
167 /* Pad out to 56 mod 64.
168 */
169 indx = (unsigned int)((context->count[0] >> 3) & 0x3f);
170 padLen = (indx < 56) ? (56 - indx) : (120 - indx);
171 MD5Update (context, PADDING, padLen);
172
173 /* Append length (before padding) */
174 MD5Update (context, bits, 8);
175
176 /* Store state in digest */
177 Encode (digest, context->state, 16);
178
179 /* Zeroize sensitive information.
180 */
181 MD5_memset ((POINTER)context, 0, sizeof (*context));
182 }
183
184 /* MD5 basic transformation. Transforms state based on block.
185 */
186 static void MD5Transform (state, block)
187 UINT4 state[4];
188 unsigned char block[64];
189 {
190 UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
191
192 Decode (x, block, 64);
193
194 /* Round 1 */
195 FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
196 FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
197 FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
198 FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
199 FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
200 FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
201 FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
202 FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
203 FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
204 FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
205 FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
206 FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
207 FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
208 FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
209 FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
210 FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
211
212 /* Round 2 */
213 GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
214 GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
215 GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
216 GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
217 GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
218 GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
219 GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
220 GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
221 GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
222 GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
223 GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
224 GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
225 GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
226 GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
227 GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
228 GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
229
230 /* Round 3 */
231 HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
232 HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
233 HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
234 HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
235 HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
236 HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
237 HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
238 HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
239 HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
240 HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
241 HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
242 HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
243 HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
244 HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
245 HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
246 HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
247
248 /* Round 4 */
249 II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
250 II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
251 II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
252 II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
253 II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
254 II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
255 II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
256 II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
257 II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
258 II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
259 II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
260 II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
261 II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
262 II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
263 II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
264 II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
265
266 state[0] += a;
267 state[1] += b;
268 state[2] += c;
269 state[3] += d;
270
271 /* Zeroize sensitive information.
272 */
273 MD5_memset ((POINTER)x, 0, sizeof (x));
274 }
275
276 /* Encodes input (UINT4) into output (unsigned char). Assumes len is
277 a multiple of 4.
278 */
279 static void Encode (output, input, len)
280 unsigned char *output;
281 UINT4 *input;
282 unsigned int len;
283 {
284 unsigned int i, j;
285
286 for (i = 0, j = 0; j < len; i++, j += 4) {
287 output[j] = (unsigned char)(input[i] & 0xff);
288 output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
289 output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
290 output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
291 }
292 }
293
294 /* Decodes input (unsigned char) into output (UINT4). Assumes len is
295 a multiple of 4.
296 */
297 static void Decode (output, input, len)
298 UINT4 *output;
299 unsigned char *input;
300 unsigned int len;
301 {
302 unsigned int i, j;
303
304 for (i = 0, j = 0; j < len; i++, j += 4)
305 output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
306 (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
307 }
308
309 /* Note: Replace "for loop" with standard memcpy if possible.
310 */
311
312 static void MD5_memcpy (output, input, len)
313 POINTER output;
314 POINTER input;
315 unsigned int len;
316 {
317 unsigned int i;
318
319 for (i = 0; i < len; i++)
320 output[i] = input[i];
321 }
322
323 /* Note: Replace "for loop" with standard memset if possible.
324 */
325 static void MD5_memset (output, value, len)
326 POINTER output;
327 int value;
328 unsigned int len;
329 {
330 unsigned int i;
331
332 for (i = 0; i < len; i++)
333 ((char *)output)[i] = (char)value;
334 }
1 /* MD5.H - header file for MD5C.C
2 */
3
4 /* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
5 rights reserved.
6
7 License to copy and use this software is granted provided that it
8 is identified as the "RSA Data Security, Inc. MD5 Message-Digest
9 Algorithm" in all material mentioning or referencing this software
10 or this function.
11
12 License is also granted to make and use derivative works provided
13 that such works are identified as "derived from the RSA Data
14 Security, Inc. MD5 Message-Digest Algorithm" in all material
15 mentioning or referencing the derived work.
16
17 RSA Data Security, Inc. makes no representations concerning either
18 the merchantability of this software or the suitability of this
19 software for any particular purpose. It is provided "as is"
20 without express or implied warranty of any kind.
21 These notices must be retained in any copies of any part of this
22 documentation and/or software.
23 */
24
25 /* GLOBAL.H - RSAREF types and constants
26 */
27
28 /* PROTOTYPES should be set to one if and only if the compiler supports
29 function argument prototyping.
30 The following makes PROTOTYPES default to 0 if it has not already
31 been defined with C compiler flags.
32 */
33 #ifndef PROTOTYPES
34 #define PROTOTYPES 0
35 #endif
36
37 /* POINTER defines a generic pointer type */
38 typedef unsigned char *POINTER;
39
40 /* UINT2 defines a two byte word */
41 typedef unsigned short int UINT2;
42
43 /* UINT4 defines a four byte word */
44 typedef unsigned long int UINT4;
45
46 /* PROTO_LIST is defined depending on how PROTOTYPES is defined above.
47 If using PROTOTYPES, then PROTO_LIST returns the list, otherwise it
48 returns an empty list.
49 */
50 #if __STDC__
51 #define PROTO_LIST(list) list
52 #else
53 #define PROTO_LIST(list) ()
54 #endif
55
56 /* MD5 context. */
57 typedef struct {
58 UINT4 state[4]; /* state (ABCD) */
59 UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */
60 unsigned char buffer[64]; /* input buffer */
61 } MD5_CTX;
62
63 void MD5Init PROTO_LIST ((MD5_CTX *));
64 void MD5Update PROTO_LIST ((MD5_CTX *, unsigned char *, unsigned int));
65 void MD5Final PROTO_LIST ((unsigned char [16], MD5_CTX *));
66
1 /*
2 * This code implements the MD5 message-digest algorithm.
3 * The algorithm is due to Ron Rivest. This code was
4 * written by Colin Plumb in 1993, no copyright is claimed.
5 * This code is in the public domain; do with it what you wish.
6 *
7 * Equivalent code is available from RSA Data Security, Inc.
8 * This code has been tested against that, and is equivalent,
9 * except that you don't need to include two pages of legalese
10 * with every copy.
11 *
12 * To compute the message digest of a chunk of bytes, declare an
13 * MD5Context structure, pass it to MD5Init, call MD5Update as
14 * needed on buffers full of bytes, and then call MD5Final, which
15 * will fill a supplied 16-byte array with the digest.
16 */
17 /*
18 * Modified (2001-01-31) to work on Sparcs <gray@Mirddin.farlep.net>
19 */
20 #if defined(HAVE_CONFIG_H)
21 # include <config.h>
22 #endif
23
24 #define MD5_CRYPT
25
26 #ifdef MD5_CRYPT
27 #include <string.h> /* for memcpy() */
28 #include <md5.h>
29
30 void
31 md5_calc(unsigned char *output, unsigned char *input, unsigned int inlen)
32 {
33 MD5_CTX context;
34
35 MD5Init(&context);
36 MD5Update(&context, input, inlen);
37 MD5Final(output, &context);
38 }
39
40
41 static void
42 bytes_encode(unsigned char *output, uint32 *input, unsigned int len)
43 {
44 unsigned int i, j;
45
46 for (i = 0, j = 0; j < len; i++, j += 4) {
47 output[j] = (unsigned char)(input[i] & 0xff);
48 output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
49 output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
50 output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
51 }
52 }
53
54 static void
55 bytes_decode(uint32 *output, unsigned char *input, unsigned int len)
56 {
57 unsigned int i, j;
58
59 for (i = 0, j = 0; j < len; i++, j += 4)
60 output[i] = ((uint32)input[j]) |
61 (((uint32)input[j+1]) << 8) |
62 (((uint32)input[j+2]) << 16) |
63 (((uint32)input[j+3]) << 24);
64 }
65
66 /*
67 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
68 * initialization constants.
69 */
70 void
71 MD5Init(struct MD5Context *ctx)
72 {
73 ctx->buf[0] = 0x67452301;
74 ctx->buf[1] = 0xefcdab89;
75 ctx->buf[2] = 0x98badcfe;
76 ctx->buf[3] = 0x10325476;
77
78 ctx->bits[0] = 0;
79 ctx->bits[1] = 0;
80 }
81
82 /*
83 * Update context to reflect the concatenation of another buffer full
84 * of bytes.
85 */
86 void
87 MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
88 {
89 uint32 t;
90
91 /* Update bitcount */
92
93 t = ctx->bits[0];
94 if ((ctx->bits[0] = t + ((uint32) len << 3)) < t)
95 ctx->bits[1]++; /* Carry from low to high */
96 ctx->bits[1] += len >> 29;
97
98 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
99 /* Handle any leading odd-sized chunks */
100
101 if (t) {
102 unsigned char *p = (unsigned char *) ctx->in + t;
103 t = 64 - t;
104 if (len < t) {
105 memcpy(p, buf, len);
106 return;
107 }
108 memcpy(p, buf, t);
109 MD5Transform(ctx->buf, (uint32 *) ctx->in);
110 buf += t;
111 len -= t;
112 }
113 /* Process data in 64-byte chunks */
114
115 while (len >= 64) {
116 memcpy(ctx->in, buf, 64);
117 MD5Transform(ctx->buf, (uint32 const *) buf);
118 buf += 64;
119 len -= 64;
120 }
121
122 /* Handle any remaining bytes of data. */
123
124 memcpy(ctx->in, buf, len);
125 }
126
127 /*
128 * Final wrapup - pad to 64-byte boundary with the bit pattern
129 * 1 0* (64-bit count of bits processed, MSB-first)
130 */
131 void
132 MD5Final(unsigned char digest[16], struct MD5Context *ctx)
133 {
134 unsigned count;
135 unsigned char *p;
136
137 /* Compute number of bytes mod 64 */
138 count = (ctx->bits[0] >> 3) & 0x3F;
139
140 /* Set the first char of padding to 0x80. This is safe since there is
141 always at least one byte free */
142 p = ctx->in + count;
143 *p++ = 0x80;
144
145 /* Bytes of padding needed to make 64 bytes */
146 count = 64 - 1 - count;
147
148 /* Pad out to 56 mod 64 */
149 if (count < 8) {
150 /* Two lots of padding: Pad the first block to 64 bytes */
151 memset(p, 0, count);
152 MD5Transform(ctx->buf, (uint32 *) ctx->in);
153
154 /* Now fill the next block with 56 bytes */
155 memset(ctx->in, 0, 56);
156 } else {
157 /* Pad block to 56 bytes */
158 memset(p, 0, count - 8);
159 }
160
161 /* Append length in bits and transform */
162 bytes_encode((unsigned char*)((uint32 *) ctx->in + 14), ctx->bits, 8);
163 MD5Transform(ctx->buf, (uint32 *) ctx->in);
164 bytes_encode(digest,ctx->buf,16);
165 memset((char *) ctx, 0, sizeof(ctx)); /* In case it's sensitive */
166 }
167
168 #ifndef ASM_MD5
169
170 /* The four core functions - F1 is optimized somewhat */
171
172 #define F1(x, y, z) (x & y | ~x & z)
173 /*#define F1(x, y, z) (z ^ (x & (y ^ z))) */
174 #define F2(x, y, z) F1(z, x, y)
175 #define F3(x, y, z) (x ^ y ^ z)
176 #define F4(x, y, z) (y ^ (x | ~z))
177
178 /* This is the central step in the MD5 algorithm. */
179 #define MD5STEP(f, w, x, y, z, data, s) \
180 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x );
181
182 #if 0
183 dump(char *label,unsigned char *p, int len)
184 {
185 int i;
186 return;
187 printf("dump: %s\n", label);
188 for (i=0; i<len; i++)
189 printf("%x\n", p[i]);
190 printf("--\n");
191
192 }
193 #endif
194
195 /*
196 * The core of the MD5 algorithm, this alters an existing MD5 hash to
197 * reflect the addition of 16 longwords of new data. MD5Update blocks
198 * the data and converts bytes into longwords for this routine.
199 */
200 void
201 MD5Transform(uint32 buf[4], uint32 const cin[16])
202 {
203 register uint32 a, b, c, d;
204 uint32 in[16];
205
206 bytes_decode(in, (unsigned char *) cin, 64);
207
208 a = buf[0];
209 b = buf[1];
210 c = buf[2];
211 d = buf[3];
212
213 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
214 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
215 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
216 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
217 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
218 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
219 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
220 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
221 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
222 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
223 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
224 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
225 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
226 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
227 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
228 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
229
230 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
231 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
232 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
233 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
234 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
235 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
236 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
237 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
238 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
239 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
240 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
241 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
242 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
243 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
244 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
245 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
246
247 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
248 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
249 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
250 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
251 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
252 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
253 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
254 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
255 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
256 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
257 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
258 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
259 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
260 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
261 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
262 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
263
264 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
265 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
266 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
267 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
268 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
269 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
270 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
271 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
272 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
273 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
274 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
275 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
276 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
277 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
278 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
279 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
280
281 buf[0] += a;
282 buf[1] += b;
283 buf[2] += c;
284 buf[3] += d;
285 }
286
287 #endif
288 #endif /* MD5_CRYPT */
1 #ifndef MD5_H
2 #define MD5_H
3
4 #ifdef __alpha
5 typedef unsigned int uint32;
6 #else
7 typedef unsigned long uint32;
8 #endif
9
10 struct MD5Context {
11 uint32 buf[4];
12 uint32 bits[2];
13 unsigned char in[64];
14 };
15
16 void MD5Init(struct MD5Context *context);
17 void MD5Update(struct MD5Context *context, unsigned char const *buf,
18 unsigned len);
19 void MD5Final(unsigned char digest[16], struct MD5Context *context);
20 void MD5Transform(uint32 buf[4], uint32 const in[16]);
21
22 typedef struct MD5Context MD5_CTX;
23
24 #endif /* !MD5_H */