Chameleon

Chameleon Svn Source Tree

Root/branches/Chimera/i386/libsaio/md5c.c

1/*␊
2 * MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm␊
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 * $Id: md5c.c,v 1.1 2005/06/24 22:47:12 curtisg Exp $␊
26 *␊
27 * This code is the same as the code published by RSA Inc. It has been␊
28 * edited for clarity and style only.␊
29 */␊
30␊
31#include "libsaio.h"␊
32#include <libkern/crypto/md5.h>␊
33␊
34␊
35#define Encode memcpy␊
36#define Decode memcpy␊
37␊
38static unsigned char PADDING[64] = {␊
39 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,␊
40 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,␊
41 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0␊
42};␊
43␊
44/* F, G, H and I are basic MD5 functions. */␊
45#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))␊
46#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))␊
47#define H(x, y, z) ((x) ^ (y) ^ (z))␊
48#define I(x, y, z) ((y) ^ ((x) | (~z)))␊
49␊
50/* ROTATE_LEFT rotates x left n bits. */␊
51#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))␊
52␊
53/*␊
54 * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.␊
55 * Rotation is separate from addition to prevent recomputation.␊
56 */␊
57#define FF(a, b, c, d, x, s, ac) { \␊
58␉(a) += F ((b), (c), (d)) + (x) + (u_int32_t)(ac); \␊
59␉(a) = ROTATE_LEFT ((a), (s)); \␊
60␉(a) += (b); \␊
61␉}␊
62#define GG(a, b, c, d, x, s, ac) { \␊
63␉(a) += G ((b), (c), (d)) + (x) + (u_int32_t)(ac); \␊
64␉(a) = ROTATE_LEFT ((a), (s)); \␊
65␉(a) += (b); \␊
66␉}␊
67#define HH(a, b, c, d, x, s, ac) { \␊
68␉(a) += H ((b), (c), (d)) + (x) + (u_int32_t)(ac); \␊
69␉(a) = ROTATE_LEFT ((a), (s)); \␊
70␉(a) += (b); \␊
71␉}␊
72#define II(a, b, c, d, x, s, ac) { \␊
73␉(a) += I ((b), (c), (d)) + (x) + (u_int32_t)(ac); \␊
74␉(a) = ROTATE_LEFT ((a), (s)); \␊
75␉(a) += (b); \␊
76␉}␊
77␊
78static void MD5Transform (u_int32_t state[4], const unsigned char block[64]);␊
79␊
80/* MD5 initialization. Begins an MD5 operation, writing a new context. */␊
81␊
82void␊
83MD5Init (context)␊
84␉MD5_CTX *context;␊
85{␊
86␊
87␉context->count[0] = context->count[1] = 0;␊
88␊
89␉/* Load magic initialization constants. */␊
90␉context->state[0] = 0x67452301;␊
91␉context->state[1] = 0xefcdab89;␊
92␉context->state[2] = 0x98badcfe;␊
93␉context->state[3] = 0x10325476;␊
94}␊
95␊
96/* ␊
97 * MD5 block update operation. Continues an MD5 message-digest␊
98 * operation, processing another message block, and updating the␊
99 * context.␊
100 */␊
101␊
102void␊
103MD5Update (context, input, inputLen)␊
104␉MD5_CTX *context;␊
105#if MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_5␊
106␉const void *input;␊
107#else␊
108␉const unsigned char *input;␊
109#endif␊
110␉unsigned int inputLen;␊
111{␊
112␉unsigned int i, index, partLen;␊
113␊
114␉/* Compute number of bytes mod 64 */␊
115␉index = (unsigned int)((context->count[0] >> 3) & 0x3F);␊
116␊
117␉/* Update number of bits */␊
118␉if ((context->count[0] += ((u_int32_t)inputLen << 3))␊
119␉ < ((u_int32_t)inputLen << 3))␊
120␉␉context->count[1]++;␊
121␉context->count[1] += ((u_int32_t)inputLen >> 29);␊
122␊
123␉partLen = 64 - index;␊
124␊
125␉/* Transform as many times as possible. */␊
126␉if (inputLen >= partLen) {␊
127␉␉memcpy((void *)&context->buffer[index], (const void *)input,␊
128␉␉ partLen);␊
129␉␉MD5Transform (context->state, context->buffer);␊
130␊
131␉␉for (i = partLen; i + 63 < inputLen; i += 64)␊
132␉␉␉MD5Transform (context->state, &((const unsigned char *)input)[i]);␊
133␊
134␉␉index = 0;␊
135␉}␊
136␉else␊
137␉␉i = 0;␊
138␊
139␉/* Buffer remaining input */␊
140␉memcpy ((void *)&context->buffer[index], (const void *)&((const unsigned char*)input)[i],␊
141␉ inputLen-i);␊
142}␊
143␊
144/*␊
145 * MD5 padding. Adds padding followed by original length.␊
146 */␊
147␊
148void␊
149MD5Pad (context)␊
150␉MD5_CTX *context;␊
151{␊
152␉unsigned char bits[8];␊
153␉unsigned int index, padLen;␊
154␊
155␉/* Save number of bits */␊
156␉Encode (bits, context->count, 8);␊
157␊
158␉/* Pad out to 56 mod 64. */␊
159␉index = (unsigned int)((context->count[0] >> 3) & 0x3f);␊
160␉padLen = (index < 56) ? (56 - index) : (120 - index);␊
161␉MD5Update (context, PADDING, padLen);␊
162␊
163␉/* Append length (before padding) */␊
164␉MD5Update (context, bits, 8);␊
165}␊
166␊
167/*␊
168 * MD5 finalization. Ends an MD5 message-digest operation, writing the␊
169 * the message digest and zeroizing the context.␊
170 */␊
171␊
172void␊
173MD5Final (digest, context)␊
174␉unsigned char digest[16];␊
175␉MD5_CTX *context;␊
176{␊
177␉/* Do padding. */␊
178␉MD5Pad (context);␊
179␊
180␉/* Store state in digest */␊
181␉Encode (digest, context->state, 16);␊
182␊
183␉/* Zeroize sensitive information. */␊
184␉memset ((void *)context, 0, sizeof (*context));␊
185}␊
186␊
187/* MD5 basic transformation. Transforms state based on block. */␊
188␊
189static void␊
190MD5Transform (state, block)␊
191␉u_int32_t state[4];␊
192␉const unsigned char block[64];␊
193{␊
194␉u_int32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16];␊
195␊
196␉Decode (x, block, 64);␊
197␊
198␉/* Round 1 */␊
199#define S11 7␊
200#define S12 12␊
201#define S13 17␊
202#define S14 22␊
203␉FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */␊
204␉FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */␊
205␉FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */␊
206␉FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */␊
207␉FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */␊
208␉FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */␊
209␉FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */␊
210␉FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */␊
211␉FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */␊
212␉FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */␊
213␉FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */␊
214␉FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */␊
215␉FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */␊
216␉FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */␊
217␉FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */␊
218␉FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */␊
219␊
220␉/* Round 2 */␊
221#define S21 5␊
222#define S22 9␊
223#define S23 14␊
224#define S24 20␊
225␉GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */␊
226␉GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */␊
227␉GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */␊
228␉GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */␊
229␉GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */␊
230␉GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */␊
231␉GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */␊
232␉GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */␊
233␉GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */␊
234␉GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */␊
235␉GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */␊
236␉GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */␊
237␉GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */␊
238␉GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */␊
239␉GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */␊
240␉GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */␊
241␊
242␉/* Round 3 */␊
243#define S31 4␊
244#define S32 11␊
245#define S33 16␊
246#define S34 23␊
247␉HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */␊
248␉HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */␊
249␉HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */␊
250␉HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */␊
251␉HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */␊
252␉HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */␊
253␉HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */␊
254␉HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */␊
255␉HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */␊
256␉HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */␊
257␉HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */␊
258␉HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */␊
259␉HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */␊
260␉HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */␊
261␉HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */␊
262␉HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */␊
263␊
264␉/* Round 4 */␊
265#define S41 6␊
266#define S42 10␊
267#define S43 15␊
268#define S44 21␊
269␉II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */␊
270␉II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */␊
271␉II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */␊
272␉II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */␊
273␉II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */␊
274␉II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */␊
275␉II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */␊
276␉II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */␊
277␉II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */␊
278␉II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */␊
279␉II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */␊
280␉II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */␊
281␉II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */␊
282␉II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */␊
283␉II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */␊
284␉II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */␊
285␊
286␉state[0] += a;␊
287␉state[1] += b;␊
288␉state[2] += c;␊
289␉state[3] += d;␊
290␊
291␉/* Zeroize sensitive information. */␊
292␉memset ((void *)x, 0, sizeof (x));␊
293}␊
294

Archive Download this file

Revision: 1909