1 /* crypto/md/md5_dgst.c */
2 /* Copyright (C) 1995-1997 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.]
59 #ifdef USE_MD5 /* Added by ogud@tis.com 1998/1/26 */
60 #include <port_before.h>
63 #include <port_after.h>
65 const char *MD5_version
="MD5 part of SSLeay 0.8.1 19-Jul-1997";
67 /* Implemented from RFC1321 The MD5 Message-Digest Algorithm
70 #define INIT_DATA_A (unsigned long)0x67452301L
71 #define INIT_DATA_B (unsigned long)0xefcdab89L
72 #define INIT_DATA_C (unsigned long)0x98badcfeL
73 #define INIT_DATA_D (unsigned long)0x10325476L
76 static void md5_block(MD5_CTX
*c
, unsigned long *p
);
78 static void md5_block();
93 void MD5_Update(c
, data
, len
)
95 register const unsigned char *data
;
102 if (len
== 0U) return;
104 l
=(c
->Nl
+(len
<<3))&0xffffffffL
;
105 /* 95-05-24 eay Fixed a bug with the overflow handling, thanks to
106 * Wei Dai <weidai@eskimo.com> for pointing it out. */
107 if (l
< c
->Nl
) /* overflow */
118 if ((c
->num
+len
) >= (size_t)MD5_CBLOCK
)
123 for (; sw
<MD5_LBLOCK
; sw
++)
128 len
-=(MD5_CBLOCK
-c
->num
);
132 /* drop through and do the rest */
139 if ((sc
+len
) < 4U) /* ugly, add char's to a word */
142 p_c2l_p(data
,l
,sc
,len
);
152 for (; sw
< ew
; sw
++)
153 { c2l(data
,l
); p
[sw
]=l
; }
163 /* we now can process the input data in blocks of MD5_CBLOCK
164 * chars and save the leftovers to c->data. */
166 while (len
>= (size_t)MD5_CBLOCK
)
168 #if defined(L_ENDIAN) || defined(B_ENDIAN)
169 memcpy(p
,data
,MD5_CBLOCK
);
172 for (sw
=(MD5_LBLOCK
/4); sw
; sw
--)
174 Endian_Reverse32(p
[0]);
175 Endian_Reverse32(p
[1]);
176 Endian_Reverse32(p
[2]);
177 Endian_Reverse32(p
[3]);
182 for (sw
=(MD5_LBLOCK
/4); sw
; sw
--)
184 c2l(data
,l
); *(p
++)=l
;
185 c2l(data
,l
); *(p
++)=l
;
186 c2l(data
,l
); *(p
++)=l
;
187 c2l(data
,l
); *(p
++)=l
;
198 sw
=sc
>>2; /* words to copy */
205 { c2l(data
,l
); *(p
++)=l
; }
212 static void md5_block(c
, X
)
216 register ULONG A
,B
,C
,D
;
224 R0(A
,B
,C
,D
,X
[ 0], 7,0xd76aa478L
);
225 R0(D
,A
,B
,C
,X
[ 1],12,0xe8c7b756L
);
226 R0(C
,D
,A
,B
,X
[ 2],17,0x242070dbL
);
227 R0(B
,C
,D
,A
,X
[ 3],22,0xc1bdceeeL
);
228 R0(A
,B
,C
,D
,X
[ 4], 7,0xf57c0fafL
);
229 R0(D
,A
,B
,C
,X
[ 5],12,0x4787c62aL
);
230 R0(C
,D
,A
,B
,X
[ 6],17,0xa8304613L
);
231 R0(B
,C
,D
,A
,X
[ 7],22,0xfd469501L
);
232 R0(A
,B
,C
,D
,X
[ 8], 7,0x698098d8L
);
233 R0(D
,A
,B
,C
,X
[ 9],12,0x8b44f7afL
);
234 R0(C
,D
,A
,B
,X
[10],17,0xffff5bb1L
);
235 R0(B
,C
,D
,A
,X
[11],22,0x895cd7beL
);
236 R0(A
,B
,C
,D
,X
[12], 7,0x6b901122L
);
237 R0(D
,A
,B
,C
,X
[13],12,0xfd987193L
);
238 R0(C
,D
,A
,B
,X
[14],17,0xa679438eL
);
239 R0(B
,C
,D
,A
,X
[15],22,0x49b40821L
);
241 R1(A
,B
,C
,D
,X
[ 1], 5,0xf61e2562L
);
242 R1(D
,A
,B
,C
,X
[ 6], 9,0xc040b340L
);
243 R1(C
,D
,A
,B
,X
[11],14,0x265e5a51L
);
244 R1(B
,C
,D
,A
,X
[ 0],20,0xe9b6c7aaL
);
245 R1(A
,B
,C
,D
,X
[ 5], 5,0xd62f105dL
);
246 R1(D
,A
,B
,C
,X
[10], 9,0x02441453L
);
247 R1(C
,D
,A
,B
,X
[15],14,0xd8a1e681L
);
248 R1(B
,C
,D
,A
,X
[ 4],20,0xe7d3fbc8L
);
249 R1(A
,B
,C
,D
,X
[ 9], 5,0x21e1cde6L
);
250 R1(D
,A
,B
,C
,X
[14], 9,0xc33707d6L
);
251 R1(C
,D
,A
,B
,X
[ 3],14,0xf4d50d87L
);
252 R1(B
,C
,D
,A
,X
[ 8],20,0x455a14edL
);
253 R1(A
,B
,C
,D
,X
[13], 5,0xa9e3e905L
);
254 R1(D
,A
,B
,C
,X
[ 2], 9,0xfcefa3f8L
);
255 R1(C
,D
,A
,B
,X
[ 7],14,0x676f02d9L
);
256 R1(B
,C
,D
,A
,X
[12],20,0x8d2a4c8aL
);
258 R2(A
,B
,C
,D
,X
[ 5], 4,0xfffa3942L
);
259 R2(D
,A
,B
,C
,X
[ 8],11,0x8771f681L
);
260 R2(C
,D
,A
,B
,X
[11],16,0x6d9d6122L
);
261 R2(B
,C
,D
,A
,X
[14],23,0xfde5380cL
);
262 R2(A
,B
,C
,D
,X
[ 1], 4,0xa4beea44L
);
263 R2(D
,A
,B
,C
,X
[ 4],11,0x4bdecfa9L
);
264 R2(C
,D
,A
,B
,X
[ 7],16,0xf6bb4b60L
);
265 R2(B
,C
,D
,A
,X
[10],23,0xbebfbc70L
);
266 R2(A
,B
,C
,D
,X
[13], 4,0x289b7ec6L
);
267 R2(D
,A
,B
,C
,X
[ 0],11,0xeaa127faL
);
268 R2(C
,D
,A
,B
,X
[ 3],16,0xd4ef3085L
);
269 R2(B
,C
,D
,A
,X
[ 6],23,0x04881d05L
);
270 R2(A
,B
,C
,D
,X
[ 9], 4,0xd9d4d039L
);
271 R2(D
,A
,B
,C
,X
[12],11,0xe6db99e5L
);
272 R2(C
,D
,A
,B
,X
[15],16,0x1fa27cf8L
);
273 R2(B
,C
,D
,A
,X
[ 2],23,0xc4ac5665L
);
275 R3(A
,B
,C
,D
,X
[ 0], 6,0xf4292244L
);
276 R3(D
,A
,B
,C
,X
[ 7],10,0x432aff97L
);
277 R3(C
,D
,A
,B
,X
[14],15,0xab9423a7L
);
278 R3(B
,C
,D
,A
,X
[ 5],21,0xfc93a039L
);
279 R3(A
,B
,C
,D
,X
[12], 6,0x655b59c3L
);
280 R3(D
,A
,B
,C
,X
[ 3],10,0x8f0ccc92L
);
281 R3(C
,D
,A
,B
,X
[10],15,0xffeff47dL
);
282 R3(B
,C
,D
,A
,X
[ 1],21,0x85845dd1L
);
283 R3(A
,B
,C
,D
,X
[ 8], 6,0x6fa87e4fL
);
284 R3(D
,A
,B
,C
,X
[15],10,0xfe2ce6e0L
);
285 R3(C
,D
,A
,B
,X
[ 6],15,0xa3014314L
);
286 R3(B
,C
,D
,A
,X
[13],21,0x4e0811a1L
);
287 R3(A
,B
,C
,D
,X
[ 4], 6,0xf7537e82L
);
288 R3(D
,A
,B
,C
,X
[11],10,0xbd3af235L
);
289 R3(C
,D
,A
,B
,X
[ 2],15,0x2ad7d2bbL
);
290 R3(B
,C
,D
,A
,X
[ 9],21,0xeb86d391L
);
298 void MD5_Final(md
, c
)
305 static unsigned char end
[4]={0x80,0x00,0x00,0x00};
306 unsigned char *cp
=end
;
308 /* c->num should definitly have room for at least one more byte. */
313 /* purify often complains about the following line as an
314 * Uninitialized Memory Read. While this can be true, the
315 * following p_c2l macro will reset l when that case is true.
316 * This is because j&0x03 contains the number of 'valid' bytes
317 * already in p[i]. If and only if j&0x03 == 0, the UMR will
318 * occur but this is also the only time p_c2l will do
319 * l= *(cp++) instead of l|= *(cp++)
320 * Many thanks to Alex Tang <altitude@cic.net> for pickup this
323 if ((j
&0x03) == 0) p
[i
]=0;
329 /* i is the next 'undefined word' */
330 if (c
->num
>= MD5_LAST_BLOCK
)
332 for (; i
<MD5_LBLOCK
; i
++)
337 for (; i
<(MD5_LBLOCK
-2); i
++)
339 p
[MD5_LBLOCK
-2]=c
->Nl
;
340 p
[MD5_LBLOCK
-1]=c
->Nh
;
348 /* clear stuff, md5_block may be leaving some stuff on the stack
349 * but I'm not worried :-) */
351 /* memset((char *)&c,0,sizeof(c));*/
362 for (ii
=0; ii
<8; ii
++)
364 fprintf(stderr
,"%08lx ",l
[i
*8+ii
]);
366 fprintf(stderr
,"\n");