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