Chameleon

Chameleon Svn Source Tree

Root/branches/ErmaC/Trunk/i386/libsaio/md5c.c

1/*␊
2 * Copyright (c) 2000-2006 Apple Computer, Inc. All rights reserved.␊
3 *␊
4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@␊
5 * ␊
6 * This file contains Original Code and/or Modifications of Original Code␊
7 * as defined in and that are subject to the Apple Public Source License␊
8 * Version 2.0 (the 'License'). You may not use this file except in␊
9 * compliance with the License. The rights granted to you under the License␊
10 * may not be used to create, or enable the creation or redistribution of,␊
11 * unlawful or unlicensed copies of an Apple operating system, or to␊
12 * circumvent, violate, or enable the circumvention or violation of, any␊
13 * terms of an Apple operating system software license agreement.␊
14 * ␊
15 * Please obtain a copy of the License at␊
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.␊
17 * ␊
18 * The Original Code and all software distributed under the License are␊
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER␊
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,␊
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,␊
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.␊
23 * Please see the License for the specific language governing rights and␊
24 * limitations under the License.␊
25 * ␊
26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@␊
27 */␊
28␊
29/*␊
30 * MD5.C - RSA Data Security, Inc., MD5 message-digest algorithm␊
31 *␊
32 * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All␊
33 * rights reserved.␊
34 *␊
35 * License to copy and use this software is granted provided that it␊
36 * is identified as the "RSA Data Security, Inc. MD5 Message-Digest␊
37 * Algorithm" in all material mentioning or referencing this software␊
38 * or this function.␊
39 *␊
40 * License is also granted to make and use derivative works provided␊
41 * that such works are identified as "derived from the RSA Data␊
42 * Security, Inc. MD5 Message-Digest Algorithm" in all material␊
43 * mentioning or referencing the derived work.␊
44 *␊
45 * RSA Data Security, Inc. makes no representations concerning either␊
46 * the merchantability of this software or the suitability of this␊
47 * software for any particular purpose. It is provided "as is"␊
48 * without express or implied warranty of any kind.␊
49 *␊
50 * These notices must be retained in any copies of any part of this␊
51 * documentation and/or software.␊
52 *␊
53 * $Id: md5c.c,v 1.1 2005/06/24 22:47:12 curtisg Exp $␊
54 *␊
55 * This code is the same as the code published by RSA Inc. It has been␊
56 * edited for clarity and style only.␊
57 */␊
58␊
59#include "libsaio.h"␊
60#include <libkern/crypto/md5.h>␊
61␊
62␊
63#define Encode memcpy␊
64#define Decode memcpy␊
65␊
66//------------------------------------------------------------------------------␊
67␊
68static unsigned char PADDING[64] = {␊
69 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,␊
70 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,␊
71 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0␊
72};␊
73␊
74␊
75//------------------------------------------------------------------------------␊
76// F, G, H and I are basic MD5 functions.␊
77␊
78#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))␊
79#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))␊
80#define H(x, y, z) ((x) ^ (y) ^ (z))␊
81#define I(x, y, z) ((y) ^ ((x) | (~z)))␊
82␊
83//------------------------------------------------------------------------------␊
84// ROTATE_LEFT rotates x left n bits.␊
85␊
86#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))␊
87␊
88//------------------------------------------------------------------------------␊
89// FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.␊
90// Rotation is separate from addition to prevent recomputation.␊
91␊
92#define FF(a, b, c, d, x, s, ac) { \␊
93␉(a) += F ((b), (c), (d)) + (x) + (u_int32_t)(ac); \␊
94␉(a) = ROTATE_LEFT ((a), (s)); \␊
95␉(a) += (b); \␊
96␉}␊
97␊
98#define GG(a, b, c, d, x, s, ac) { \␊
99␉(a) += G ((b), (c), (d)) + (x) + (u_int32_t)(ac); \␊
100␉(a) = ROTATE_LEFT ((a), (s)); \␊
101␉(a) += (b); \␊
102␉}␊
103␊
104#define HH(a, b, c, d, x, s, ac) { \␊
105␉(a) += H ((b), (c), (d)) + (x) + (u_int32_t)(ac); \␊
106␉(a) = ROTATE_LEFT ((a), (s)); \␊
107␉(a) += (b); \␊
108␉}␊
109␊
110#define II(a, b, c, d, x, s, ac) { \␊
111␉(a) += I ((b), (c), (d)) + (x) + (u_int32_t)(ac); \␊
112␉(a) = ROTATE_LEFT ((a), (s)); \␊
113␉(a) += (b); \␊
114␉}␊
115␊
116static void MD5Transform (u_int32_t state[4], const unsigned char block[64]);␊
117␊
118/* MD5 initialization. Begins an MD5 operation, writing a new context. */␊
119␊
120void MD5Init (context)␊
121␉MD5_CTX *context;␊
122{␊
123␉context->count[0] = context->count[1] = 0;␊
124␊
125␉// Load magic initialization constants.␊
126␉context->state[0] = 0x67452301;␊
127␉context->state[1] = 0xefcdab89;␊
128␉context->state[2] = 0x98badcfe;␊
129␉context->state[3] = 0x10325476;␊
130}␊
131␊
132/* ␊
133 * MD5 block update operation. Continues an MD5 message-digest␊
134 * operation, processing another message block, and updating the␊
135 * context.␊
136 */␊
137␊
138void␊
139MD5Update (context, input, inputLen)␊
140␉MD5_CTX *context;␊
141#if MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_5␊
142␉const void *input;␊
143#else␊
144␉const unsigned char *input;␊
145#endif␊
146␉unsigned int inputLen;␊
147{␊
148␉unsigned int i, index, partLen;␊
149␊
150␉/* Compute number of bytes mod 64 */␊
151␉index = (unsigned int)((context->count[0] >> 3) & 0x3F);␊
152␊
153␉/* Update number of bits */␊
154␉if ((context->count[0] += ((u_int32_t)inputLen << 3)) < ((u_int32_t)inputLen << 3))␊
155␉{␊
156␉␉context->count[1]++;␊
157␉}␊
158␊
159␉context->count[1] += ((u_int32_t)inputLen >> 29);␊
160␊
161␉partLen = 64 - index;␊
162␊
163␉/* Transform as many times as possible. */␊
164␊
165␉if (inputLen >= partLen)␊
166␉{␊
167␉␉memcpy((void *)&context->buffer[index], (const void *)input,␊
168␉␉ partLen);␊
169␉␉MD5Transform (context->state, context->buffer);␊
170␊
171␉␉for (i = partLen; i + 63 < inputLen; i += 64)␊
172␉␉␉MD5Transform (context->state, &((const unsigned char *)input)[i]);␊
173␊
174␉␉index = 0;␊
175␉}␊
176␉else␊
177␉␉i = 0;␊
178␊
179␉/* Buffer remaining input */␊
180␉memcpy ((void *)&context->buffer[index], (const void *)&((const unsigned char*)input)[i],␊
181␉ inputLen-i);␊
182}␊
183␊
184/*␊
185 * MD5 padding. Adds padding followed by original length.␊
186 */␊
187␊
188void␊
189MD5Pad (context)␊
190␉MD5_CTX *context;␊
191{␊
192␉unsigned char bits[8];␊
193␉unsigned int index, padLen;␊
194␊
195␉/* Save number of bits */␊
196␉Encode (bits, context->count, 8);␊
197␊
198␉/* Pad out to 56 mod 64. */␊
199␉index = (unsigned int)((context->count[0] >> 3) & 0x3f);␊
200␉padLen = (index < 56) ? (56 - index) : (120 - index);␊
201␉MD5Update (context, PADDING, padLen);␊
202␊
203␉/* Append length (before padding) */␊
204␉MD5Update (context, bits, 8);␊
205}␊
206␊
207/*␊
208 * MD5 finalization. Ends an MD5 message-digest operation, writing the␊
209 * the message digest and zeroizing the context.␊
210 */␊
211␊
212void␊
213MD5Final (digest, context)␊
214␉unsigned char digest[16];␊
215␉MD5_CTX *context;␊
216{␊
217␉/* Do padding. */␊
218␉MD5Pad (context);␊
219␊
220␉/* Store state in digest */␊
221␉Encode (digest, context->state, 16);␊
222␊
223␉/* Zeroize sensitive information. */␊
224␉memset ((void *)context, 0, sizeof (*context));␊
225}␊
226␊
227/* MD5 basic transformation. Transforms state based on block. */␊
228␊
229static void␊
230MD5Transform (state, block)␊
231␉u_int32_t state[4];␊
232␉const unsigned char block[64];␊
233{␊
234␉u_int32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16];␊
235␊
236␉Decode (x, block, 64);␊
237␊
238␉/* Round 1 */␊
239#define S11 7␊
240#define S12 12␊
241#define S13 17␊
242#define S14 22␊
243␉FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */␊
244␉FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */␊
245␉FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */␊
246␉FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */␊
247␉FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */␊
248␉FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */␊
249␉FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */␊
250␉FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */␊
251␉FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */␊
252␉FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */␊
253␉FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */␊
254␉FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */␊
255␉FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */␊
256␉FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */␊
257␉FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */␊
258␉FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */␊
259␊
260␉/* Round 2 */␊
261#define S21 5␊
262#define S22 9␊
263#define S23 14␊
264#define S24 20␊
265␉GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */␊
266␉GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */␊
267␉GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */␊
268␉GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */␊
269␉GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */␊
270␉GG (d, a, b, c, x[10], S22, 0x02441453); /* 22 */␊
271␉GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */␊
272␉GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */␊
273␉GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */␊
274␉GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */␊
275␉GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */␊
276␉GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */␊
277␉GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */␊
278␉GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */␊
279␉GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */␊
280␉GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */␊
281␊
282␉/* Round 3 */␊
283#define S31 4␊
284#define S32 11␊
285#define S33 16␊
286#define S34 23␊
287␉HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */␊
288␉HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */␊
289␉HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */␊
290␉HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */␊
291␉HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */␊
292␉HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */␊
293␉HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */␊
294␉HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */␊
295␉HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */␊
296␉HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */␊
297␉HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */␊
298␉HH (b, c, d, a, x[ 6], S34, 0x04881d05); /* 44 */␊
299␉HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */␊
300␉HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */␊
301␉HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */␊
302␉HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */␊
303␊
304␉/* Round 4 */␊
305#define S41 6␊
306#define S42 10␊
307#define S43 15␊
308#define S44 21␊
309␉II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */␊
310␉II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */␊
311␉II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */␊
312␉II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */␊
313␉II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */␊
314␉II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */␊
315␉II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */␊
316␉II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */␊
317␉II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */␊
318␉II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */␊
319␉II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */␊
320␉II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */␊
321␉II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */␊
322␉II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */␊
323␉II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */␊
324␉II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */␊
325␊
326␉state[0] += a;␊
327␉state[1] += b;␊
328␉state[2] += c;␊
329␉state[3] += d;␊
330␊
331␉/* Zeroize sensitive information. */␊
332␉memset ((void *)x, 0, sizeof (x));␊
333}␊
334

Archive Download this file

Revision: 2037