crypto/libressl/crypto/sha/sha256.c

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