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