]>
Commit | Line | Data |
---|---|---|
58964a49 RE |
1 | /* crypto/md5/md5_dgst.c */ |
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | |
3 | * All rights reserved. | |
4 | * | |
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. | |
8 | * | |
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). | |
15 | * | |
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. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
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)" | |
40 | * | |
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 | |
51 | * SUCH DAMAGE. | |
52 | * | |
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.] | |
57 | */ | |
58 | ||
59 | #include <stdio.h> | |
60 | #include "md5_locl.h" | |
ec577822 | 61 | #include <openssl/opensslv.h> |
58964a49 | 62 | |
9d1a01be | 63 | const char *MD5_version="MD5" OPENSSL_VERSION_PTEXT; |
58964a49 RE |
64 | |
65 | /* Implemented from RFC1321 The MD5 Message-Digest Algorithm | |
66 | */ | |
67 | ||
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 | |
72 | ||
6b691a5c | 73 | void MD5_Init(MD5_CTX *c) |
58964a49 RE |
74 | { |
75 | c->A=INIT_DATA_A; | |
76 | c->B=INIT_DATA_B; | |
77 | c->C=INIT_DATA_C; | |
78 | c->D=INIT_DATA_D; | |
79 | c->Nl=0; | |
80 | c->Nh=0; | |
81 | c->num=0; | |
82 | } | |
83 | ||
bd3576d2 | 84 | #ifndef md5_block_host_order |
ac7d0785 | 85 | void md5_block_host_order (MD5_CTX *c, const void *data, int num) |
58964a49 | 86 | { |
ac7d0785 | 87 | const MD5_LONG *X=data; |
bd3576d2 UM |
88 | register unsigned long A,B,C,D; |
89 | /* | |
90 | * In case you wonder why A-D are declared as long and not | |
91 | * as MD5_LONG. Doing so results in slight performance | |
92 | * boost on LP64 architectures. The catch is we don't | |
93 | * really care if 32 MSBs of a 64-bit register get polluted | |
94 | * with eventual overflows as we *save* only 32 LSBs in | |
95 | * *either* case. Now declaring 'em long excuses the compiler | |
96 | * from keeping 32 MSBs zeroed resulting in 13% performance | |
97 | * improvement under SPARC Solaris7/64 and 5% under AlphaLinux. | |
98 | * Well, to be honest it should say that this *prevents* | |
99 | * performance degradation. | |
100 | * | |
101 | * <appro@fy.chalmers.se> | |
102 | */ | |
58964a49 RE |
103 | |
104 | A=c->A; | |
105 | B=c->B; | |
106 | C=c->C; | |
107 | D=c->D; | |
bd3576d2 UM |
108 | |
109 | for (;num--;X+=HASH_LBLOCK) | |
58964a49 RE |
110 | { |
111 | /* Round 0 */ | |
112 | R0(A,B,C,D,X[ 0], 7,0xd76aa478L); | |
113 | R0(D,A,B,C,X[ 1],12,0xe8c7b756L); | |
114 | R0(C,D,A,B,X[ 2],17,0x242070dbL); | |
115 | R0(B,C,D,A,X[ 3],22,0xc1bdceeeL); | |
116 | R0(A,B,C,D,X[ 4], 7,0xf57c0fafL); | |
117 | R0(D,A,B,C,X[ 5],12,0x4787c62aL); | |
118 | R0(C,D,A,B,X[ 6],17,0xa8304613L); | |
119 | R0(B,C,D,A,X[ 7],22,0xfd469501L); | |
120 | R0(A,B,C,D,X[ 8], 7,0x698098d8L); | |
121 | R0(D,A,B,C,X[ 9],12,0x8b44f7afL); | |
122 | R0(C,D,A,B,X[10],17,0xffff5bb1L); | |
123 | R0(B,C,D,A,X[11],22,0x895cd7beL); | |
124 | R0(A,B,C,D,X[12], 7,0x6b901122L); | |
125 | R0(D,A,B,C,X[13],12,0xfd987193L); | |
126 | R0(C,D,A,B,X[14],17,0xa679438eL); | |
127 | R0(B,C,D,A,X[15],22,0x49b40821L); | |
128 | /* Round 1 */ | |
129 | R1(A,B,C,D,X[ 1], 5,0xf61e2562L); | |
130 | R1(D,A,B,C,X[ 6], 9,0xc040b340L); | |
131 | R1(C,D,A,B,X[11],14,0x265e5a51L); | |
132 | R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL); | |
133 | R1(A,B,C,D,X[ 5], 5,0xd62f105dL); | |
134 | R1(D,A,B,C,X[10], 9,0x02441453L); | |
135 | R1(C,D,A,B,X[15],14,0xd8a1e681L); | |
136 | R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L); | |
137 | R1(A,B,C,D,X[ 9], 5,0x21e1cde6L); | |
138 | R1(D,A,B,C,X[14], 9,0xc33707d6L); | |
139 | R1(C,D,A,B,X[ 3],14,0xf4d50d87L); | |
140 | R1(B,C,D,A,X[ 8],20,0x455a14edL); | |
141 | R1(A,B,C,D,X[13], 5,0xa9e3e905L); | |
142 | R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L); | |
143 | R1(C,D,A,B,X[ 7],14,0x676f02d9L); | |
144 | R1(B,C,D,A,X[12],20,0x8d2a4c8aL); | |
145 | /* Round 2 */ | |
146 | R2(A,B,C,D,X[ 5], 4,0xfffa3942L); | |
147 | R2(D,A,B,C,X[ 8],11,0x8771f681L); | |
148 | R2(C,D,A,B,X[11],16,0x6d9d6122L); | |
149 | R2(B,C,D,A,X[14],23,0xfde5380cL); | |
150 | R2(A,B,C,D,X[ 1], 4,0xa4beea44L); | |
151 | R2(D,A,B,C,X[ 4],11,0x4bdecfa9L); | |
152 | R2(C,D,A,B,X[ 7],16,0xf6bb4b60L); | |
153 | R2(B,C,D,A,X[10],23,0xbebfbc70L); | |
154 | R2(A,B,C,D,X[13], 4,0x289b7ec6L); | |
155 | R2(D,A,B,C,X[ 0],11,0xeaa127faL); | |
156 | R2(C,D,A,B,X[ 3],16,0xd4ef3085L); | |
157 | R2(B,C,D,A,X[ 6],23,0x04881d05L); | |
158 | R2(A,B,C,D,X[ 9], 4,0xd9d4d039L); | |
159 | R2(D,A,B,C,X[12],11,0xe6db99e5L); | |
160 | R2(C,D,A,B,X[15],16,0x1fa27cf8L); | |
161 | R2(B,C,D,A,X[ 2],23,0xc4ac5665L); | |
162 | /* Round 3 */ | |
163 | R3(A,B,C,D,X[ 0], 6,0xf4292244L); | |
164 | R3(D,A,B,C,X[ 7],10,0x432aff97L); | |
165 | R3(C,D,A,B,X[14],15,0xab9423a7L); | |
166 | R3(B,C,D,A,X[ 5],21,0xfc93a039L); | |
167 | R3(A,B,C,D,X[12], 6,0x655b59c3L); | |
168 | R3(D,A,B,C,X[ 3],10,0x8f0ccc92L); | |
169 | R3(C,D,A,B,X[10],15,0xffeff47dL); | |
170 | R3(B,C,D,A,X[ 1],21,0x85845dd1L); | |
171 | R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL); | |
172 | R3(D,A,B,C,X[15],10,0xfe2ce6e0L); | |
173 | R3(C,D,A,B,X[ 6],15,0xa3014314L); | |
174 | R3(B,C,D,A,X[13],21,0x4e0811a1L); | |
175 | R3(A,B,C,D,X[ 4], 6,0xf7537e82L); | |
176 | R3(D,A,B,C,X[11],10,0xbd3af235L); | |
177 | R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL); | |
178 | R3(B,C,D,A,X[ 9],21,0xeb86d391L); | |
179 | ||
bd3576d2 UM |
180 | A = c->A += A; |
181 | B = c->B += B; | |
182 | C = c->C += C; | |
183 | D = c->D += D; | |
58964a49 RE |
184 | } |
185 | } | |
186 | #endif | |
187 | ||
bd3576d2 | 188 | #ifndef md5_block_data_order |
e1a228fb | 189 | void md5_block_data_order (MD5_CTX *c, const void *data_, int num) |
58964a49 | 190 | { |
e1a228fb | 191 | const unsigned char *data=data_; |
bd3576d2 UM |
192 | register unsigned long A,B,C,D,l; |
193 | /* | |
194 | * In case you wonder why A-D are declared as long and not | |
195 | * as MD5_LONG. Doing so results in slight performance | |
196 | * boost on LP64 architectures. The catch is we don't | |
197 | * really care if 32 MSBs of a 64-bit register get polluted | |
198 | * with eventual overflows as we *save* only 32 LSBs in | |
199 | * *either* case. Now declaring 'em long excuses the compiler | |
200 | * from keeping 32 MSBs zeroed resulting in 13% performance | |
201 | * improvement under SPARC Solaris7/64 and 5% under AlphaLinux. | |
202 | * Well, to be honest it should say that this *prevents* | |
203 | * performance degradation. | |
204 | * | |
205 | * <appro@fy.chalmers.se> | |
206 | */ | |
207 | MD5_LONG X[MD5_LBLOCK]; | |
208 | /* | |
209 | * In case you wonder why don't I use c->data for this. | |
210 | * RISCs usually have a handful of registers and if X is | |
211 | * declared as automatic array good optimizing compiler | |
212 | * shall accomodate at least part of it in register bank | |
213 | * instead of memory. | |
214 | * | |
215 | * <appro@fy.chalmers.se> | |
216 | */ | |
58964a49 | 217 | |
bd3576d2 UM |
218 | A=c->A; |
219 | B=c->B; | |
220 | C=c->C; | |
221 | D=c->D; | |
58964a49 | 222 | |
bd3576d2 | 223 | for (;num--;) |
58964a49 | 224 | { |
bd3576d2 UM |
225 | HOST_c2l(data,l); X[ 0]=l; HOST_c2l(data,l); X[ 1]=l; |
226 | /* Round 0 */ | |
227 | R0(A,B,C,D,X[ 0], 7,0xd76aa478L); HOST_c2l(data,l); X[ 2]=l; | |
228 | R0(D,A,B,C,X[ 1],12,0xe8c7b756L); HOST_c2l(data,l); X[ 3]=l; | |
229 | R0(C,D,A,B,X[ 2],17,0x242070dbL); HOST_c2l(data,l); X[ 4]=l; | |
230 | R0(B,C,D,A,X[ 3],22,0xc1bdceeeL); HOST_c2l(data,l); X[ 5]=l; | |
231 | R0(A,B,C,D,X[ 4], 7,0xf57c0fafL); HOST_c2l(data,l); X[ 6]=l; | |
232 | R0(D,A,B,C,X[ 5],12,0x4787c62aL); HOST_c2l(data,l); X[ 7]=l; | |
233 | R0(C,D,A,B,X[ 6],17,0xa8304613L); HOST_c2l(data,l); X[ 8]=l; | |
234 | R0(B,C,D,A,X[ 7],22,0xfd469501L); HOST_c2l(data,l); X[ 9]=l; | |
235 | R0(A,B,C,D,X[ 8], 7,0x698098d8L); HOST_c2l(data,l); X[10]=l; | |
236 | R0(D,A,B,C,X[ 9],12,0x8b44f7afL); HOST_c2l(data,l); X[11]=l; | |
237 | R0(C,D,A,B,X[10],17,0xffff5bb1L); HOST_c2l(data,l); X[12]=l; | |
238 | R0(B,C,D,A,X[11],22,0x895cd7beL); HOST_c2l(data,l); X[13]=l; | |
239 | R0(A,B,C,D,X[12], 7,0x6b901122L); HOST_c2l(data,l); X[14]=l; | |
240 | R0(D,A,B,C,X[13],12,0xfd987193L); HOST_c2l(data,l); X[15]=l; | |
241 | R0(C,D,A,B,X[14],17,0xa679438eL); | |
242 | R0(B,C,D,A,X[15],22,0x49b40821L); | |
243 | /* Round 1 */ | |
244 | R1(A,B,C,D,X[ 1], 5,0xf61e2562L); | |
245 | R1(D,A,B,C,X[ 6], 9,0xc040b340L); | |
246 | R1(C,D,A,B,X[11],14,0x265e5a51L); | |
247 | R1(B,C,D,A,X[ 0],20,0xe9b6c7aaL); | |
248 | R1(A,B,C,D,X[ 5], 5,0xd62f105dL); | |
249 | R1(D,A,B,C,X[10], 9,0x02441453L); | |
250 | R1(C,D,A,B,X[15],14,0xd8a1e681L); | |
251 | R1(B,C,D,A,X[ 4],20,0xe7d3fbc8L); | |
252 | R1(A,B,C,D,X[ 9], 5,0x21e1cde6L); | |
253 | R1(D,A,B,C,X[14], 9,0xc33707d6L); | |
254 | R1(C,D,A,B,X[ 3],14,0xf4d50d87L); | |
255 | R1(B,C,D,A,X[ 8],20,0x455a14edL); | |
256 | R1(A,B,C,D,X[13], 5,0xa9e3e905L); | |
257 | R1(D,A,B,C,X[ 2], 9,0xfcefa3f8L); | |
258 | R1(C,D,A,B,X[ 7],14,0x676f02d9L); | |
259 | R1(B,C,D,A,X[12],20,0x8d2a4c8aL); | |
260 | /* Round 2 */ | |
261 | R2(A,B,C,D,X[ 5], 4,0xfffa3942L); | |
262 | R2(D,A,B,C,X[ 8],11,0x8771f681L); | |
263 | R2(C,D,A,B,X[11],16,0x6d9d6122L); | |
264 | R2(B,C,D,A,X[14],23,0xfde5380cL); | |
265 | R2(A,B,C,D,X[ 1], 4,0xa4beea44L); | |
266 | R2(D,A,B,C,X[ 4],11,0x4bdecfa9L); | |
267 | R2(C,D,A,B,X[ 7],16,0xf6bb4b60L); | |
268 | R2(B,C,D,A,X[10],23,0xbebfbc70L); | |
269 | R2(A,B,C,D,X[13], 4,0x289b7ec6L); | |
270 | R2(D,A,B,C,X[ 0],11,0xeaa127faL); | |
271 | R2(C,D,A,B,X[ 3],16,0xd4ef3085L); | |
272 | R2(B,C,D,A,X[ 6],23,0x04881d05L); | |
273 | R2(A,B,C,D,X[ 9], 4,0xd9d4d039L); | |
274 | R2(D,A,B,C,X[12],11,0xe6db99e5L); | |
275 | R2(C,D,A,B,X[15],16,0x1fa27cf8L); | |
276 | R2(B,C,D,A,X[ 2],23,0xc4ac5665L); | |
277 | /* Round 3 */ | |
278 | R3(A,B,C,D,X[ 0], 6,0xf4292244L); | |
279 | R3(D,A,B,C,X[ 7],10,0x432aff97L); | |
280 | R3(C,D,A,B,X[14],15,0xab9423a7L); | |
281 | R3(B,C,D,A,X[ 5],21,0xfc93a039L); | |
282 | R3(A,B,C,D,X[12], 6,0x655b59c3L); | |
283 | R3(D,A,B,C,X[ 3],10,0x8f0ccc92L); | |
284 | R3(C,D,A,B,X[10],15,0xffeff47dL); | |
285 | R3(B,C,D,A,X[ 1],21,0x85845dd1L); | |
286 | R3(A,B,C,D,X[ 8], 6,0x6fa87e4fL); | |
287 | R3(D,A,B,C,X[15],10,0xfe2ce6e0L); | |
288 | R3(C,D,A,B,X[ 6],15,0xa3014314L); | |
289 | R3(B,C,D,A,X[13],21,0x4e0811a1L); | |
290 | R3(A,B,C,D,X[ 4], 6,0xf7537e82L); | |
291 | R3(D,A,B,C,X[11],10,0xbd3af235L); | |
292 | R3(C,D,A,B,X[ 2],15,0x2ad7d2bbL); | |
293 | R3(B,C,D,A,X[ 9],21,0xeb86d391L); | |
58964a49 | 294 | |
bd3576d2 UM |
295 | A = c->A += A; |
296 | B = c->B += B; | |
297 | C = c->C += C; | |
298 | D = c->D += D; | |
299 | } | |
58964a49 | 300 | } |
bd3576d2 | 301 | #endif |
58964a49 RE |
302 | |
303 | #ifdef undef | |
6b691a5c | 304 | int printit(unsigned long *l) |
58964a49 RE |
305 | { |
306 | int i,ii; | |
307 | ||
308 | for (i=0; i<2; i++) | |
309 | { | |
310 | for (ii=0; ii<8; ii++) | |
311 | { | |
312 | fprintf(stderr,"%08lx ",l[i*8+ii]); | |
313 | } | |
314 | fprintf(stderr,"\n"); | |
315 | } | |
316 | } | |
317 | #endif |