/[resiprocate]/main/resip/stack/test/md5.cxx
ViewVC logotype

Contents of /main/resip/stack/test/md5.cxx

Parent Directory Parent Directory | Revision Log Revision Log


Revision 5948 - (show annotations) (download)
Fri Feb 17 15:30:16 2006 UTC (13 years, 9 months ago) by dworley
File MIME type: text/plain
File size: 12790 byte(s)
Setting more svn: properties, and adding EOLs to the ends of files
that need it.

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.hxx"
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, index, partLen;
121
122 /* Compute number of bytes mod 64 */
123 index = (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 - index;
132
133 /* Transform as many times as possible.
134 */
135 if (inputLen >= partLen) {
136 MD5_memcpy
137 ((POINTER)&context->buffer[index], (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 index = 0;
144 }
145 else
146 i = 0;
147
148 /* Buffer remaining input */
149 MD5_memcpy
150 ((POINTER)&context->buffer[index], (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 index, padLen;
163
164 /* Save number of bits */
165 Encode (bits, context->count, 8);
166
167 /* Pad out to 56 mod 64.
168 */
169 index = (unsigned int)((context->count[0] >> 3) & 0x3f);
170 padLen = (index < 56) ? (56 - index) : (120 - index);
171 MD5Update (context, PADDING, padLen);
172
173 /* Append length (before padding) */
174 MD5Update (context, bits, 8);
175 /* Store state in digest */
176 Encode (digest, context->state, 16);
177
178 /* Zeroize sensitive information.
179 */
180 MD5_memset ((POINTER)context, 0, sizeof (*context));
181 }
182
183 /* MD5 basic transformation. Transforms state based on block.
184 */
185 static void MD5Transform (state, block)
186 UINT4 state[4];
187 unsigned char block[64];
188 {
189 UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
190
191 Decode (x, block, 64);
192
193 /* Round 1 */
194 FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
195 FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
196 FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
197 FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
198 FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
199 FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
200 FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
201 FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
202 FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
203 FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
204 FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
205 FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
206 FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
207 FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
208 FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
209 FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
210
211 /* Round 2 */
212 GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
213 GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
214 GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
215 GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
216 GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
217 GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
218 GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
219 GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
220 GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
221 GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
222 GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
223 GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
224 GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
225 GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
226 GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
227 GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
228
229 /* Round 3 */
230 HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
231 HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
232 HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
233 HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
234 HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
235 HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
236 HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
237 HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
238 HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
239 HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
240 HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
241 HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
242 HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
243 HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
244 HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
245 HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
246
247 /* Round 4 */
248 II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
249 II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
250 II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
251 II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
252 II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
253 II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
254 II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
255 II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
256 II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
257 II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
258 II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
259 II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
260 II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
261 II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
262 II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
263 II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
264
265 state[0] += a;
266 state[1] += b;
267 state[2] += c;
268 state[3] += d;
269
270 /* Zeroize sensitive information.
271
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 }
335
336
337 /* ====================================================================
338 * The Vovida Software License, Version 1.0
339 *
340 * Copyright (c) 2000 Vovida Networks, Inc. All rights reserved.
341 *
342 * Redistribution and use in source and binary forms, with or without
343 * modification, are permitted provided that the following conditions
344 * are met:
345 *
346 * 1. Redistributions of source code must retain the above copyright
347 * notice, this list of conditions and the following disclaimer.
348 *
349 * 2. Redistributions in binary form must reproduce the above copyright
350 * notice, this list of conditions and the following disclaimer in
351 * the documentation and/or other materials provided with the
352 * distribution.
353 *
354 * 3. The names "VOCAL", "Vovida Open Communication Application Library",
355 * and "Vovida Open Communication Application Library (VOCAL)" must
356 * not be used to endorse or promote products derived from this
357 * software without prior written permission. For written
358 * permission, please contact vocal@vovida.org.
359 *
360 * 4. Products derived from this software may not be called "VOCAL", nor
361 * may "VOCAL" appear in their name, without prior written
362 * permission of Vovida Networks, Inc.
363 *
364 * THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESSED OR IMPLIED
365 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
366 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE AND
367 * NON-INFRINGEMENT ARE DISCLAIMED. IN NO EVENT SHALL VOVIDA
368 * NETWORKS, INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT DAMAGES
369 * IN EXCESS OF $1,000, NOR FOR ANY INDIRECT, INCIDENTAL, SPECIAL,
370 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
371 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
372 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
373 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
374 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
375 * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
376 * DAMAGE.
377 *
378 * ====================================================================
379 *
380 * This software consists of voluntary contributions made by Vovida
381 * Networks, Inc. and many individuals on behalf of Vovida Networks,
382 * Inc. For more information on Vovida Networks, Inc., please see
383 * <http://www.vovida.org/>.
384 *
385 */

Properties

Name Value
svn:eol-style native
svn:mime-type text/plain

webmaster AT resiprocate DOT org
ViewVC Help
Powered by ViewVC 1.1.27