Chameleon

Chameleon Svn Source Tree

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

Archive Download this file

Revision: 2537