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