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