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