1 /* crypto/sha/sha_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.]
63 #include <openssl/sha.h>
65 #include <openssl/opensslv.h>
68 char *SHA_version="SHA" OPENSSL_VERSION_PTEXT;
70 /* Implemented from SHA-0 document - The Secure Hash Algorithm
73 #define INIT_DATA_h0 0x67452301UL
74 #define INIT_DATA_h1 0xefcdab89UL
75 #define INIT_DATA_h2 0x98badcfeUL
76 #define INIT_DATA_h3 0x10325476UL
77 #define INIT_DATA_h4 0xc3d2e1f0UL
79 #define K_00_19 0x5a827999UL
80 #define K_20_39 0x6ed9eba1UL
81 #define K_40_59 0x8f1bbcdcUL
82 #define K_60_79 0xca62c1d6UL
84 void sha_block(SHA_CTX *c, register SHA_LONG *p, int num);
86 #define M_p_c2nl p_c2nl
87 #define M_c2nl_p c2nl_p
88 #define M_p_c2nl_p p_c2nl_p
91 void SHA_Init(SHA_CTX *c)
103 void SHA_Update(SHA_CTX *c, register unsigned char *data, unsigned long len)
105 register SHA_LONG *p;
109 if (len == 0) return;
111 l=(c->Nl+(len<<3))&0xffffffffL;
112 if (l < c->Nl) /* overflow */
123 if ((c->num+len) >= SHA_CBLOCK)
128 for (; sw<SHA_LBLOCK; sw++)
133 len-=(SHA_CBLOCK-c->num);
137 /* drop through and do the rest */
142 if ((sc+len) < 4) /* ugly, add char's to a word */
145 M_p_c2nl_p(data,l,sc,len);
155 for (; sw < ew; sw++)
156 { M_c2nl(data,l); p[sw]=l; }
166 /* We can only do the following code for assember, the reason
167 * being that the sha_block 'C' version changes the values
168 * in the 'data' array. The assember code avoids this and
169 * copies it to a local array. I should be able to do this for
170 * the C version as well....
173 #if defined(B_ENDIAN) || defined(SHA_ASM)
174 if ((((unsigned long)data)%sizeof(SHA_LONG)) == 0)
180 sha_block(c,(SHA_LONG *)data,sw);
187 /* we now can process the input data in blocks of SHA_CBLOCK
188 * chars and save the leftovers to c->data. */
190 while (len >= SHA_CBLOCK)
192 #if defined(B_ENDIAN) || defined(L_ENDIAN)
193 if (p != (SHA_LONG *)data)
194 memcpy(p,data,SHA_CBLOCK);
197 # ifndef SHA_ASM /* Will not happen */
198 for (sw=(SHA_LBLOCK/4); sw; sw--)
200 Endian_Reverse32(p[0]);
201 Endian_Reverse32(p[1]);
202 Endian_Reverse32(p[2]);
203 Endian_Reverse32(p[3]);
210 for (sw=(SHA_BLOCK/4); sw; sw--)
212 M_c2nl(data,l); *(p++)=l;
213 M_c2nl(data,l); *(p++)=l;
214 M_c2nl(data,l); *(p++)=l;
215 M_c2nl(data,l); *(p++)=l;
227 for (sw=0; sw < ew; sw++)
228 { M_c2nl(data,l); p[sw]=l; }
233 void SHA_Transform(SHA_CTX *c, unsigned char *b)
236 #if !defined(B_ENDIAN)
241 #if defined(B_ENDIAN) || defined(L_ENDIAN)
245 for (i=(SHA_LBLOCK/4); i; i--)
247 Endian_Reverse32(q[0]);
248 Endian_Reverse32(q[1]);
249 Endian_Reverse32(q[2]);
250 Endian_Reverse32(q[3]);
256 for (i=(SHA_LBLOCK/4); i; i--)
268 void sha_block(SHA_CTX *c, register SHA_LONG *W, int num)
270 register SHA_LONG A,B,C,D,E,T;
281 BODY_00_15( 0,A,B,C,D,E,T,W);
282 BODY_00_15( 1,T,A,B,C,D,E,W);
283 BODY_00_15( 2,E,T,A,B,C,D,W);
284 BODY_00_15( 3,D,E,T,A,B,C,W);
285 BODY_00_15( 4,C,D,E,T,A,B,W);
286 BODY_00_15( 5,B,C,D,E,T,A,W);
287 BODY_00_15( 6,A,B,C,D,E,T,W);
288 BODY_00_15( 7,T,A,B,C,D,E,W);
289 BODY_00_15( 8,E,T,A,B,C,D,W);
290 BODY_00_15( 9,D,E,T,A,B,C,W);
291 BODY_00_15(10,C,D,E,T,A,B,W);
292 BODY_00_15(11,B,C,D,E,T,A,W);
293 BODY_00_15(12,A,B,C,D,E,T,W);
294 BODY_00_15(13,T,A,B,C,D,E,W);
295 BODY_00_15(14,E,T,A,B,C,D,W);
296 BODY_00_15(15,D,E,T,A,B,C,W);
297 BODY_16_19(16,C,D,E,T,A,B,W,W,W,W);
298 BODY_16_19(17,B,C,D,E,T,A,W,W,W,W);
299 BODY_16_19(18,A,B,C,D,E,T,W,W,W,W);
300 BODY_16_19(19,T,A,B,C,D,E,W,W,W,X);
302 BODY_20_31(20,E,T,A,B,C,D,W,W,W,X);
303 BODY_20_31(21,D,E,T,A,B,C,W,W,W,X);
304 BODY_20_31(22,C,D,E,T,A,B,W,W,W,X);
305 BODY_20_31(23,B,C,D,E,T,A,W,W,W,X);
306 BODY_20_31(24,A,B,C,D,E,T,W,W,X,X);
307 BODY_20_31(25,T,A,B,C,D,E,W,W,X,X);
308 BODY_20_31(26,E,T,A,B,C,D,W,W,X,X);
309 BODY_20_31(27,D,E,T,A,B,C,W,W,X,X);
310 BODY_20_31(28,C,D,E,T,A,B,W,W,X,X);
311 BODY_20_31(29,B,C,D,E,T,A,W,W,X,X);
312 BODY_20_31(30,A,B,C,D,E,T,W,X,X,X);
313 BODY_20_31(31,T,A,B,C,D,E,W,X,X,X);
314 BODY_32_39(32,E,T,A,B,C,D,X);
315 BODY_32_39(33,D,E,T,A,B,C,X);
316 BODY_32_39(34,C,D,E,T,A,B,X);
317 BODY_32_39(35,B,C,D,E,T,A,X);
318 BODY_32_39(36,A,B,C,D,E,T,X);
319 BODY_32_39(37,T,A,B,C,D,E,X);
320 BODY_32_39(38,E,T,A,B,C,D,X);
321 BODY_32_39(39,D,E,T,A,B,C,X);
323 BODY_40_59(40,C,D,E,T,A,B,X);
324 BODY_40_59(41,B,C,D,E,T,A,X);
325 BODY_40_59(42,A,B,C,D,E,T,X);
326 BODY_40_59(43,T,A,B,C,D,E,X);
327 BODY_40_59(44,E,T,A,B,C,D,X);
328 BODY_40_59(45,D,E,T,A,B,C,X);
329 BODY_40_59(46,C,D,E,T,A,B,X);
330 BODY_40_59(47,B,C,D,E,T,A,X);
331 BODY_40_59(48,A,B,C,D,E,T,X);
332 BODY_40_59(49,T,A,B,C,D,E,X);
333 BODY_40_59(50,E,T,A,B,C,D,X);
334 BODY_40_59(51,D,E,T,A,B,C,X);
335 BODY_40_59(52,C,D,E,T,A,B,X);
336 BODY_40_59(53,B,C,D,E,T,A,X);
337 BODY_40_59(54,A,B,C,D,E,T,X);
338 BODY_40_59(55,T,A,B,C,D,E,X);
339 BODY_40_59(56,E,T,A,B,C,D,X);
340 BODY_40_59(57,D,E,T,A,B,C,X);
341 BODY_40_59(58,C,D,E,T,A,B,X);
342 BODY_40_59(59,B,C,D,E,T,A,X);
344 BODY_60_79(60,A,B,C,D,E,T,X);
345 BODY_60_79(61,T,A,B,C,D,E,X);
346 BODY_60_79(62,E,T,A,B,C,D,X);
347 BODY_60_79(63,D,E,T,A,B,C,X);
348 BODY_60_79(64,C,D,E,T,A,B,X);
349 BODY_60_79(65,B,C,D,E,T,A,X);
350 BODY_60_79(66,A,B,C,D,E,T,X);
351 BODY_60_79(67,T,A,B,C,D,E,X);
352 BODY_60_79(68,E,T,A,B,C,D,X);
353 BODY_60_79(69,D,E,T,A,B,C,X);
354 BODY_60_79(70,C,D,E,T,A,B,X);
355 BODY_60_79(71,B,C,D,E,T,A,X);
356 BODY_60_79(72,A,B,C,D,E,T,X);
357 BODY_60_79(73,T,A,B,C,D,E,X);
358 BODY_60_79(74,E,T,A,B,C,D,X);
359 BODY_60_79(75,D,E,T,A,B,C,X);
360 BODY_60_79(76,C,D,E,T,A,B,X);
361 BODY_60_79(77,B,C,D,E,T,A,X);
362 BODY_60_79(78,A,B,C,D,E,T,X);
363 BODY_60_79(79,T,A,B,C,D,E,X);
365 c->h0=(c->h0+E)&0xffffffffL;
366 c->h1=(c->h1+T)&0xffffffffL;
367 c->h2=(c->h2+A)&0xffffffffL;
368 c->h3=(c->h3+B)&0xffffffffL;
369 c->h4=(c->h4+C)&0xffffffffL;
384 void SHA_Final(unsigned char *md, SHA_CTX *c)
388 register SHA_LONG *p;
389 static unsigned char end[4]={0x80,0x00,0x00,0x00};
390 unsigned char *cp=end;
392 /* c->num should definitly have room for at least one more byte. */
397 if ((j&0x03) == 0) p[i]=0;
400 M_p_c2nl(cp,l,j&0x03);
403 /* i is the next 'undefined word' */
404 if (c->num >= SHA_LAST_BLOCK)
406 for (; i<SHA_LBLOCK; i++)
411 for (; i<(SHA_LBLOCK-2); i++)
413 p[SHA_LBLOCK-2]=c->Nh;
414 p[SHA_LBLOCK-1]=c->Nl;
423 /* clear stuff, sha_block may be leaving some stuff on the stack
424 * but I'm not worried :-) */
426 /* memset((char *)&c,0,sizeof(c));*/