2 * Copyright 2004-2020 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the Apache License 2.0 (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
11 * SHA256 low level APIs are deprecated for public use, but still ok for
14 #include "internal/deprecated.h"
16 #include <openssl/opensslconf.h>
21 #include <openssl/crypto.h>
22 #include <openssl/sha.h>
23 #include <openssl/opensslv.h>
24 #include "internal/endian.h"
26 int SHA224_Init(SHA256_CTX *c)
28 memset(c, 0, sizeof(*c));
29 c->h[0] = 0xc1059ed8UL;
30 c->h[1] = 0x367cd507UL;
31 c->h[2] = 0x3070dd17UL;
32 c->h[3] = 0xf70e5939UL;
33 c->h[4] = 0xffc00b31UL;
34 c->h[5] = 0x68581511UL;
35 c->h[6] = 0x64f98fa7UL;
36 c->h[7] = 0xbefa4fa4UL;
37 c->md_len = SHA224_DIGEST_LENGTH;
41 int SHA256_Init(SHA256_CTX *c)
43 memset(c, 0, sizeof(*c));
44 c->h[0] = 0x6a09e667UL;
45 c->h[1] = 0xbb67ae85UL;
46 c->h[2] = 0x3c6ef372UL;
47 c->h[3] = 0xa54ff53aUL;
48 c->h[4] = 0x510e527fUL;
49 c->h[5] = 0x9b05688cUL;
50 c->h[6] = 0x1f83d9abUL;
51 c->h[7] = 0x5be0cd19UL;
52 c->md_len = SHA256_DIGEST_LENGTH;
56 int SHA224_Update(SHA256_CTX *c, const void *data, size_t len)
58 return SHA256_Update(c, data, len);
61 int SHA224_Final(unsigned char *md, SHA256_CTX *c)
63 return SHA256_Final(md, c);
66 #define DATA_ORDER_IS_BIG_ENDIAN
68 #define HASH_LONG SHA_LONG
69 #define HASH_CTX SHA256_CTX
70 #define HASH_CBLOCK SHA_CBLOCK
73 * Note that FIPS180-2 discusses "Truncation of the Hash Function Output."
74 * default: case below covers for it. It's not clear however if it's
75 * permitted to truncate to amount of bytes not divisible by 4. I bet not,
76 * but if it is, then default: case shall be extended. For reference.
77 * Idea behind separate cases for pre-defined lengths is to let the
78 * compiler decide if it's appropriate to unroll small loops.
80 #define HASH_MAKE_STRING(c,s) do { \
83 switch ((c)->md_len) \
84 { case SHA224_DIGEST_LENGTH: \
85 for (nn=0;nn<SHA224_DIGEST_LENGTH/4;nn++) \
86 { ll=(c)->h[nn]; (void)HOST_l2c(ll,(s)); } \
88 case SHA256_DIGEST_LENGTH: \
89 for (nn=0;nn<SHA256_DIGEST_LENGTH/4;nn++) \
90 { ll=(c)->h[nn]; (void)HOST_l2c(ll,(s)); } \
93 if ((c)->md_len > SHA256_DIGEST_LENGTH) \
95 for (nn=0;nn<(c)->md_len/4;nn++) \
96 { ll=(c)->h[nn]; (void)HOST_l2c(ll,(s)); } \
101 #define HASH_UPDATE SHA256_Update
102 #define HASH_TRANSFORM SHA256_Transform
103 #define HASH_FINAL SHA256_Final
104 #define HASH_BLOCK_DATA_ORDER sha256_block_data_order
108 void sha256_block_data_order(SHA256_CTX *ctx, const void *in, size_t num);
110 #include "crypto/md32_common.h"
113 static const SHA_LONG K256[64] = {
114 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL,
115 0x3956c25bUL, 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL,
116 0xd807aa98UL, 0x12835b01UL, 0x243185beUL, 0x550c7dc3UL,
117 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL, 0xc19bf174UL,
118 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL,
119 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL,
120 0x983e5152UL, 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL,
121 0xc6e00bf3UL, 0xd5a79147UL, 0x06ca6351UL, 0x14292967UL,
122 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL, 0x53380d13UL,
123 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL,
124 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL,
125 0xd192e819UL, 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL,
126 0x19a4c116UL, 0x1e376c08UL, 0x2748774cUL, 0x34b0bcb5UL,
127 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL, 0x682e6ff3UL,
128 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL,
129 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL
133 * FIPS specification refers to right rotations, while our ROTATE macro
134 * is left one. This is why you might notice that rotation coefficients
135 * differ from those observed in FIPS document by 32-N...
137 # define Sigma0(x) (ROTATE((x),30) ^ ROTATE((x),19) ^ ROTATE((x),10))
138 # define Sigma1(x) (ROTATE((x),26) ^ ROTATE((x),21) ^ ROTATE((x),7))
139 # define sigma0(x) (ROTATE((x),25) ^ ROTATE((x),14) ^ ((x)>>3))
140 # define sigma1(x) (ROTATE((x),15) ^ ROTATE((x),13) ^ ((x)>>10))
142 # define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
143 # define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
145 # ifdef OPENSSL_SMALL_FOOTPRINT
147 static void sha256_block_data_order(SHA256_CTX *ctx, const void *in,
150 unsigned MD32_REG_T a, b, c, d, e, f, g, h, s0, s1, T1, T2;
153 const unsigned char *data = in;
166 for (i = 0; i < 16; i++) {
167 (void)HOST_c2l(data, l);
169 T1 += h + Sigma1(e) + Ch(e, f, g) + K256[i];
170 T2 = Sigma0(a) + Maj(a, b, c);
181 for (; i < 64; i++) {
182 s0 = X[(i + 1) & 0x0f];
184 s1 = X[(i + 14) & 0x0f];
187 T1 = X[i & 0xf] += s0 + s1 + X[(i + 9) & 0xf];
188 T1 += h + Sigma1(e) + Ch(e, f, g) + K256[i];
189 T2 = Sigma0(a) + Maj(a, b, c);
214 # define ROUND_00_15(i,a,b,c,d,e,f,g,h) do { \
215 T1 += h + Sigma1(e) + Ch(e,f,g) + K256[i]; \
216 h = Sigma0(a) + Maj(a,b,c); \
217 d += T1; h += T1; } while (0)
219 # define ROUND_16_63(i,a,b,c,d,e,f,g,h,X) do { \
220 s0 = X[(i+1)&0x0f]; s0 = sigma0(s0); \
221 s1 = X[(i+14)&0x0f]; s1 = sigma1(s1); \
222 T1 = X[(i)&0x0f] += s0 + s1 + X[(i+9)&0x0f]; \
223 ROUND_00_15(i,a,b,c,d,e,f,g,h); } while (0)
225 static void sha256_block_data_order(SHA256_CTX *ctx, const void *in,
228 unsigned MD32_REG_T a, b, c, d, e, f, g, h, s0, s1, T1;
231 const unsigned char *data = in;
245 if (!IS_LITTLE_ENDIAN && sizeof(SHA_LONG) == 4
246 && ((size_t)in % 4) == 0) {
247 const SHA_LONG *W = (const SHA_LONG *)data;
250 ROUND_00_15(0, a, b, c, d, e, f, g, h);
252 ROUND_00_15(1, h, a, b, c, d, e, f, g);
254 ROUND_00_15(2, g, h, a, b, c, d, e, f);
256 ROUND_00_15(3, f, g, h, a, b, c, d, e);
258 ROUND_00_15(4, e, f, g, h, a, b, c, d);
260 ROUND_00_15(5, d, e, f, g, h, a, b, c);
262 ROUND_00_15(6, c, d, e, f, g, h, a, b);
264 ROUND_00_15(7, b, c, d, e, f, g, h, a);
266 ROUND_00_15(8, a, b, c, d, e, f, g, h);
268 ROUND_00_15(9, h, a, b, c, d, e, f, g);
270 ROUND_00_15(10, g, h, a, b, c, d, e, f);
272 ROUND_00_15(11, f, g, h, a, b, c, d, e);
274 ROUND_00_15(12, e, f, g, h, a, b, c, d);
276 ROUND_00_15(13, d, e, f, g, h, a, b, c);
278 ROUND_00_15(14, c, d, e, f, g, h, a, b);
280 ROUND_00_15(15, b, c, d, e, f, g, h, a);
282 data += SHA256_CBLOCK;
286 (void)HOST_c2l(data, l);
288 ROUND_00_15(0, a, b, c, d, e, f, g, h);
289 (void)HOST_c2l(data, l);
291 ROUND_00_15(1, h, a, b, c, d, e, f, g);
292 (void)HOST_c2l(data, l);
294 ROUND_00_15(2, g, h, a, b, c, d, e, f);
295 (void)HOST_c2l(data, l);
297 ROUND_00_15(3, f, g, h, a, b, c, d, e);
298 (void)HOST_c2l(data, l);
300 ROUND_00_15(4, e, f, g, h, a, b, c, d);
301 (void)HOST_c2l(data, l);
303 ROUND_00_15(5, d, e, f, g, h, a, b, c);
304 (void)HOST_c2l(data, l);
306 ROUND_00_15(6, c, d, e, f, g, h, a, b);
307 (void)HOST_c2l(data, l);
309 ROUND_00_15(7, b, c, d, e, f, g, h, a);
310 (void)HOST_c2l(data, l);
312 ROUND_00_15(8, a, b, c, d, e, f, g, h);
313 (void)HOST_c2l(data, l);
315 ROUND_00_15(9, h, a, b, c, d, e, f, g);
316 (void)HOST_c2l(data, l);
318 ROUND_00_15(10, g, h, a, b, c, d, e, f);
319 (void)HOST_c2l(data, l);
321 ROUND_00_15(11, f, g, h, a, b, c, d, e);
322 (void)HOST_c2l(data, l);
324 ROUND_00_15(12, e, f, g, h, a, b, c, d);
325 (void)HOST_c2l(data, l);
327 ROUND_00_15(13, d, e, f, g, h, a, b, c);
328 (void)HOST_c2l(data, l);
330 ROUND_00_15(14, c, d, e, f, g, h, a, b);
331 (void)HOST_c2l(data, l);
333 ROUND_00_15(15, b, c, d, e, f, g, h, a);
336 for (i = 16; i < 64; i += 8) {
337 ROUND_16_63(i + 0, a, b, c, d, e, f, g, h, X);
338 ROUND_16_63(i + 1, h, a, b, c, d, e, f, g, X);
339 ROUND_16_63(i + 2, g, h, a, b, c, d, e, f, X);
340 ROUND_16_63(i + 3, f, g, h, a, b, c, d, e, X);
341 ROUND_16_63(i + 4, e, f, g, h, a, b, c, d, X);
342 ROUND_16_63(i + 5, d, e, f, g, h, a, b, c, X);
343 ROUND_16_63(i + 6, c, d, e, f, g, h, a, b, X);
344 ROUND_16_63(i + 7, b, c, d, e, f, g, h, a, X);
360 #endif /* SHA256_ASM */