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.]
59 #include <sys/cdefs.h>
60 __FBSDID("$FreeBSD$");
62 #include <sys/types.h>
68 #include <machine/ansi.h> /* we use the __ variants of bit-sized types */
70 #include <machine/endian.h>
77 char *SHA_version="SHA part of SSLeay 0.9.0b 11-Oct-1998";
79 /* Implemented from SHA-0 document - The Secure Hash Algorithm
82 #define INIT_DATA_h0 (unsigned long)0x67452301L
83 #define INIT_DATA_h1 (unsigned long)0xefcdab89L
84 #define INIT_DATA_h2 (unsigned long)0x98badcfeL
85 #define INIT_DATA_h3 (unsigned long)0x10325476L
86 #define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L
88 #define K_00_19 0x5a827999L
89 #define K_20_39 0x6ed9eba1L
90 #define K_40_59 0x8f1bbcdcL
91 #define K_60_79 0xca62c1d6L
94 void sha_block(SHA_CTX *c, const u_int32_t *p, int num);
100 #define M_p_c2nl p_c2nl
101 #define M_c2nl_p c2nl_p
102 #define M_p_c2nl_p p_c2nl_p
118 void SHA_Update(c, in, len)
126 const unsigned char *data = in;
128 if (len == 0) return;
130 l=(c->Nl+(len<<3))&0xffffffffL;
131 if (l < c->Nl) /* overflow */
142 if ((c->num+len) >= SHA_CBLOCK)
147 for (; sw<SHA_LBLOCK; sw++)
152 len-=(SHA_CBLOCK-c->num);
156 /* drop through and do the rest */
161 if ((sc+len) < 4) /* ugly, add char's to a word */
164 M_p_c2nl_p(data,l,sc,len);
174 for (; sw < ew; sw++)
175 { M_c2nl(data,l); p[sw]=l; }
185 /* We can only do the following code for assember, the reason
186 * being that the sha_block 'C' version changes the values
187 * in the 'data' array. The assember code avoids this and
188 * copies it to a local array. I should be able to do this for
189 * the C version as well....
192 #if BYTE_ORDER == BIG_ENDIAN || defined(SHA_ASM)
193 if ((((unsigned int)data)%sizeof(u_int32_t)) == 0)
199 sha_block(c,(u_int32_t *)data,sw);
206 /* we now can process the input data in blocks of SHA_CBLOCK
207 * chars and save the leftovers to c->data. */
209 while (len >= SHA_CBLOCK)
211 #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN
212 if (p != (u_int32_t *)data)
213 memcpy(p,data,SHA_CBLOCK);
215 # if BYTE_ORDER == LITTLE_ENDIAN
216 # ifndef SHA_ASM /* Will not happen */
217 for (sw=(SHA_LBLOCK/4); sw; sw--)
219 Endian_Reverse32(p[0]);
220 Endian_Reverse32(p[1]);
221 Endian_Reverse32(p[2]);
222 Endian_Reverse32(p[3]);
229 for (sw=(SHA_BLOCK/4); sw; sw--)
231 M_c2nl(data,l); *(p++)=l;
232 M_c2nl(data,l); *(p++)=l;
233 M_c2nl(data,l); *(p++)=l;
234 M_c2nl(data,l); *(p++)=l;
246 for (sw=0; sw < ew; sw++)
247 { M_c2nl(data,l); p[sw]=l; }
252 void SHA_Transform(c,b)
257 #if BYTE_ORDER == LITTLE_ENDIAN
262 #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN
264 #if BYTE_ORDER == LITTLE_ENDIAN
266 for (i=(SHA_LBLOCK/4); i; i--)
268 Endian_Reverse32(q[0]);
269 Endian_Reverse32(q[1]);
270 Endian_Reverse32(q[2]);
271 Endian_Reverse32(q[3]);
277 for (i=(SHA_LBLOCK/4); i; i--)
289 void sha_block(c, W, num)
294 u_int32_t A,B,C,D,E,T;
305 BODY_00_15( 0,A,B,C,D,E,T,W);
306 BODY_00_15( 1,T,A,B,C,D,E,W);
307 BODY_00_15( 2,E,T,A,B,C,D,W);
308 BODY_00_15( 3,D,E,T,A,B,C,W);
309 BODY_00_15( 4,C,D,E,T,A,B,W);
310 BODY_00_15( 5,B,C,D,E,T,A,W);
311 BODY_00_15( 6,A,B,C,D,E,T,W);
312 BODY_00_15( 7,T,A,B,C,D,E,W);
313 BODY_00_15( 8,E,T,A,B,C,D,W);
314 BODY_00_15( 9,D,E,T,A,B,C,W);
315 BODY_00_15(10,C,D,E,T,A,B,W);
316 BODY_00_15(11,B,C,D,E,T,A,W);
317 BODY_00_15(12,A,B,C,D,E,T,W);
318 BODY_00_15(13,T,A,B,C,D,E,W);
319 BODY_00_15(14,E,T,A,B,C,D,W);
320 BODY_00_15(15,D,E,T,A,B,C,W);
321 BODY_16_19(16,C,D,E,T,A,B,W,W,W,W);
322 BODY_16_19(17,B,C,D,E,T,A,W,W,W,W);
323 BODY_16_19(18,A,B,C,D,E,T,W,W,W,W);
324 BODY_16_19(19,T,A,B,C,D,E,W,W,W,X);
326 BODY_20_31(20,E,T,A,B,C,D,W,W,W,X);
327 BODY_20_31(21,D,E,T,A,B,C,W,W,W,X);
328 BODY_20_31(22,C,D,E,T,A,B,W,W,W,X);
329 BODY_20_31(23,B,C,D,E,T,A,W,W,W,X);
330 BODY_20_31(24,A,B,C,D,E,T,W,W,X,X);
331 BODY_20_31(25,T,A,B,C,D,E,W,W,X,X);
332 BODY_20_31(26,E,T,A,B,C,D,W,W,X,X);
333 BODY_20_31(27,D,E,T,A,B,C,W,W,X,X);
334 BODY_20_31(28,C,D,E,T,A,B,W,W,X,X);
335 BODY_20_31(29,B,C,D,E,T,A,W,W,X,X);
336 BODY_20_31(30,A,B,C,D,E,T,W,X,X,X);
337 BODY_20_31(31,T,A,B,C,D,E,W,X,X,X);
338 BODY_32_39(32,E,T,A,B,C,D,X);
339 BODY_32_39(33,D,E,T,A,B,C,X);
340 BODY_32_39(34,C,D,E,T,A,B,X);
341 BODY_32_39(35,B,C,D,E,T,A,X);
342 BODY_32_39(36,A,B,C,D,E,T,X);
343 BODY_32_39(37,T,A,B,C,D,E,X);
344 BODY_32_39(38,E,T,A,B,C,D,X);
345 BODY_32_39(39,D,E,T,A,B,C,X);
347 BODY_40_59(40,C,D,E,T,A,B,X);
348 BODY_40_59(41,B,C,D,E,T,A,X);
349 BODY_40_59(42,A,B,C,D,E,T,X);
350 BODY_40_59(43,T,A,B,C,D,E,X);
351 BODY_40_59(44,E,T,A,B,C,D,X);
352 BODY_40_59(45,D,E,T,A,B,C,X);
353 BODY_40_59(46,C,D,E,T,A,B,X);
354 BODY_40_59(47,B,C,D,E,T,A,X);
355 BODY_40_59(48,A,B,C,D,E,T,X);
356 BODY_40_59(49,T,A,B,C,D,E,X);
357 BODY_40_59(50,E,T,A,B,C,D,X);
358 BODY_40_59(51,D,E,T,A,B,C,X);
359 BODY_40_59(52,C,D,E,T,A,B,X);
360 BODY_40_59(53,B,C,D,E,T,A,X);
361 BODY_40_59(54,A,B,C,D,E,T,X);
362 BODY_40_59(55,T,A,B,C,D,E,X);
363 BODY_40_59(56,E,T,A,B,C,D,X);
364 BODY_40_59(57,D,E,T,A,B,C,X);
365 BODY_40_59(58,C,D,E,T,A,B,X);
366 BODY_40_59(59,B,C,D,E,T,A,X);
368 BODY_60_79(60,A,B,C,D,E,T,X);
369 BODY_60_79(61,T,A,B,C,D,E,X);
370 BODY_60_79(62,E,T,A,B,C,D,X);
371 BODY_60_79(63,D,E,T,A,B,C,X);
372 BODY_60_79(64,C,D,E,T,A,B,X);
373 BODY_60_79(65,B,C,D,E,T,A,X);
374 BODY_60_79(66,A,B,C,D,E,T,X);
375 BODY_60_79(67,T,A,B,C,D,E,X);
376 BODY_60_79(68,E,T,A,B,C,D,X);
377 BODY_60_79(69,D,E,T,A,B,C,X);
378 BODY_60_79(70,C,D,E,T,A,B,X);
379 BODY_60_79(71,B,C,D,E,T,A,X);
380 BODY_60_79(72,A,B,C,D,E,T,X);
381 BODY_60_79(73,T,A,B,C,D,E,X);
382 BODY_60_79(74,E,T,A,B,C,D,X);
383 BODY_60_79(75,D,E,T,A,B,C,X);
384 BODY_60_79(76,C,D,E,T,A,B,X);
385 BODY_60_79(77,B,C,D,E,T,A,X);
386 BODY_60_79(78,A,B,C,D,E,T,X);
387 BODY_60_79(79,T,A,B,C,D,E,X);
389 c->h0=(c->h0+E)&0xffffffffL;
390 c->h1=(c->h1+T)&0xffffffffL;
391 c->h2=(c->h2+A)&0xffffffffL;
392 c->h3=(c->h3+B)&0xffffffffL;
393 c->h4=(c->h4+C)&0xffffffffL;
408 void SHA_Final(md, c)
415 static unsigned char end[4]={0x80,0x00,0x00,0x00};
416 unsigned char *cp=end;
418 /* c->num should definitly have room for at least one more byte. */
423 if ((j&0x03) == 0) p[i]=0;
426 M_p_c2nl(cp,l,j&0x03);
429 /* i is the next 'undefined word' */
430 if (c->num >= SHA_LAST_BLOCK)
432 for (; i<SHA_LBLOCK; i++)
437 for (; i<(SHA_LBLOCK-2); i++)
439 p[SHA_LBLOCK-2]=c->Nh;
440 p[SHA_LBLOCK-1]=c->Nl;
449 /* clear stuff, sha_block may be leaving some stuff on the stack
450 * but I'm not worried :-) */
452 /* memset((char *)&c,0,sizeof(c));*/