]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/sha/sha1dgst.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
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> | |
58964a49 | 60 | #include <string.h> |
d02b48c6 RE |
61 | #undef SHA_0 |
62 | #define SHA_1 | |
63 | #include "sha.h" | |
64 | #include "sha_locl.h" | |
b4cadc6e | 65 | #include "opensslv.h" |
d02b48c6 | 66 | |
b4cadc6e | 67 | char *SHA1_version="SHA1" OPENSSL_VERSION_PTEXT; |
d02b48c6 RE |
68 | |
69 | /* Implemented from SHA-1 document - The Secure Hash Algorithm | |
70 | */ | |
71 | ||
72 | #define INIT_DATA_h0 (unsigned long)0x67452301L | |
73 | #define INIT_DATA_h1 (unsigned long)0xefcdab89L | |
74 | #define INIT_DATA_h2 (unsigned long)0x98badcfeL | |
75 | #define INIT_DATA_h3 (unsigned long)0x10325476L | |
76 | #define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L | |
77 | ||
78 | #define K_00_19 0x5a827999L | |
79 | #define K_20_39 0x6ed9eba1L | |
80 | #define K_40_59 0x8f1bbcdcL | |
81 | #define K_60_79 0xca62c1d6L | |
82 | ||
83 | #ifndef NOPROTO | |
58964a49 RE |
84 | # ifdef SHA1_ASM |
85 | void sha1_block_x86(SHA_CTX *c, register unsigned long *p, int num); | |
86 | # define sha1_block sha1_block_x86 | |
87 | # else | |
88 | void sha1_block(SHA_CTX *c, register unsigned long *p, int num); | |
89 | # endif | |
d02b48c6 | 90 | #else |
58964a49 RE |
91 | # ifdef SHA1_ASM |
92 | void sha1_block_x86(); | |
93 | # define sha1_block sha1_block_x86 | |
94 | # else | |
95 | void sha1_block(); | |
96 | # endif | |
97 | #endif | |
98 | ||
99 | ||
100 | #if defined(L_ENDIAN) && defined(SHA1_ASM) | |
101 | # define M_c2nl c2l | |
102 | # define M_p_c2nl p_c2l | |
103 | # define M_c2nl_p c2l_p | |
104 | # define M_p_c2nl_p p_c2l_p | |
105 | # define M_nl2c l2c | |
106 | #else | |
107 | # define M_c2nl c2nl | |
108 | # define M_p_c2nl p_c2nl | |
109 | # define M_c2nl_p c2nl_p | |
110 | # define M_p_c2nl_p p_c2nl_p | |
111 | # define M_nl2c nl2c | |
d02b48c6 RE |
112 | #endif |
113 | ||
114 | void SHA1_Init(c) | |
115 | SHA_CTX *c; | |
116 | { | |
117 | c->h0=INIT_DATA_h0; | |
118 | c->h1=INIT_DATA_h1; | |
119 | c->h2=INIT_DATA_h2; | |
120 | c->h3=INIT_DATA_h3; | |
121 | c->h4=INIT_DATA_h4; | |
122 | c->Nl=0; | |
123 | c->Nh=0; | |
124 | c->num=0; | |
125 | } | |
126 | ||
127 | void SHA1_Update(c, data, len) | |
128 | SHA_CTX *c; | |
129 | register unsigned char *data; | |
130 | unsigned long len; | |
131 | { | |
132 | register ULONG *p; | |
133 | int ew,ec,sw,sc; | |
134 | ULONG l; | |
135 | ||
136 | if (len == 0) return; | |
137 | ||
58964a49 | 138 | l=(c->Nl+(len<<3))&0xffffffffL; |
d02b48c6 RE |
139 | if (l < c->Nl) /* overflow */ |
140 | c->Nh++; | |
141 | c->Nh+=(len>>29); | |
142 | c->Nl=l; | |
143 | ||
144 | if (c->num != 0) | |
145 | { | |
146 | p=c->data; | |
147 | sw=c->num>>2; | |
148 | sc=c->num&0x03; | |
149 | ||
150 | if ((c->num+len) >= SHA_CBLOCK) | |
151 | { | |
152 | l= p[sw]; | |
58964a49 | 153 | M_p_c2nl(data,l,sc); |
d02b48c6 RE |
154 | p[sw++]=l; |
155 | for (; sw<SHA_LBLOCK; sw++) | |
156 | { | |
58964a49 | 157 | M_c2nl(data,l); |
d02b48c6 RE |
158 | p[sw]=l; |
159 | } | |
160 | len-=(SHA_CBLOCK-c->num); | |
161 | ||
58964a49 | 162 | sha1_block(c,p,64); |
d02b48c6 RE |
163 | c->num=0; |
164 | /* drop through and do the rest */ | |
165 | } | |
166 | else | |
167 | { | |
168 | c->num+=(int)len; | |
169 | if ((sc+len) < 4) /* ugly, add char's to a word */ | |
170 | { | |
171 | l= p[sw]; | |
58964a49 | 172 | M_p_c2nl_p(data,l,sc,len); |
d02b48c6 RE |
173 | p[sw]=l; |
174 | } | |
175 | else | |
176 | { | |
177 | ew=(c->num>>2); | |
178 | ec=(c->num&0x03); | |
179 | l= p[sw]; | |
58964a49 | 180 | M_p_c2nl(data,l,sc); |
d02b48c6 RE |
181 | p[sw++]=l; |
182 | for (; sw < ew; sw++) | |
58964a49 | 183 | { M_c2nl(data,l); p[sw]=l; } |
d02b48c6 RE |
184 | if (ec) |
185 | { | |
58964a49 | 186 | M_c2nl_p(data,l,ec); |
d02b48c6 RE |
187 | p[sw]=l; |
188 | } | |
189 | } | |
190 | return; | |
191 | } | |
192 | } | |
58964a49 RE |
193 | /* We can only do the following code for assember, the reason |
194 | * being that the sha1_block 'C' version changes the values | |
195 | * in the 'data' array. The assember code avoids this and | |
196 | * copies it to a local array. I should be able to do this for | |
197 | * the C version as well.... | |
198 | */ | |
199 | #if 1 | |
200 | #if defined(B_ENDIAN) || defined(SHA1_ASM) | |
dfeab068 | 201 | if ((((unsigned long)data)%sizeof(ULONG)) == 0) |
58964a49 RE |
202 | { |
203 | sw=len/SHA_CBLOCK; | |
204 | if (sw) | |
205 | { | |
206 | sw*=SHA_CBLOCK; | |
207 | sha1_block(c,(ULONG *)data,sw); | |
208 | data+=sw; | |
209 | len-=sw; | |
210 | } | |
211 | } | |
212 | #endif | |
213 | #endif | |
d02b48c6 RE |
214 | /* we now can process the input data in blocks of SHA_CBLOCK |
215 | * chars and save the leftovers to c->data. */ | |
216 | p=c->data; | |
217 | while (len >= SHA_CBLOCK) | |
218 | { | |
219 | #if defined(B_ENDIAN) || defined(L_ENDIAN) | |
58964a49 RE |
220 | if (p != (unsigned long *)data) |
221 | memcpy(p,data,SHA_CBLOCK); | |
d02b48c6 | 222 | data+=SHA_CBLOCK; |
58964a49 RE |
223 | # ifdef L_ENDIAN |
224 | # ifndef SHA1_ASM /* Will not happen */ | |
d02b48c6 RE |
225 | for (sw=(SHA_LBLOCK/4); sw; sw--) |
226 | { | |
227 | Endian_Reverse32(p[0]); | |
228 | Endian_Reverse32(p[1]); | |
229 | Endian_Reverse32(p[2]); | |
230 | Endian_Reverse32(p[3]); | |
231 | p+=4; | |
232 | } | |
58964a49 RE |
233 | p=c->data; |
234 | # endif | |
235 | # endif | |
d02b48c6 RE |
236 | #else |
237 | for (sw=(SHA_BLOCK/4); sw; sw--) | |
238 | { | |
58964a49 RE |
239 | M_c2nl(data,l); *(p++)=l; |
240 | M_c2nl(data,l); *(p++)=l; | |
241 | M_c2nl(data,l); *(p++)=l; | |
242 | M_c2nl(data,l); *(p++)=l; | |
d02b48c6 | 243 | } |
d02b48c6 | 244 | p=c->data; |
58964a49 RE |
245 | #endif |
246 | sha1_block(c,p,64); | |
d02b48c6 RE |
247 | len-=SHA_CBLOCK; |
248 | } | |
249 | ec=(int)len; | |
250 | c->num=ec; | |
251 | ew=(ec>>2); | |
252 | ec&=0x03; | |
253 | ||
254 | for (sw=0; sw < ew; sw++) | |
58964a49 RE |
255 | { M_c2nl(data,l); p[sw]=l; } |
256 | M_c2nl_p(data,l,ec); | |
d02b48c6 RE |
257 | p[sw]=l; |
258 | } | |
259 | ||
58964a49 | 260 | void SHA1_Transform(c,b) |
d02b48c6 | 261 | SHA_CTX *c; |
58964a49 RE |
262 | unsigned char *b; |
263 | { | |
264 | ULONG p[16]; | |
265 | #ifndef B_ENDIAN | |
266 | ULONG *q; | |
267 | int i; | |
268 | #endif | |
269 | ||
270 | #if defined(B_ENDIAN) || defined(L_ENDIAN) | |
271 | memcpy(p,b,64); | |
272 | #ifdef L_ENDIAN | |
273 | q=p; | |
274 | for (i=(SHA_LBLOCK/4); i; i--) | |
275 | { | |
276 | Endian_Reverse32(q[0]); | |
277 | Endian_Reverse32(q[1]); | |
278 | Endian_Reverse32(q[2]); | |
279 | Endian_Reverse32(q[3]); | |
280 | q+=4; | |
281 | } | |
282 | #endif | |
283 | #else | |
284 | q=p; | |
285 | for (i=(SHA_LBLOCK/4); i; i--) | |
286 | { | |
287 | ULONG l; | |
288 | c2nl(b,l); *(q++)=l; | |
289 | c2nl(b,l); *(q++)=l; | |
290 | c2nl(b,l); *(q++)=l; | |
291 | c2nl(b,l); *(q++)=l; | |
292 | } | |
293 | #endif | |
294 | sha1_block(c,p,64); | |
295 | } | |
296 | ||
297 | #ifndef SHA1_ASM | |
298 | ||
299 | void sha1_block(c, W, num) | |
300 | SHA_CTX *c; | |
301 | register unsigned long *W; | |
302 | int num; | |
d02b48c6 RE |
303 | { |
304 | register ULONG A,B,C,D,E,T; | |
58964a49 RE |
305 | ULONG X[16]; |
306 | ||
307 | A=c->h0; | |
308 | B=c->h1; | |
309 | C=c->h2; | |
310 | D=c->h3; | |
311 | E=c->h4; | |
312 | ||
313 | for (;;) | |
314 | { | |
315 | BODY_00_15( 0,A,B,C,D,E,T,W); | |
316 | BODY_00_15( 1,T,A,B,C,D,E,W); | |
317 | BODY_00_15( 2,E,T,A,B,C,D,W); | |
318 | BODY_00_15( 3,D,E,T,A,B,C,W); | |
319 | BODY_00_15( 4,C,D,E,T,A,B,W); | |
320 | BODY_00_15( 5,B,C,D,E,T,A,W); | |
321 | BODY_00_15( 6,A,B,C,D,E,T,W); | |
322 | BODY_00_15( 7,T,A,B,C,D,E,W); | |
323 | BODY_00_15( 8,E,T,A,B,C,D,W); | |
324 | BODY_00_15( 9,D,E,T,A,B,C,W); | |
325 | BODY_00_15(10,C,D,E,T,A,B,W); | |
326 | BODY_00_15(11,B,C,D,E,T,A,W); | |
327 | BODY_00_15(12,A,B,C,D,E,T,W); | |
328 | BODY_00_15(13,T,A,B,C,D,E,W); | |
329 | BODY_00_15(14,E,T,A,B,C,D,W); | |
330 | BODY_00_15(15,D,E,T,A,B,C,W); | |
331 | BODY_16_19(16,C,D,E,T,A,B,W,W,W,W); | |
332 | BODY_16_19(17,B,C,D,E,T,A,W,W,W,W); | |
333 | BODY_16_19(18,A,B,C,D,E,T,W,W,W,W); | |
334 | BODY_16_19(19,T,A,B,C,D,E,W,W,W,X); | |
335 | ||
336 | BODY_20_31(20,E,T,A,B,C,D,W,W,W,X); | |
337 | BODY_20_31(21,D,E,T,A,B,C,W,W,W,X); | |
338 | BODY_20_31(22,C,D,E,T,A,B,W,W,W,X); | |
339 | BODY_20_31(23,B,C,D,E,T,A,W,W,W,X); | |
340 | BODY_20_31(24,A,B,C,D,E,T,W,W,X,X); | |
341 | BODY_20_31(25,T,A,B,C,D,E,W,W,X,X); | |
342 | BODY_20_31(26,E,T,A,B,C,D,W,W,X,X); | |
343 | BODY_20_31(27,D,E,T,A,B,C,W,W,X,X); | |
344 | BODY_20_31(28,C,D,E,T,A,B,W,W,X,X); | |
345 | BODY_20_31(29,B,C,D,E,T,A,W,W,X,X); | |
346 | BODY_20_31(30,A,B,C,D,E,T,W,X,X,X); | |
347 | BODY_20_31(31,T,A,B,C,D,E,W,X,X,X); | |
348 | BODY_32_39(32,E,T,A,B,C,D,X); | |
349 | BODY_32_39(33,D,E,T,A,B,C,X); | |
350 | BODY_32_39(34,C,D,E,T,A,B,X); | |
351 | BODY_32_39(35,B,C,D,E,T,A,X); | |
352 | BODY_32_39(36,A,B,C,D,E,T,X); | |
353 | BODY_32_39(37,T,A,B,C,D,E,X); | |
354 | BODY_32_39(38,E,T,A,B,C,D,X); | |
355 | BODY_32_39(39,D,E,T,A,B,C,X); | |
356 | ||
357 | BODY_40_59(40,C,D,E,T,A,B,X); | |
358 | BODY_40_59(41,B,C,D,E,T,A,X); | |
359 | BODY_40_59(42,A,B,C,D,E,T,X); | |
360 | BODY_40_59(43,T,A,B,C,D,E,X); | |
361 | BODY_40_59(44,E,T,A,B,C,D,X); | |
362 | BODY_40_59(45,D,E,T,A,B,C,X); | |
363 | BODY_40_59(46,C,D,E,T,A,B,X); | |
364 | BODY_40_59(47,B,C,D,E,T,A,X); | |
365 | BODY_40_59(48,A,B,C,D,E,T,X); | |
366 | BODY_40_59(49,T,A,B,C,D,E,X); | |
367 | BODY_40_59(50,E,T,A,B,C,D,X); | |
368 | BODY_40_59(51,D,E,T,A,B,C,X); | |
369 | BODY_40_59(52,C,D,E,T,A,B,X); | |
370 | BODY_40_59(53,B,C,D,E,T,A,X); | |
371 | BODY_40_59(54,A,B,C,D,E,T,X); | |
372 | BODY_40_59(55,T,A,B,C,D,E,X); | |
373 | BODY_40_59(56,E,T,A,B,C,D,X); | |
374 | BODY_40_59(57,D,E,T,A,B,C,X); | |
375 | BODY_40_59(58,C,D,E,T,A,B,X); | |
376 | BODY_40_59(59,B,C,D,E,T,A,X); | |
377 | ||
378 | BODY_60_79(60,A,B,C,D,E,T,X); | |
379 | BODY_60_79(61,T,A,B,C,D,E,X); | |
380 | BODY_60_79(62,E,T,A,B,C,D,X); | |
381 | BODY_60_79(63,D,E,T,A,B,C,X); | |
382 | BODY_60_79(64,C,D,E,T,A,B,X); | |
383 | BODY_60_79(65,B,C,D,E,T,A,X); | |
384 | BODY_60_79(66,A,B,C,D,E,T,X); | |
385 | BODY_60_79(67,T,A,B,C,D,E,X); | |
386 | BODY_60_79(68,E,T,A,B,C,D,X); | |
387 | BODY_60_79(69,D,E,T,A,B,C,X); | |
388 | BODY_60_79(70,C,D,E,T,A,B,X); | |
389 | BODY_60_79(71,B,C,D,E,T,A,X); | |
390 | BODY_60_79(72,A,B,C,D,E,T,X); | |
391 | BODY_60_79(73,T,A,B,C,D,E,X); | |
392 | BODY_60_79(74,E,T,A,B,C,D,X); | |
393 | BODY_60_79(75,D,E,T,A,B,C,X); | |
394 | BODY_60_79(76,C,D,E,T,A,B,X); | |
395 | BODY_60_79(77,B,C,D,E,T,A,X); | |
396 | BODY_60_79(78,A,B,C,D,E,T,X); | |
397 | BODY_60_79(79,T,A,B,C,D,E,X); | |
398 | ||
399 | c->h0=(c->h0+E)&0xffffffffL; | |
400 | c->h1=(c->h1+T)&0xffffffffL; | |
401 | c->h2=(c->h2+A)&0xffffffffL; | |
402 | c->h3=(c->h3+B)&0xffffffffL; | |
403 | c->h4=(c->h4+C)&0xffffffffL; | |
404 | ||
405 | num-=64; | |
406 | if (num <= 0) break; | |
d02b48c6 RE |
407 | |
408 | A=c->h0; | |
409 | B=c->h1; | |
410 | C=c->h2; | |
411 | D=c->h3; | |
412 | E=c->h4; | |
413 | ||
58964a49 RE |
414 | W+=16; |
415 | } | |
d02b48c6 | 416 | } |
58964a49 | 417 | #endif |
d02b48c6 RE |
418 | |
419 | void SHA1_Final(md, c) | |
420 | unsigned char *md; | |
421 | SHA_CTX *c; | |
422 | { | |
423 | register int i,j; | |
424 | register ULONG l; | |
425 | register ULONG *p; | |
426 | static unsigned char end[4]={0x80,0x00,0x00,0x00}; | |
427 | unsigned char *cp=end; | |
428 | ||
429 | /* c->num should definitly have room for at least one more byte. */ | |
430 | p=c->data; | |
431 | j=c->num; | |
432 | i=j>>2; | |
433 | #ifdef PURIFY | |
434 | if ((j&0x03) == 0) p[i]=0; | |
435 | #endif | |
436 | l=p[i]; | |
58964a49 | 437 | M_p_c2nl(cp,l,j&0x03); |
d02b48c6 RE |
438 | p[i]=l; |
439 | i++; | |
440 | /* i is the next 'undefined word' */ | |
441 | if (c->num >= SHA_LAST_BLOCK) | |
442 | { | |
443 | for (; i<SHA_LBLOCK; i++) | |
444 | p[i]=0; | |
58964a49 | 445 | sha1_block(c,p,64); |
d02b48c6 RE |
446 | i=0; |
447 | } | |
448 | for (; i<(SHA_LBLOCK-2); i++) | |
449 | p[i]=0; | |
450 | p[SHA_LBLOCK-2]=c->Nh; | |
451 | p[SHA_LBLOCK-1]=c->Nl; | |
58964a49 RE |
452 | #if defined(L_ENDIAN) && defined(SHA1_ASM) |
453 | Endian_Reverse32(p[SHA_LBLOCK-2]); | |
454 | Endian_Reverse32(p[SHA_LBLOCK-1]); | |
455 | #endif | |
456 | sha1_block(c,p,64); | |
d02b48c6 RE |
457 | cp=md; |
458 | l=c->h0; nl2c(l,cp); | |
459 | l=c->h1; nl2c(l,cp); | |
460 | l=c->h2; nl2c(l,cp); | |
461 | l=c->h3; nl2c(l,cp); | |
462 | l=c->h4; nl2c(l,cp); | |
463 | ||
464 | /* clear stuff, sha1_block may be leaving some stuff on the stack | |
465 | * but I'm not worried :-) */ | |
466 | c->num=0; | |
467 | /* memset((char *)&c,0,sizeof(c));*/ | |
468 | } | |
469 |