1 /* md5.c - MD5 Message-Digest Algorithm
2 * Copyright (C) 1995, 1996, 1998, 1999 Free Software Foundation, Inc.
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.
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
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.
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.
21 /* Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995. */
22 /* heavily modified for GnuPG by <werner.koch@guug.de> */
23 /* Heavily modified for CryptNET KeyServer by V. Alex Brennen <vab@cryptnet.net> */
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
34 void md5_init( MD5_CONTEXT *ctx )
45 /* These are the four functions used in the four steps of the MD5 algorithm
46 and defined in the RFC 1321. The first function is a little bit optimized
47 (as found in Colin Plumbs public domain implementation). */
48 /* #define FF(b, c, d) ((b & c) | (~b & d)) */
49 #define FF(b, c, d) (d ^ (b & (c ^ d)))
50 #define FG(b, c, d) FF (d, b, c)
51 #define FH(b, c, d) (b ^ c ^ d)
52 #define FI(b, c, d) (c ^ (b | ~d))
53 #define DIM(v) (sizeof(v)/sizeof((v)[0]))
56 * transform n*64 bytes
58 static void transform( MD5_CONTEXT *ctx, unsigned char *data )
60 unsigned int correct_words[16];
61 unsigned int A = ctx->A;
62 unsigned int B = ctx->B;
63 unsigned int C = ctx->C;
64 unsigned int D = ctx->D;
65 unsigned int *cwp = correct_words;
67 memcpy( correct_words, data, 64 );
70 #define OP(a, b, c, d, s, T) \
73 a += FF (b, c, d) + (*cwp++) + T; \
79 /* Before we start, one word about the strange constants.
80 They are defined in RFC 1321 as
82 T[i] = (int) (4294967296.0 * fabs (sin (i))), i=1..64
86 OP (A, B, C, D, 7, 0xd76aa478);
87 OP (D, A, B, C, 12, 0xe8c7b756);
88 OP (C, D, A, B, 17, 0x242070db);
89 OP (B, C, D, A, 22, 0xc1bdceee);
90 OP (A, B, C, D, 7, 0xf57c0faf);
91 OP (D, A, B, C, 12, 0x4787c62a);
92 OP (C, D, A, B, 17, 0xa8304613);
93 OP (B, C, D, A, 22, 0xfd469501);
94 OP (A, B, C, D, 7, 0x698098d8);
95 OP (D, A, B, C, 12, 0x8b44f7af);
96 OP (C, D, A, B, 17, 0xffff5bb1);
97 OP (B, C, D, A, 22, 0x895cd7be);
98 OP (A, B, C, D, 7, 0x6b901122);
99 OP (D, A, B, C, 12, 0xfd987193);
100 OP (C, D, A, B, 17, 0xa679438e);
101 OP (B, C, D, A, 22, 0x49b40821);
104 #define OP(f, a, b, c, d, k, s, T) \
107 a += f (b, c, d) + correct_words[k] + T; \
114 OP (FG, A, B, C, D, 1, 5, 0xf61e2562);
115 OP (FG, D, A, B, C, 6, 9, 0xc040b340);
116 OP (FG, C, D, A, B, 11, 14, 0x265e5a51);
117 OP (FG, B, C, D, A, 0, 20, 0xe9b6c7aa);
118 OP (FG, A, B, C, D, 5, 5, 0xd62f105d);
119 OP (FG, D, A, B, C, 10, 9, 0x02441453);
120 OP (FG, C, D, A, B, 15, 14, 0xd8a1e681);
121 OP (FG, B, C, D, A, 4, 20, 0xe7d3fbc8);
122 OP (FG, A, B, C, D, 9, 5, 0x21e1cde6);
123 OP (FG, D, A, B, C, 14, 9, 0xc33707d6);
124 OP (FG, C, D, A, B, 3, 14, 0xf4d50d87);
125 OP (FG, B, C, D, A, 8, 20, 0x455a14ed);
126 OP (FG, A, B, C, D, 13, 5, 0xa9e3e905);
127 OP (FG, D, A, B, C, 2, 9, 0xfcefa3f8);
128 OP (FG, C, D, A, B, 7, 14, 0x676f02d9);
129 OP (FG, B, C, D, A, 12, 20, 0x8d2a4c8a);
132 OP (FH, A, B, C, D, 5, 4, 0xfffa3942);
133 OP (FH, D, A, B, C, 8, 11, 0x8771f681);
134 OP (FH, C, D, A, B, 11, 16, 0x6d9d6122);
135 OP (FH, B, C, D, A, 14, 23, 0xfde5380c);
136 OP (FH, A, B, C, D, 1, 4, 0xa4beea44);
137 OP (FH, D, A, B, C, 4, 11, 0x4bdecfa9);
138 OP (FH, C, D, A, B, 7, 16, 0xf6bb4b60);
139 OP (FH, B, C, D, A, 10, 23, 0xbebfbc70);
140 OP (FH, A, B, C, D, 13, 4, 0x289b7ec6);
141 OP (FH, D, A, B, C, 0, 11, 0xeaa127fa);
142 OP (FH, C, D, A, B, 3, 16, 0xd4ef3085);
143 OP (FH, B, C, D, A, 6, 23, 0x04881d05);
144 OP (FH, A, B, C, D, 9, 4, 0xd9d4d039);
145 OP (FH, D, A, B, C, 12, 11, 0xe6db99e5);
146 OP (FH, C, D, A, B, 15, 16, 0x1fa27cf8);
147 OP (FH, B, C, D, A, 2, 23, 0xc4ac5665);
150 OP (FI, A, B, C, D, 0, 6, 0xf4292244);
151 OP (FI, D, A, B, C, 7, 10, 0x432aff97);
152 OP (FI, C, D, A, B, 14, 15, 0xab9423a7);
153 OP (FI, B, C, D, A, 5, 21, 0xfc93a039);
154 OP (FI, A, B, C, D, 12, 6, 0x655b59c3);
155 OP (FI, D, A, B, C, 3, 10, 0x8f0ccc92);
156 OP (FI, C, D, A, B, 10, 15, 0xffeff47d);
157 OP (FI, B, C, D, A, 1, 21, 0x85845dd1);
158 OP (FI, A, B, C, D, 8, 6, 0x6fa87e4f);
159 OP (FI, D, A, B, C, 15, 10, 0xfe2ce6e0);
160 OP (FI, C, D, A, B, 6, 15, 0xa3014314);
161 OP (FI, B, C, D, A, 13, 21, 0x4e0811a1);
162 OP (FI, A, B, C, D, 4, 6, 0xf7537e82);
163 OP (FI, D, A, B, C, 11, 10, 0xbd3af235);
164 OP (FI, C, D, A, B, 2, 15, 0x2ad7d2bb);
165 OP (FI, B, C, D, A, 9, 21, 0xeb86d391);
167 /* Put checksum in context given as argument. */
176 /* The routine updates the message-digest context to
177 * account for the presence of each of the characters inBuf[0..inLen-1]
178 * in the message whose digest is being computed.
180 void md5_write( MD5_CONTEXT *hd, unsigned char *inbuf, size_t inlen)
182 if( hd->count == 64 ) { /* flush the buffer */
183 transform( hd, hd->buf );
190 for( ; inlen && hd->count < 64; inlen-- )
191 hd->buf[hd->count++] = *inbuf++;
192 md5_write( hd, NULL, 0 );
197 while( inlen >= 64 ) {
198 transform( hd, inbuf );
204 for( ; inlen && hd->count < 64; inlen-- )
205 hd->buf[hd->count++] = *inbuf++;
211 /* The routine final terminates the message-digest computation and
212 * ends with the desired message digest in mdContext->digest[0...15].
213 * The handle is prepared for a new MD5 cycle.
214 * Returns 16 bytes representing the digest.
217 void md5_final( MD5_CONTEXT *hd )
219 unsigned int t, msb, lsb;
222 md5_write(hd, NULL, 0); /* flush */;
226 if( (lsb = t << 6) < t ) /* multiply by 64 to make a byte count */
230 if( (lsb = t + hd->count) < t ) /* add the count */
233 if( (lsb = t << 3) < t ) /* multiply by 8 to make a bit count */
237 if( hd->count < 56 ) { /* enough room */
238 hd->buf[hd->count++] = 0x80; /* pad */
239 while( hd->count < 56 )
240 hd->buf[hd->count++] = 0; /* pad */
242 else { /* need one extra block */
243 hd->buf[hd->count++] = 0x80; /* pad character */
244 while( hd->count < 64 )
245 hd->buf[hd->count++] = 0;
246 md5_write(hd, NULL, 0); /* flush */;
247 memset(hd->buf, 0, 56 ); /* fill next block with zeroes */
249 /* append the 64 bit count */
251 hd->buf[57] = lsb >> 8;
252 hd->buf[58] = lsb >> 16;
253 hd->buf[59] = lsb >> 24;
255 hd->buf[61] = msb >> 8;
256 hd->buf[62] = msb >> 16;
257 hd->buf[63] = msb >> 24;
258 transform( hd, hd->buf );
262 /*#define X(a) do { *(u32*)p = hd->##a ; p += 4; } while(0)*/
263 /* Unixware's cpp doesn't like the above construct so we do it his way:
264 * (reported by Allan Clark) */
265 #define X(a) do { *(unsigned int *)p = (*hd).a ; p += 4; } while(0)
274 unsigned char *md5_read(MD5_CONTEXT *hd)