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