crypto/sha/sha256.c

   1 /* crypto/sha/sha256.c */
   2 /* ====================================================================
   3  * Copyright (c) 2004 The OpenSSL Project.  All rights reserved.
   4  * ====================================================================
   5  */
   6 #include <stdlib.h>
   7 #include <string.h>
   8
   9 #include <openssl/opensslconf.h>
  10 #include <openssl/crypto.h>
  11 #include <openssl/sha.h>
  12 #include <openssl/opensslv.h>
  13
  14 const char *SHA256_version="SHA-256" OPENSSL_VERSION_PTEXT;
  15
  16 int SHA224_Init (SHA256_CTX *c)
  17         {
  18         c->h[0]=0xc1059ed8UL;   c->h[1]=0x367cd507UL;
  19         c->h[2]=0x3070dd17UL;   c->h[3]=0xf70e5939UL;
  20         c->h[4]=0xffc00b31UL;   c->h[5]=0x68581511UL;
  21         c->h[6]=0x64f98fa7UL;   c->h[7]=0xbefa4fa4UL;
  22         c->Nl=0;        c->Nh=0;
  23         c->num=0;
  24         return 1;
  25         }
  26
  27 int SHA256_Init (SHA256_CTX *c)
  28         {
  29         c->h[0]=0x6a09e667UL;   c->h[1]=0xbb67ae85UL;
  30         c->h[2]=0x3c6ef372UL;   c->h[3]=0xa54ff53aUL;
  31         c->h[4]=0x510e527fUL;   c->h[5]=0x9b05688cUL;
  32         c->h[6]=0x1f83d9abUL;   c->h[7]=0x5be0cd19UL;
  33         c->Nl=0;        c->Nh=0;
  34         c->num=0;
  35         return 1;
  36         }
  37
  38 unsigned char *SHA224(const unsigned char *d, size_t n, unsigned char *md)
  39         {
  40         SHA256_CTX c;
  41         static unsigned char m[SHA256_DIGEST_LENGTH];
  42
  43         SHA224_Init(&c);
  44         SHA256_Update(&c,d,n);
  45         SHA256_Final(m,&c);
  46         if (md != NULL) memcpy (md,m,SHA224_DIGEST_LENGTH),
  47                         memset (m,0,sizeof(m));
  48         else            md=m,
  49                         memset (m+SHA224_DIGEST_LENGTH,0,sizeof(m)-SHA256_DIGEST_LENGTH);
  50         OPENSSL_cleanse(&c,sizeof(c));
  51         return(md);
  52         }
  53
  54 unsigned char *SHA256(const unsigned char *d, size_t n, unsigned char *md)
  55         {
  56         SHA256_CTX c;
  57         static unsigned char m[SHA256_DIGEST_LENGTH];
  58
  59         if (md == NULL) md=m;
  60         SHA256_Init(&c);
  61         SHA256_Update(&c,d,n);
  62         SHA256_Final(md,&c);
  63         OPENSSL_cleanse(&c,sizeof(c));
  64         return(md);
  65         }
  66
  67 #ifndef SHA_LONG_LOG2
  68 #define SHA_LONG_LOG2   2       /* default to 32 bits */
  69 #endif
  70
  71 #define DATA_ORDER_IS_BIG_ENDIAN
  72
  73 #define HASH_LONG               SHA_LONG
  74 #define HASH_LONG_LOG2          SHA_LONG_LOG2
  75 #define HASH_CTX                SHA256_CTX
  76 #define HASH_CBLOCK             SHA_CBLOCK
  77 #define HASH_LBLOCK             SHA_LBLOCK
  78 #define HASH_MAKE_STRING(c,s)   do {    \
  79         unsigned long ll;               \
  80         ll=(c)->h[0]; HOST_l2c(ll,(s)); ll=(c)->h[1]; HOST_l2c(ll,(s)); \
  81         ll=(c)->h[2]; HOST_l2c(ll,(s)); ll=(c)->h[3]; HOST_l2c(ll,(s)); \
  82         ll=(c)->h[4]; HOST_l2c(ll,(s)); ll=(c)->h[5]; HOST_l2c(ll,(s)); \
  83         ll=(c)->h[6]; HOST_l2c(ll,(s)); ll=(c)->h[7]; HOST_l2c(ll,(s)); \
  84         } while (0)
  85
  86 #define HASH_UPDATE             SHA256_Update
  87 #define HASH_TRANSFORM          SHA256_Transform
  88 #define HASH_FINAL              SHA256_Final
  89 #define HASH_BLOCK_HOST_ORDER   sha256_block_host_order
  90 #define HASH_BLOCK_DATA_ORDER   sha256_block_data_order
  91 void sha256_block_host_order (SHA256_CTX *ctx, const void *in, size_t num);
  92 void sha256_block_data_order (SHA256_CTX *ctx, const void *in, size_t num);
  93
  94 #include "md32_common.h"
  95
  96 static const SHA_LONG K256[64] = {
  97         0x428a2f98UL,0x71374491UL,0xb5c0fbcfUL,0xe9b5dba5UL,
  98         0x3956c25bUL,0x59f111f1UL,0x923f82a4UL,0xab1c5ed5UL,
  99         0xd807aa98UL,0x12835b01UL,0x243185beUL,0x550c7dc3UL,
 100         0x72be5d74UL,0x80deb1feUL,0x9bdc06a7UL,0xc19bf174UL,
 101         0xe49b69c1UL,0xefbe4786UL,0x0fc19dc6UL,0x240ca1ccUL,
 102         0x2de92c6fUL,0x4a7484aaUL,0x5cb0a9dcUL,0x76f988daUL,
 103         0x983e5152UL,0xa831c66dUL,0xb00327c8UL,0xbf597fc7UL,
 104         0xc6e00bf3UL,0xd5a79147UL,0x06ca6351UL,0x14292967UL,
 105         0x27b70a85UL,0x2e1b2138UL,0x4d2c6dfcUL,0x53380d13UL,
 106         0x650a7354UL,0x766a0abbUL,0x81c2c92eUL,0x92722c85UL,
 107         0xa2bfe8a1UL,0xa81a664bUL,0xc24b8b70UL,0xc76c51a3UL,
 108         0xd192e819UL,0xd6990624UL,0xf40e3585UL,0x106aa070UL,
 109         0x19a4c116UL,0x1e376c08UL,0x2748774cUL,0x34b0bcb5UL,
 110         0x391c0cb3UL,0x4ed8aa4aUL,0x5b9cca4fUL,0x682e6ff3UL,
 111         0x748f82eeUL,0x78a5636fUL,0x84c87814UL,0x8cc70208UL,
 112         0x90befffaUL,0xa4506cebUL,0xbef9a3f7UL,0xc67178f2UL };
 113
 114 /*
 115  * FIPS specification refers to right rotations, while our ROTATE macro
 116  * is left one. This is why you might notice that rotation coefficients
 117  * differ from those observed in FIPS document by 32-N...
 118  */
 119 #define Sigma0(x)       (ROTATE((x),30) ^ ROTATE((x),19) ^ ROTATE((x),10))
 120 #define Sigma1(x)       (ROTATE((x),26) ^ ROTATE((x),21) ^ ROTATE((x),7))
 121 #define sigma0(x)       (ROTATE((x),25) ^ ROTATE((x),14) ^ ((x)>>3))
 122 #define sigma1(x)       (ROTATE((x),15) ^ ROTATE((x),13) ^ ((x)>>10))
 123
 124 #define Ch(x,y,z)       (((x) & (y)) ^ ((~(x)) & (z)))
 125 #define Maj(x,y,z)      (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
 126
 127 #ifdef OPENSSL_SMALL_FOOTPRINT
 128
 129 static void sha256_block (SHA256_CTX *ctx, const void *in, size_t num, int host)
 130         {
 131         unsigned MD32_REG_T a,b,c,d,e,f,g,h,s0,s1,T1,T2;
 132         SHA_LONG        X[16];
 133         int i;
 134
 135                         while (num--) {
 136
 137         a = ctx->h[0];  b = ctx->h[1];  c = ctx->h[2];  d = ctx->h[3];
 138         e = ctx->h[4];  f = ctx->h[5];  g = ctx->h[6];  h = ctx->h[7];
 139
 140         if (host)
 141                 {
 142                 const SHA_LONG *W=in;
 143
 144                 for (i=0;i<16;i++)
 145                         {
 146                         T1 = X[i] = W[i];
 147                         T1 += h + Sigma1(e) + Ch(e,f,g) + K256[i];
 148                         T2 = Sigma0(a) + Maj(a,b,c);
 149                         h = g;  g = f;  f = e;  e = d + T1;
 150                         d = c;  c = b;  b = a;  a = T1 + T2;
 151                         }
 152                 }
 153         else
 154                 {
 155                 const unsigned char *data=in;
 156                 SHA_LONG l;
 157
 158                 for (i=0;i<16;i++)
 159                         {
 160                         HOST_c2l(data,l); T1 = X[i] = l;
 161                         T1 += h + Sigma1(e) + Ch(e,f,g) + K256[i];
 162                         T2 = Sigma0(a) + Maj(a,b,c);
 163                         h = g;  g = f;  f = e;  e = d + T1;
 164                         d = c;  c = b;  b = a;  a = T1 + T2;
 165                         }
 166                 }
 167
 168         for (;i<64;i++)
 169                 {
 170                 s0 = X[(i+1)&0x0f];     s0 = sigma0(s0);
 171                 s1 = X[(i+14)&0x0f];    s1 = sigma1(s1);
 172
 173                 T1 = X[i&0xf] += s0 + s1 + X[(i+9)&0xf];
 174                 T1 += h + Sigma1(e) + Ch(e,f,g) + K256[i];
 175                 T2 = Sigma0(a) + Maj(a,b,c);
 176                 h = g;  g = f;  f = e;  e = d + T1;
 177                 d = c;  c = b;  b = a;  a = T1 + T2;
 178                 }
 179
 180         ctx->h[0] += a; ctx->h[1] += b; ctx->h[2] += c; ctx->h[3] += d;
 181         ctx->h[4] += e; ctx->h[5] += f; ctx->h[6] += g; ctx->h[7] += h;
 182
 183                         }
 184 }
 185
 186 #else
 187
 188 #define ROUND_00_15(i,a,b,c,d,e,f,g,h)          do {    \
 189         T1 += h + Sigma1(e) + Ch(e,f,g) + K256[i];      \
 190         h = Sigma0(a) + Maj(a,b,c);                     \
 191         d += T1;        h += T1;                } while (0)
 192
 193 #define ROUND_16_63(i,a,b,c,d,e,f,g,h,X)        do {    \
 194         s0 = X[(i+1)&0x0f];     s0 = sigma0(s0);        \
 195         s1 = X[(i+14)&0x0f];    s1 = sigma1(s1);        \
 196         T1 = X[i&0x0f] += s0 + s1 + X[(i+9)&0x0f];      \
 197         ROUND_00_15(i,a,b,c,d,e,f,g,h);         } while (0)
 198
 199 static void sha256_block (SHA256_CTX *ctx, const void *in, size_t num, int host)
 200         {
 201         unsigned MD32_REG_T a,b,c,d,e,f,g,h,s0,s1,T1;
 202         SHA_LONG        X[16];
 203         int i;
 204
 205                         while (num--) {
 206
 207         a = ctx->h[0];  b = ctx->h[1];  c = ctx->h[2];  d = ctx->h[3];
 208         e = ctx->h[4];  f = ctx->h[5];  g = ctx->h[6];  h = ctx->h[7];
 209
 210         if (host)
 211                 {
 212                 const SHA_LONG *W=in;
 213
 214                 T1 = X[0] = W[0];       ROUND_00_15(0,a,b,c,d,e,f,g,h);
 215                 T1 = X[1] = W[1];       ROUND_00_15(1,h,a,b,c,d,e,f,g);
 216                 T1 = X[2] = W[2];       ROUND_00_15(2,g,h,a,b,c,d,e,f);
 217                 T1 = X[3] = W[3];       ROUND_00_15(3,f,g,h,a,b,c,d,e);
 218                 T1 = X[4] = W[4];       ROUND_00_15(4,e,f,g,h,a,b,c,d);
 219                 T1 = X[5] = W[5];       ROUND_00_15(5,d,e,f,g,h,a,b,c);
 220                 T1 = X[6] = W[6];       ROUND_00_15(6,c,d,e,f,g,h,a,b);
 221                 T1 = X[7] = W[7];       ROUND_00_15(7,b,c,d,e,f,g,h,a);
 222                 T1 = X[8] = W[8];       ROUND_00_15(8,a,b,c,d,e,f,g,h);
 223                 T1 = X[9] = W[9];       ROUND_00_15(9,h,a,b,c,d,e,f,g);
 224                 T1 = X[10] = W[10];     ROUND_00_15(10,g,h,a,b,c,d,e,f);
 225                 T1 = X[11] = W[11];     ROUND_00_15(11,f,g,h,a,b,c,d,e);
 226                 T1 = X[12] = W[12];     ROUND_00_15(12,e,f,g,h,a,b,c,d);
 227                 T1 = X[13] = W[13];     ROUND_00_15(13,d,e,f,g,h,a,b,c);
 228                 T1 = X[14] = W[14];     ROUND_00_15(14,c,d,e,f,g,h,a,b);
 229                 T1 = X[15] = W[15];     ROUND_00_15(15,b,c,d,e,f,g,h,a);
 230                 }
 231         else
 232                 {
 233                 const unsigned char *data=in;
 234                 SHA_LONG l;
 235
 236                 HOST_c2l(data,l); T1 = X[0] = l;  ROUND_00_15(0,a,b,c,d,e,f,g,h);
 237                 HOST_c2l(data,l); T1 = X[1] = l;  ROUND_00_15(1,h,a,b,c,d,e,f,g);
 238                 HOST_c2l(data,l); T1 = X[2] = l;  ROUND_00_15(2,g,h,a,b,c,d,e,f);
 239                 HOST_c2l(data,l); T1 = X[3] = l;  ROUND_00_15(3,f,g,h,a,b,c,d,e);
 240                 HOST_c2l(data,l); T1 = X[4] = l;  ROUND_00_15(4,e,f,g,h,a,b,c,d);
 241                 HOST_c2l(data,l); T1 = X[5] = l;  ROUND_00_15(5,d,e,f,g,h,a,b,c);
 242                 HOST_c2l(data,l); T1 = X[6] = l;  ROUND_00_15(6,c,d,e,f,g,h,a,b);
 243                 HOST_c2l(data,l); T1 = X[7] = l;  ROUND_00_15(7,b,c,d,e,f,g,h,a);
 244                 HOST_c2l(data,l); T1 = X[8] = l;  ROUND_00_15(8,a,b,c,d,e,f,g,h);
 245                 HOST_c2l(data,l); T1 = X[9] = l;  ROUND_00_15(9,h,a,b,c,d,e,f,g);
 246                 HOST_c2l(data,l); T1 = X[10] = l; ROUND_00_15(10,g,h,a,b,c,d,e,f);
 247                 HOST_c2l(data,l); T1 = X[11] = l; ROUND_00_15(11,f,g,h,a,b,c,d,e);
 248                 HOST_c2l(data,l); T1 = X[12] = l; ROUND_00_15(12,e,f,g,h,a,b,c,d);
 249                 HOST_c2l(data,l); T1 = X[13] = l; ROUND_00_15(13,d,e,f,g,h,a,b,c);
 250                 HOST_c2l(data,l); T1 = X[14] = l; ROUND_00_15(14,c,d,e,f,g,h,a,b);
 251                 HOST_c2l(data,l); T1 = X[15] = l; ROUND_00_15(15,b,c,d,e,f,g,h,a);
 252                 }
 253
 254         for (i=16;i<64;i+=8)
 255                 {
 256                 ROUND_16_63(i+0,a,b,c,d,e,f,g,h,X);
 257                 ROUND_16_63(i+1,h,a,b,c,d,e,f,g,X);
 258                 ROUND_16_63(i+2,g,h,a,b,c,d,e,f,X);
 259                 ROUND_16_63(i+3,f,g,h,a,b,c,d,e,X);
 260                 ROUND_16_63(i+4,e,f,g,h,a,b,c,d,X);
 261                 ROUND_16_63(i+5,d,e,f,g,h,a,b,c,X);
 262                 ROUND_16_63(i+6,c,d,e,f,g,h,a,b,X);
 263                 ROUND_16_63(i+7,b,c,d,e,f,g,h,a,X);
 264                 }
 265
 266         ctx->h[0] += a; ctx->h[1] += b; ctx->h[2] += c; ctx->h[3] += d;
 267         ctx->h[4] += e; ctx->h[5] += f; ctx->h[6] += g; ctx->h[7] += h;
 268
 269                         }
 270         }
 271
 272 #endif
 273
 274 /*
 275  * Idea is to trade couple of cycles for some space. On IA-32 we save
 276  * about 4K in "big footprint" case. In "small footprint" case any gain
 277  * is appreciated:-)
 278  */
 279 void HASH_BLOCK_HOST_ORDER (SHA256_CTX *ctx, const void *in, size_t num)
 280 {   sha256_block (ctx,in,num,1);   }
 281
 282 void HASH_BLOCK_DATA_ORDER (SHA256_CTX *ctx, const void *in, size_t num)
 283 {   sha256_block (ctx,in,num,0);   }