crypto/sha/sha_dgst.c

   1 /* crypto/sha/sha_dgst.c */
   2 /* Copyright (C) 1995-1997 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 #define SHA_0
  61 #undef  SHA_1
  62 #include "sha.h"
  63 #include "sha_locl.h"
  64
  65 char *SHA_version="SHA part of SSLeay 0.8.1b 29-Jun-1998";
  66
  67 /* Implemented from SHA document - The Secure Hash Algorithm
  68  */
  69
  70 #define INIT_DATA_h0 (unsigned long)0x67452301L
  71 #define INIT_DATA_h1 (unsigned long)0xefcdab89L
  72 #define INIT_DATA_h2 (unsigned long)0x98badcfeL
  73 #define INIT_DATA_h3 (unsigned long)0x10325476L
  74 #define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L
  75
  76 #define K_00_19 0x5a827999L
  77 #define K_20_39 0x6ed9eba1L
  78 #define K_40_59 0x8f1bbcdcL
  79 #define K_60_79 0xca62c1d6L
  80
  81 #ifndef NOPROTO
  82 static void sha_block(SHA_CTX *c, register unsigned long *p);
  83 #else
  84 static void sha_block();
  85 #endif
  86
  87 void SHA_Init(c)
  88 SHA_CTX *c;
  89         {
  90         c->h0=INIT_DATA_h0;
  91         c->h1=INIT_DATA_h1;
  92         c->h2=INIT_DATA_h2;
  93         c->h3=INIT_DATA_h3;
  94         c->h4=INIT_DATA_h4;
  95         c->Nl=0;
  96         c->Nh=0;
  97         c->num=0;
  98         }
  99
 100 void SHA_Update(c, data, len)
 101 SHA_CTX *c;
 102 register unsigned char *data;
 103 unsigned long len;
 104         {
 105         register ULONG *p;
 106         int sw,sc,ew,ec;
 107         ULONG l;
 108
 109         if (len == 0) return;
 110
 111         l=(c->Nl+(len<<3))&0xffffffff;
 112         if (l < c->Nl) /* overflow */
 113                 c->Nh++;
 114         c->Nh+=(len>>29);
 115         c->Nl=l;
 116
 117         if (c->num != 0)
 118                 {
 119                 p=c->data;
 120                 sw=c->num>>2;
 121                 sc=c->num&0x03;
 122
 123                 if ((c->num+len) >= SHA_CBLOCK)
 124                         {
 125                         l= p[sw];
 126                         p_c2nl(data,l,sc);
 127                         p[sw++]=l;
 128                         for (; sw<SHA_LBLOCK; sw++)
 129                                 {
 130                                 c2nl(data,l);
 131                                 p[sw]=l;
 132                                 }
 133                         len-=(SHA_CBLOCK-c->num);
 134
 135                         sha_block(c,p);
 136                         c->num=0;
 137                         /* drop through and do the rest */
 138                         }
 139                 else
 140                         {
 141                         c->num+=(int)len;
 142                         if ((sc+len) < 4) /* ugly, add char's to a word */
 143                                 {
 144                                 l= p[sw];
 145                                 p_c2nl_p(data,l,sc,len);
 146                                 p[sw]=l;
 147                                 }
 148                         else
 149                                 {
 150                                 ew=(c->num>>2);
 151                                 ec=(c->num&0x03);
 152                                 l= p[sw];
 153                                 p_c2nl(data,l,sc);
 154                                 p[sw++]=l;
 155                                 for (; sw < ew; sw++)
 156                                         { c2nl(data,l); p[sw]=l; }
 157                                 if (ec)
 158                                         {
 159                                         c2nl_p(data,l,ec);
 160                                         p[sw]=l;
 161                                         }
 162                                 }
 163                         return;
 164                         }
 165                 }
 166         /* we now can process the input data in blocks of SHA_CBLOCK
 167          * chars and save the leftovers to c->data. */
 168         p=c->data;
 169         while (len >= SHA_CBLOCK)
 170                 {
 171 #if defined(B_ENDIAN) || defined(L_ENDIAN)
 172                 memcpy(p,data,SHA_CBLOCK);
 173                 data+=SHA_CBLOCK;
 174 #ifdef L_ENDIAN
 175                 for (sw=(SHA_LBLOCK/4); sw; sw--)
 176                         {
 177                         Endian_Reverse32(p[0]);
 178                         Endian_Reverse32(p[1]);
 179                         Endian_Reverse32(p[2]);
 180                         Endian_Reverse32(p[3]);
 181                         p+=4;
 182                         }
 183 #endif
 184 #else
 185                 for (sw=(SHA_LBLOCK/4); sw; sw--)
 186                         {
 187                         c2nl(data,l); *(p++)=l;
 188                         c2nl(data,l); *(p++)=l;
 189                         c2nl(data,l); *(p++)=l;
 190                         c2nl(data,l); *(p++)=l;
 191                         }
 192 #endif
 193                 p=c->data;
 194                 sha_block(c,p);
 195                 len-=SHA_CBLOCK;
 196                 }
 197         ec=(int)len;
 198         c->num=ec;
 199         ew=(ec>>2);
 200         ec&=0x03;
 201
 202         for (sw=0; sw < ew; sw++)
 203                 { c2nl(data,l); p[sw]=l; }
 204         c2nl_p(data,l,ec);
 205         p[sw]=l;
 206         }
 207
 208 static void sha_block(c, X)
 209 SHA_CTX *c;
 210 register unsigned long *X;
 211         {
 212         register ULONG A,B,C,D,E,T;
 213
 214         A=c->h0;
 215         B=c->h1;
 216         C=c->h2;
 217         D=c->h3;
 218         E=c->h4;
 219
 220         BODY_00_15( 0,A,B,C,D,E,T);
 221         BODY_00_15( 1,T,A,B,C,D,E);
 222         BODY_00_15( 2,E,T,A,B,C,D);
 223         BODY_00_15( 3,D,E,T,A,B,C);
 224         BODY_00_15( 4,C,D,E,T,A,B);
 225         BODY_00_15( 5,B,C,D,E,T,A);
 226         BODY_00_15( 6,A,B,C,D,E,T);
 227         BODY_00_15( 7,T,A,B,C,D,E);
 228         BODY_00_15( 8,E,T,A,B,C,D);
 229         BODY_00_15( 9,D,E,T,A,B,C);
 230         BODY_00_15(10,C,D,E,T,A,B);
 231         BODY_00_15(11,B,C,D,E,T,A);
 232         BODY_00_15(12,A,B,C,D,E,T);
 233         BODY_00_15(13,T,A,B,C,D,E);
 234         BODY_00_15(14,E,T,A,B,C,D);
 235         BODY_00_15(15,D,E,T,A,B,C);
 236         BODY_16_19(16,C,D,E,T,A,B);
 237         BODY_16_19(17,B,C,D,E,T,A);
 238         BODY_16_19(18,A,B,C,D,E,T);
 239         BODY_16_19(19,T,A,B,C,D,E);
 240
 241         BODY_20_39(20,E,T,A,B,C,D);
 242         BODY_20_39(21,D,E,T,A,B,C);
 243         BODY_20_39(22,C,D,E,T,A,B);
 244         BODY_20_39(23,B,C,D,E,T,A);
 245         BODY_20_39(24,A,B,C,D,E,T);
 246         BODY_20_39(25,T,A,B,C,D,E);
 247         BODY_20_39(26,E,T,A,B,C,D);
 248         BODY_20_39(27,D,E,T,A,B,C);
 249         BODY_20_39(28,C,D,E,T,A,B);
 250         BODY_20_39(29,B,C,D,E,T,A);
 251         BODY_20_39(30,A,B,C,D,E,T);
 252         BODY_20_39(31,T,A,B,C,D,E);
 253         BODY_20_39(32,E,T,A,B,C,D);
 254         BODY_20_39(33,D,E,T,A,B,C);
 255         BODY_20_39(34,C,D,E,T,A,B);
 256         BODY_20_39(35,B,C,D,E,T,A);
 257         BODY_20_39(36,A,B,C,D,E,T);
 258         BODY_20_39(37,T,A,B,C,D,E);
 259         BODY_20_39(38,E,T,A,B,C,D);
 260         BODY_20_39(39,D,E,T,A,B,C);
 261
 262         BODY_40_59(40,C,D,E,T,A,B);
 263         BODY_40_59(41,B,C,D,E,T,A);
 264         BODY_40_59(42,A,B,C,D,E,T);
 265         BODY_40_59(43,T,A,B,C,D,E);
 266         BODY_40_59(44,E,T,A,B,C,D);
 267         BODY_40_59(45,D,E,T,A,B,C);
 268         BODY_40_59(46,C,D,E,T,A,B);
 269         BODY_40_59(47,B,C,D,E,T,A);
 270         BODY_40_59(48,A,B,C,D,E,T);
 271         BODY_40_59(49,T,A,B,C,D,E);
 272         BODY_40_59(50,E,T,A,B,C,D);
 273         BODY_40_59(51,D,E,T,A,B,C);
 274         BODY_40_59(52,C,D,E,T,A,B);
 275         BODY_40_59(53,B,C,D,E,T,A);
 276         BODY_40_59(54,A,B,C,D,E,T);
 277         BODY_40_59(55,T,A,B,C,D,E);
 278         BODY_40_59(56,E,T,A,B,C,D);
 279         BODY_40_59(57,D,E,T,A,B,C);
 280         BODY_40_59(58,C,D,E,T,A,B);
 281         BODY_40_59(59,B,C,D,E,T,A);
 282
 283         BODY_60_79(60,A,B,C,D,E,T);
 284         BODY_60_79(61,T,A,B,C,D,E);
 285         BODY_60_79(62,E,T,A,B,C,D);
 286         BODY_60_79(63,D,E,T,A,B,C);
 287         BODY_60_79(64,C,D,E,T,A,B);
 288         BODY_60_79(65,B,C,D,E,T,A);
 289         BODY_60_79(66,A,B,C,D,E,T);
 290         BODY_60_79(67,T,A,B,C,D,E);
 291         BODY_60_79(68,E,T,A,B,C,D);
 292         BODY_60_79(69,D,E,T,A,B,C);
 293         BODY_60_79(70,C,D,E,T,A,B);
 294         BODY_60_79(71,B,C,D,E,T,A);
 295         BODY_60_79(72,A,B,C,D,E,T);
 296         BODY_60_79(73,T,A,B,C,D,E);
 297         BODY_60_79(74,E,T,A,B,C,D);
 298         BODY_60_79(75,D,E,T,A,B,C);
 299         BODY_60_79(76,C,D,E,T,A,B);
 300         BODY_60_79(77,B,C,D,E,T,A);
 301         BODY_60_79(78,A,B,C,D,E,T);
 302         BODY_60_79(79,T,A,B,C,D,E);
 303
 304         c->h0=(c->h0+E)&0xffffffff;
 305         c->h1=(c->h1+T)&0xffffffff;
 306         c->h2=(c->h2+A)&0xffffffff;
 307         c->h3=(c->h3+B)&0xffffffff;
 308         c->h4=(c->h4+C)&0xffffffff;
 309         }
 310
 311 void SHA_Final(md, c)
 312 unsigned char *md;
 313 SHA_CTX *c;
 314         {
 315         register int i,j;
 316         register ULONG l;
 317         register ULONG *p;
 318         static unsigned char end[4]={0x80,0x00,0x00,0x00};
 319         unsigned char *cp=end;
 320
 321         /* c->num should definitly have room for at least one more byte. */
 322         p=c->data;
 323         j=c->num;
 324         i=j>>2;
 325 #ifdef PURIFY
 326         if ((j&0x03) == 0) p[i]=0;
 327 #endif
 328         l=p[i];
 329         p_c2nl(cp,l,j&0x03);
 330         p[i]=l;
 331         i++;
 332         /* i is the next 'undefined word' */
 333         if (c->num >= SHA_LAST_BLOCK)
 334                 {
 335                 for (; i<SHA_LBLOCK; i++)
 336                         p[i]=0;
 337                 sha_block(c,p);
 338                 i=0;
 339                 }
 340         for (; i<(SHA_LBLOCK-2); i++)
 341                 p[i]=0;
 342         p[SHA_LBLOCK-2]=c->Nh;
 343         p[SHA_LBLOCK-1]=c->Nl;
 344         sha_block(c,p);
 345         cp=md;
 346         l=c->h0; nl2c(l,cp);
 347         l=c->h1; nl2c(l,cp);
 348         l=c->h2; nl2c(l,cp);
 349         l=c->h3; nl2c(l,cp);
 350         l=c->h4; nl2c(l,cp);
 351         /* clear stuff, sha_block may be leaving some stuff on the stack
 352          * but I'm not worried :-) */
 353         c->num=0;
 354 /*      memset((char *)&c,0,sizeof(c));*/
 355         }
 356
 357
 358 #ifdef undef
 359 int printit(l)
 360 unsigned long *l;
 361         {
 362         int i,ii;
 363
 364         for (i=0; i<2; i++)
 365                 {
 366                 for (ii=0; ii<8; ii++)
 367                         {
 368                         fprintf(stderr,"%08lx ",l[i*8+ii]);
 369                         }
 370                 fprintf(stderr,"\n");
 371                 }
 372         }
 373 #endif
 374