1 /* crypto/md5/md5_dgst.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
5 * This package is an SSL implementation written
6 * by Eric Young (eay@cryptsoft.com).
7 * The implementation was written so as to conform with Netscapes SSL.
9 * This library is free for commercial and non-commercial use as long as
10 * the following conditions are aheared to. The following conditions
11 * apply to all code found in this distribution, be it the RC4, RSA,
12 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
13 * included with this distribution is covered by the same copyright terms
14 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
16 * Copyright remains Eric Young's, and as such any Copyright notices in
17 * the code are not to be removed.
18 * If this package is used in a product, Eric Young should be given attribution
19 * as the author of the parts of the library used.
20 * This can be in the form of a textual message at program startup or
21 * in documentation (online or textual) provided with the package.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
26 * 1. Redistributions of source code must retain the copyright
27 * notice, this list of conditions and the following disclaimer.
28 * 2. Redistributions in binary form must reproduce the above copyright
29 * notice, this list of conditions and the following disclaimer in the
30 * documentation and/or other materials provided with the distribution.
31 * 3. All advertising materials mentioning features or use of this software
32 * must display the following acknowledgement:
33 * "This product includes cryptographic software written by
34 * Eric Young (eay@cryptsoft.com)"
35 * The word 'cryptographic' can be left out if the rouines from the library
36 * being used are not cryptographic related :-).
37 * 4. If you include any Windows specific code (or a derivative thereof) from
38 * the apps directory (application code) you must include an acknowledgement:
39 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
41 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
53 * The licence and distribution terms for any publically available version or
54 * derivative of this code cannot be changed. i.e. this code cannot simply be
55 * copied and put under another distribution licence
56 * [including the GNU Public Licence.]
61 #include <openssl/opensslv.h>
63 char *MD5_version="MD5" OPENSSL_VERSION_PTEXT;
65 /* Implemented from RFC1321 The MD5 Message-Digest Algorithm
68 #define INIT_DATA_A (unsigned long)0x67452301L
69 #define INIT_DATA_B (unsigned long)0xefcdab89L
70 #define INIT_DATA_C (unsigned long)0x98badcfeL
71 #define INIT_DATA_D (unsigned long)0x10325476L
74 void md5_block_x86(MD5_CTX *c, unsigned long *p,int num);
75 # define md5_block md5_block_x86
77 static void md5_block(MD5_CTX *c, unsigned long *p,int num);
79 void MD5_Init(MD5_CTX *c)
90 void MD5_Update(MD5_CTX *c, const void *_data, unsigned long len)
92 register const unsigned char *data=_data;
99 l=(c->Nl+(len<<3))&0xffffffffL;
100 /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
101 * Wei Dai <weidai@eskimo.com> for pointing it out. */
102 if (l < c->Nl) /* overflow */
113 if ((c->num+len) >= MD5_CBLOCK)
118 for (; sw<MD5_LBLOCK; sw++)
123 len-=(MD5_CBLOCK-c->num);
127 /* drop through and do the rest */
134 if ((sc+len) < 4) /* ugly, add char's to a word */
137 p_c2l_p(data,l,sc,len);
147 for (; sw < ew; sw++)
148 { c2l(data,l); p[sw]=l; }
158 /* we now can process the input data in blocks of MD5_CBLOCK
159 * chars and save the leftovers to c->data. */
161 if ((((unsigned long)data)%sizeof(ULONG)) == 0)
163 sw=(int)len/MD5_CBLOCK;
167 md5_block(c,(ULONG *)data,sw);
174 while (len >= MD5_CBLOCK)
176 #if defined(L_ENDIAN) || defined(B_ENDIAN)
177 if (p != (unsigned long *)data)
178 memcpy(p,data,MD5_CBLOCK);
181 for (sw=(MD5_LBLOCK/4); sw; sw--)
183 Endian_Reverse32(p[0]);
184 Endian_Reverse32(p[1]);
185 Endian_Reverse32(p[2]);
186 Endian_Reverse32(p[3]);
191 for (sw=(MD5_LBLOCK/4); sw; sw--)
193 c2l(data,l); *(p++)=l;
194 c2l(data,l); *(p++)=l;
195 c2l(data,l); *(p++)=l;
196 c2l(data,l); *(p++)=l;
207 sw=sc>>2; /* words to copy */
214 { c2l(data,l); *(p++)=l; }
221 void MD5_Transform(MD5_CTX *c, unsigned char *b)
224 #if !defined(L_ENDIAN)
229 #if defined(B_ENDIAN) || defined(L_ENDIAN)
233 for (i=(MD5_LBLOCK/4); i; i--)
235 Endian_Reverse32(q[0]);
236 Endian_Reverse32(q[1]);
237 Endian_Reverse32(q[2]);
238 Endian_Reverse32(q[3]);
244 for (i=(MD5_LBLOCK/4); i; i--)
258 static void md5_block(MD5_CTX *c, register ULONG *X, int num)
260 register ULONG A,B,C,D;
269 R0(A,B,C,D,X[ 0], 7,0xd76aa478L);
270 R0(D,A,B,C,X[ 1],12,0xe8c7b756L);
271 R0(C,D,A,B,X[ 2],17,0x242070dbL);
272 R0(B,C,D,A,X[ 3],22,0xc1bdceeeL);
273 R0(A,B,C,D,X[ 4], 7,0xf57c0fafL);
274 R0(D,A,B,C,X[ 5],12,0x4787c62aL);
275 R0(C,D,A,B,X[ 6],17,0xa8304613L);
276 R0(B,C,D,A,X[ 7],22,0xfd469501L);
277 R0(A,B,C,D,X[ 8], 7,0x698098d8L);
278 R0(D,A,B,C,X[ 9],12,0x8b44f7afL);
279 R0(C,D,A,B,X[10],17,0xffff5bb1L);
280 R0(B,C,D,A,X[11],22,0x895cd7beL);
281 R0(A,B,C,D,X[12], 7,0x6b901122L);
282 R0(D,A,B,C,X[13],12,0xfd987193L);
283 R0(C,D,A,B,X[14],17,0xa679438eL);
284 R0(B,C,D,A,X[15],22,0x49b40821L);
286 R1(A,B,C,D,X[ 1], 5,0xf61e2562L);
287 R1(D,A,B,C,X[ 6], 9,0xc040b340L);
288 R1(C,D,A,B,X[11],14,0x265e5a51L);
289 R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL);
290 R1(A,B,C,D,X[ 5], 5,0xd62f105dL);
291 R1(D,A,B,C,X[10], 9,0x02441453L);
292 R1(C,D,A,B,X[15],14,0xd8a1e681L);
293 R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L);
294 R1(A,B,C,D,X[ 9], 5,0x21e1cde6L);
295 R1(D,A,B,C,X[14], 9,0xc33707d6L);
296 R1(C,D,A,B,X[ 3],14,0xf4d50d87L);
297 R1(B,C,D,A,X[ 8],20,0x455a14edL);
298 R1(A,B,C,D,X[13], 5,0xa9e3e905L);
299 R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L);
300 R1(C,D,A,B,X[ 7],14,0x676f02d9L);
301 R1(B,C,D,A,X[12],20,0x8d2a4c8aL);
303 R2(A,B,C,D,X[ 5], 4,0xfffa3942L);
304 R2(D,A,B,C,X[ 8],11,0x8771f681L);
305 R2(C,D,A,B,X[11],16,0x6d9d6122L);
306 R2(B,C,D,A,X[14],23,0xfde5380cL);
307 R2(A,B,C,D,X[ 1], 4,0xa4beea44L);
308 R2(D,A,B,C,X[ 4],11,0x4bdecfa9L);
309 R2(C,D,A,B,X[ 7],16,0xf6bb4b60L);
310 R2(B,C,D,A,X[10],23,0xbebfbc70L);
311 R2(A,B,C,D,X[13], 4,0x289b7ec6L);
312 R2(D,A,B,C,X[ 0],11,0xeaa127faL);
313 R2(C,D,A,B,X[ 3],16,0xd4ef3085L);
314 R2(B,C,D,A,X[ 6],23,0x04881d05L);
315 R2(A,B,C,D,X[ 9], 4,0xd9d4d039L);
316 R2(D,A,B,C,X[12],11,0xe6db99e5L);
317 R2(C,D,A,B,X[15],16,0x1fa27cf8L);
318 R2(B,C,D,A,X[ 2],23,0xc4ac5665L);
320 R3(A,B,C,D,X[ 0], 6,0xf4292244L);
321 R3(D,A,B,C,X[ 7],10,0x432aff97L);
322 R3(C,D,A,B,X[14],15,0xab9423a7L);
323 R3(B,C,D,A,X[ 5],21,0xfc93a039L);
324 R3(A,B,C,D,X[12], 6,0x655b59c3L);
325 R3(D,A,B,C,X[ 3],10,0x8f0ccc92L);
326 R3(C,D,A,B,X[10],15,0xffeff47dL);
327 R3(B,C,D,A,X[ 1],21,0x85845dd1L);
328 R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL);
329 R3(D,A,B,C,X[15],10,0xfe2ce6e0L);
330 R3(C,D,A,B,X[ 6],15,0xa3014314L);
331 R3(B,C,D,A,X[13],21,0x4e0811a1L);
332 R3(A,B,C,D,X[ 4], 6,0xf7537e82L);
333 R3(D,A,B,C,X[11],10,0xbd3af235L);
334 R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL);
335 R3(B,C,D,A,X[ 9],21,0xeb86d391L);
352 void MD5_Final(unsigned char *md, MD5_CTX *c)
357 static unsigned char end[4]={0x80,0x00,0x00,0x00};
358 unsigned char *cp=end;
360 /* c->num should definitly have room for at least one more byte. */
365 /* purify often complains about the following line as an
366 * Uninitialized Memory Read. While this can be true, the
367 * following p_c2l macro will reset l when that case is true.
368 * This is because j&0x03 contains the number of 'valid' bytes
369 * already in p[i]. If and only if j&0x03 == 0, the UMR will
370 * occur but this is also the only time p_c2l will do
371 * l= *(cp++) instead of l|= *(cp++)
372 * Many thanks to Alex Tang <altitude@cic.net> for pickup this
375 if ((j&0x03) == 0) p[i]=0;
381 /* i is the next 'undefined word' */
382 if (c->num >= MD5_LAST_BLOCK)
384 for (; i<MD5_LBLOCK; i++)
389 for (; i<(MD5_LBLOCK-2); i++)
391 p[MD5_LBLOCK-2]=c->Nl;
392 p[MD5_LBLOCK-1]=c->Nh;
400 /* clear stuff, md5_block may be leaving some stuff on the stack
401 * but I'm not worried :-) */
403 /* memset((char *)&c,0,sizeof(c));*/
407 int printit(unsigned long *l)
413 for (ii=0; ii<8; ii++)
415 fprintf(stderr,"%08lx ",l[i*8+ii]);
417 fprintf(stderr,"\n");