source: Sophya/trunk/SophyaLib/BaseTools/gnumd5.c@ 742

Last change on this file since 742 was 742, checked in by ansari, 26 years ago

new md5
File size: 11.0 KB
Line 
1/* md5.c - MD5 Message-Digest Algorithm
2 * Copyright (C) 1995, 1996, 1998, 1999 Free Software Foundation, Inc.
3 *
4 * according to the definition of MD5 in RFC 1321 from April 1992.
5 * NOTE: This is *not* the same file as the one from glibc.
6 *
7 * This program is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License as published by the
9 * Free Software Foundation; either version 2, or (at your option) any
10 * later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software Foundation,
19 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
20 */
21/* Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995. */
22/* heavily modified for GnuPG by <werner.koch@guug.de> */
23/* Modified by Eric.Aubourg@cea.fr for SOPHYA */
24
25/* Test values:
26 * "" D4 1D 8C D9 8F 00 B2 04 E9 80 09 98 EC F8 42 7E
27 * "a" 0C C1 75 B9 C0 F1 B6 A8 31 C3 99 E2 69 77 26 61
28 * "abc 90 01 50 98 3C D2 4F B0 D6 96 3F 7D 28 E1 7F 72
29 * "message digest" F9 6B 69 7D 7C B7 93 8D 52 5A 2F 31 AA F1 61 D0
30 */
31
32#include <stdio.h>
33#include <stdlib.h>
34#include <string.h>
35#include <assert.h>
36
37#include "machdefs.h"
38#include "bithelp.h"
39#include "gnumd5.h"
40
41#define DIM(v) (sizeof(v)/sizeof((v)[0]))
42
43#if SWAP==0
44#define BIG_ENDIAN_HOST 1
45#endif
46
47
48//typedef struct {
49// uint_4 A,B,C,D; /* chaining variables */
50// uint_4 nblocks;
51// uint_1 buf[64];
52// int count;
53//} MD5_CONTEXT;
54
55
56void
57md5_init( MD5_CONTEXT *ctx )
58{
59 ctx->A = 0x67452301;
60 ctx->B = 0xefcdab89;
61 ctx->C = 0x98badcfe;
62 ctx->D = 0x10325476;
63
64 ctx->nblocks = 0;
65 ctx->count = 0;
66}
67
68
69
70
71/* These are the four functions used in the four steps of the MD5 algorithm
72 and defined in the RFC 1321. The first function is a little bit optimized
73 (as found in Colin Plumbs public domain implementation). */
74/* #define FF(b, c, d) ((b & c) | (~b & d)) */
75#define FF(b, c, d) (d ^ (b & (c ^ d)))
76#define FG(b, c, d) FF (d, b, c)
77#define FH(b, c, d) (b ^ c ^ d)
78#define FI(b, c, d) (c ^ (b | ~d))
79
80
81/****************
82 * transform n*64 bytes
83 */
84static void
85/*transform( MD5_CONTEXT *ctx, const void *buffer, size_t len )*/
86transform( MD5_CONTEXT *ctx, uint_1 *data )
87{
88 uint_4 correct_words[16];
89 uint_4 A = ctx->A;
90 uint_4 B = ctx->B;
91 uint_4 C = ctx->C;
92 uint_4 D = ctx->D;
93 uint_4 *cwp = correct_words;
94
95#ifdef BIG_ENDIAN_HOST
96 { int i;
97 uint_1 *p2, *p1;
98 for(i=0, p1=data, p2=(uint_1*)correct_words; i < 16; i++, p2 += 4 ) {
99 p2[3] = *p1++;
100 p2[2] = *p1++;
101 p2[1] = *p1++;
102 p2[0] = *p1++;
103 }
104 }
105#else
106 memcpy( correct_words, data, 64 );
107#endif
108
109
110#define OP(a, b, c, d, s, T) \
111 do \
112 { \
113 a += FF (b, c, d) + (*cwp++) + T; \
114 a = rol(a, s); \
115 a += b; \
116 } \
117 while (0)
118
119 /* Before we start, one word about the strange constants.
120 They are defined in RFC 1321 as
121
122 T[i] = (int) (4294967296.0 * fabs (sin (i))), i=1..64
123 */
124
125 /* Round 1. */
126 OP (A, B, C, D, 7, 0xd76aa478);
127 OP (D, A, B, C, 12, 0xe8c7b756);
128 OP (C, D, A, B, 17, 0x242070db);
129 OP (B, C, D, A, 22, 0xc1bdceee);
130 OP (A, B, C, D, 7, 0xf57c0faf);
131 OP (D, A, B, C, 12, 0x4787c62a);
132 OP (C, D, A, B, 17, 0xa8304613);
133 OP (B, C, D, A, 22, 0xfd469501);
134 OP (A, B, C, D, 7, 0x698098d8);
135 OP (D, A, B, C, 12, 0x8b44f7af);
136 OP (C, D, A, B, 17, 0xffff5bb1);
137 OP (B, C, D, A, 22, 0x895cd7be);
138 OP (A, B, C, D, 7, 0x6b901122);
139 OP (D, A, B, C, 12, 0xfd987193);
140 OP (C, D, A, B, 17, 0xa679438e);
141 OP (B, C, D, A, 22, 0x49b40821);
142
143#undef OP
144#define OP(f, a, b, c, d, k, s, T) \
145 do \
146 { \
147 a += f (b, c, d) + correct_words[k] + T; \
148 a = rol(a, s); \
149 a += b; \
150 } \
151 while (0)
152
153 /* Round 2. */
154 OP (FG, A, B, C, D, 1, 5, 0xf61e2562);
155 OP (FG, D, A, B, C, 6, 9, 0xc040b340);
156 OP (FG, C, D, A, B, 11, 14, 0x265e5a51);
157 OP (FG, B, C, D, A, 0, 20, 0xe9b6c7aa);
158 OP (FG, A, B, C, D, 5, 5, 0xd62f105d);
159 OP (FG, D, A, B, C, 10, 9, 0x02441453);
160 OP (FG, C, D, A, B, 15, 14, 0xd8a1e681);
161 OP (FG, B, C, D, A, 4, 20, 0xe7d3fbc8);
162 OP (FG, A, B, C, D, 9, 5, 0x21e1cde6);
163 OP (FG, D, A, B, C, 14, 9, 0xc33707d6);
164 OP (FG, C, D, A, B, 3, 14, 0xf4d50d87);
165 OP (FG, B, C, D, A, 8, 20, 0x455a14ed);
166 OP (FG, A, B, C, D, 13, 5, 0xa9e3e905);
167 OP (FG, D, A, B, C, 2, 9, 0xfcefa3f8);
168 OP (FG, C, D, A, B, 7, 14, 0x676f02d9);
169 OP (FG, B, C, D, A, 12, 20, 0x8d2a4c8a);
170
171 /* Round 3. */
172 OP (FH, A, B, C, D, 5, 4, 0xfffa3942);
173 OP (FH, D, A, B, C, 8, 11, 0x8771f681);
174 OP (FH, C, D, A, B, 11, 16, 0x6d9d6122);
175 OP (FH, B, C, D, A, 14, 23, 0xfde5380c);
176 OP (FH, A, B, C, D, 1, 4, 0xa4beea44);
177 OP (FH, D, A, B, C, 4, 11, 0x4bdecfa9);
178 OP (FH, C, D, A, B, 7, 16, 0xf6bb4b60);
179 OP (FH, B, C, D, A, 10, 23, 0xbebfbc70);
180 OP (FH, A, B, C, D, 13, 4, 0x289b7ec6);
181 OP (FH, D, A, B, C, 0, 11, 0xeaa127fa);
182 OP (FH, C, D, A, B, 3, 16, 0xd4ef3085);
183 OP (FH, B, C, D, A, 6, 23, 0x04881d05);
184 OP (FH, A, B, C, D, 9, 4, 0xd9d4d039);
185 OP (FH, D, A, B, C, 12, 11, 0xe6db99e5);
186 OP (FH, C, D, A, B, 15, 16, 0x1fa27cf8);
187 OP (FH, B, C, D, A, 2, 23, 0xc4ac5665);
188
189 /* Round 4. */
190 OP (FI, A, B, C, D, 0, 6, 0xf4292244);
191 OP (FI, D, A, B, C, 7, 10, 0x432aff97);
192 OP (FI, C, D, A, B, 14, 15, 0xab9423a7);
193 OP (FI, B, C, D, A, 5, 21, 0xfc93a039);
194 OP (FI, A, B, C, D, 12, 6, 0x655b59c3);
195 OP (FI, D, A, B, C, 3, 10, 0x8f0ccc92);
196 OP (FI, C, D, A, B, 10, 15, 0xffeff47d);
197 OP (FI, B, C, D, A, 1, 21, 0x85845dd1);
198 OP (FI, A, B, C, D, 8, 6, 0x6fa87e4f);
199 OP (FI, D, A, B, C, 15, 10, 0xfe2ce6e0);
200 OP (FI, C, D, A, B, 6, 15, 0xa3014314);
201 OP (FI, B, C, D, A, 13, 21, 0x4e0811a1);
202 OP (FI, A, B, C, D, 4, 6, 0xf7537e82);
203 OP (FI, D, A, B, C, 11, 10, 0xbd3af235);
204 OP (FI, C, D, A, B, 2, 15, 0x2ad7d2bb);
205 OP (FI, B, C, D, A, 9, 21, 0xeb86d391);
206
207 /* Put checksum in context given as argument. */
208 ctx->A += A;
209 ctx->B += B;
210 ctx->C += C;
211 ctx->D += D;
212}
213
214
215
216/* The routine updates the message-digest context to
217 * account for the presence of each of the characters inBuf[0..inLen-1]
218 * in the message whose digest is being computed.
219 */
220void
221md5_write( MD5_CONTEXT *hd, uint_1 *inbuf, size_t inlen)
222{
223 if( hd->count == 64 ) { /* flush the buffer */
224 transform( hd, hd->buf );
225 hd->count = 0;
226 hd->nblocks++;
227 }
228 if( !inbuf )
229 return;
230 if( hd->count ) {
231 for( ; inlen && hd->count < 64; inlen-- )
232 hd->buf[hd->count++] = *inbuf++;
233 md5_write( hd, NULL, 0 );
234 if( !inlen )
235 return;
236 }
237
238 while( inlen >= 64 ) {
239 transform( hd, inbuf );
240 hd->count = 0;
241 hd->nblocks++;
242 inlen -= 64;
243 inbuf += 64;
244 }
245 for( ; inlen && hd->count < 64; inlen-- )
246 hd->buf[hd->count++] = *inbuf++;
247
248}
249
250
251
252/* The routine final terminates the message-digest computation and
253 * ends with the desired message digest in mdContext->digest[0...15].
254 * The handle is prepared for a new MD5 cycle.
255 * Returns 16 bytes representing the digest.
256 */
257
258void
259md5_final( MD5_CONTEXT *hd )
260{
261 uint_4 t, msb, lsb;
262 uint_1 *p;
263
264 md5_write(hd, NULL, 0); /* flush */;
265
266 msb = 0;
267 t = hd->nblocks;
268 if( (lsb = t << 6) < t ) /* multiply by 64 to make a byte count */
269 msb++;
270 msb += t >> 26;
271 t = lsb;
272 if( (lsb = t + hd->count) < t ) /* add the count */
273 msb++;
274 t = lsb;
275 if( (lsb = t << 3) < t ) /* multiply by 8 to make a bit count */
276 msb++;
277 msb += t >> 29;
278
279 if( hd->count < 56 ) { /* enough room */
280 hd->buf[hd->count++] = 0x80; /* pad */
281 while( hd->count < 56 )
282 hd->buf[hd->count++] = 0; /* pad */
283 }
284 else { /* need one extra block */
285 hd->buf[hd->count++] = 0x80; /* pad character */
286 while( hd->count < 64 )
287 hd->buf[hd->count++] = 0;
288 md5_write(hd, NULL, 0); /* flush */;
289 memset(hd->buf, 0, 56 ); /* fill next block with zeroes */
290 }
291 /* append the 64 bit count */
292 hd->buf[56] = lsb ;
293 hd->buf[57] = lsb >> 8;
294 hd->buf[58] = lsb >> 16;
295 hd->buf[59] = lsb >> 24;
296 hd->buf[60] = msb ;
297 hd->buf[61] = msb >> 8;
298 hd->buf[62] = msb >> 16;
299 hd->buf[63] = msb >> 24;
300 transform( hd, hd->buf );
301
302 p = hd->buf;
303#ifdef BIG_ENDIAN_HOST
304#define X(a) do { *p++ = hd->##a ; *p++ = hd->##a >> 8; \
305 *p++ = hd->##a >> 16; *p++ = hd->##a >> 24; } while(0)
306#else /* little endian */
307 /*#define X(a) do { *(uint_4*)p = hd->##a ; p += 4; } while(0)*/
308 /* Unixware's cpp doesn't like the above construct so we do it his way:
309 * (reported by Allan Clark) */
310#define X(a) do { *(uint_4*)p = (*hd).a ; p += 4; } while(0)
311#endif
312 X(A);
313 X(B);
314 X(C);
315 X(D);
316#undef X
317
318}
319
320static uint_1 *
321md5_read( MD5_CONTEXT *hd )
322{
323 return hd->buf;
324}
325
326/****************
327 * Return some information about the algorithm. We need algo here to
328 * distinguish different flavors of the algorithm.
329 * Returns: A pointer to string describing the algorithm or NULL if
330 * the ALGO is invalid.
331 */
332static const char *
333md5_get_info( int algo, size_t *contextsize,
334 uint_1 **r_asnoid, int *r_asnlen, int *r_mdlen,
335 void (**r_init)( void *c ),
336 void (**r_write)( void *c, uint_1 *buf, size_t nbytes ),
337 void (**r_final)( void *c ),
338 uint_1 *(**r_read)( void *c )
339 )
340{
341 static uint_1 asn[18] = /* Object ID is 1.2.840.113549.2.5 */
342 { 0x30, 0x20, 0x30, 0x0c, 0x06, 0x08, 0x2a, 0x86,0x48,
343 0x86, 0xf7, 0x0d, 0x02, 0x05, 0x05, 0x00, 0x04, 0x10 };
344
345 if( algo != 1 )
346 return NULL;
347
348 *contextsize = sizeof(MD5_CONTEXT);
349 *r_asnoid = asn;
350 *r_asnlen = DIM(asn);
351 *r_mdlen = 16;
352 *r_init = (void (*)(void *))md5_init;
353 *r_write = (void (*)(void *, uint_1*, size_t))md5_write;
354 *r_final = (void (*)(void *))md5_final;
355 *r_read = (uint_1 *(*)(void *))md5_read;
356
357 return "MD5";
358}
359
360
361#ifndef IS_MODULE
362static
363#endif
364const char * const gnupgext_version = "MD5 ($Revision: 1.1 $)";
365
366static struct {
367 int class;
368 int version;
369 int value;
370 void (*func)(void);
371} func_table[] = {
372 { 10, 1, 0, (void(*)(void))md5_get_info },
373 { 11, 1, 1 },
374};
375
376
377#ifndef IS_MODULE
378static
379#endif
380void *
381gnupgext_enum_func( int what, int *sequence, int *class, int *vers )
382{
383 void *ret;
384 int i = *sequence;
385
386 do {
387 if( i >= DIM(func_table) || i < 0 )
388 return NULL;
389 *class = func_table[i].class;
390 *vers = func_table[i].version;
391 switch( *class ) {
392 case 11: case 21: case 31: ret = &func_table[i].value; break;
393 default: ret = func_table[i].func; break;
394 }
395 i++;
396 } while( what && what != *class );
397
398 *sequence = i;
399 return ret;
400}
401
402
403
404/*
405#ifndef IS_MODULE
406void
407md5_constructor(void)
408{
409 register_internal_cipher_extension( gnupgext_version, gnupgext_enum_func );
410}
411#endif
412*/
413
414
415/* end of file */
Note: See TracBrowser for help on using the repository browser.