| // SPDX-License-Identifier: GPL-2.0+ |
| /* |
| * FIPS-180-2 compliant SHA-512 and SHA-384 implementation |
| * |
| * SHA-512 code by Jean-Luc Cooke <jlcooke@certainkey.com> |
| * |
| * Copyright (c) Jean-Luc Cooke <jlcooke@certainkey.com> |
| * Copyright (c) Andrew McDonald <andrew@mcdonald.org.uk> |
| * Copyright (c) 2003 Kyle McMartin <kyle@debian.org> |
| * Copyright (c) 2020 Reuben Dowle <reuben.dowle@4rf.com> |
| */ |
| |
| #ifndef USE_HOSTCC |
| #include <u-boot/schedule.h> |
| #endif /* USE_HOSTCC */ |
| #include <compiler.h> |
| #include <u-boot/sha512.h> |
| |
| const uint8_t sha384_der_prefix[SHA384_DER_LEN] = { |
| 0x30, 0x41, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, |
| 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x02, 0x05, |
| 0x00, 0x04, 0x30 |
| }; |
| |
| const uint8_t sha512_der_prefix[SHA512_DER_LEN] = { |
| 0x30, 0x51, 0x30, 0x0d, 0x06, 0x09, 0x60, 0x86, |
| 0x48, 0x01, 0x65, 0x03, 0x04, 0x02, 0x03, 0x05, |
| 0x00, 0x04, 0x40 |
| }; |
| |
| #define SHA384_H0 0xcbbb9d5dc1059ed8ULL |
| #define SHA384_H1 0x629a292a367cd507ULL |
| #define SHA384_H2 0x9159015a3070dd17ULL |
| #define SHA384_H3 0x152fecd8f70e5939ULL |
| #define SHA384_H4 0x67332667ffc00b31ULL |
| #define SHA384_H5 0x8eb44a8768581511ULL |
| #define SHA384_H6 0xdb0c2e0d64f98fa7ULL |
| #define SHA384_H7 0x47b5481dbefa4fa4ULL |
| |
| #define SHA512_H0 0x6a09e667f3bcc908ULL |
| #define SHA512_H1 0xbb67ae8584caa73bULL |
| #define SHA512_H2 0x3c6ef372fe94f82bULL |
| #define SHA512_H3 0xa54ff53a5f1d36f1ULL |
| #define SHA512_H4 0x510e527fade682d1ULL |
| #define SHA512_H5 0x9b05688c2b3e6c1fULL |
| #define SHA512_H6 0x1f83d9abfb41bd6bULL |
| #define SHA512_H7 0x5be0cd19137e2179ULL |
| |
| static inline uint64_t Ch(uint64_t x, uint64_t y, uint64_t z) |
| { |
| return z ^ (x & (y ^ z)); |
| } |
| |
| static inline uint64_t Maj(uint64_t x, uint64_t y, uint64_t z) |
| { |
| return (x & y) | (z & (x | y)); |
| } |
| |
| static const uint64_t sha512_K[80] = { |
| 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL, |
| 0xe9b5dba58189dbbcULL, 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL, |
| 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL, 0xd807aa98a3030242ULL, |
| 0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL, |
| 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL, |
| 0xc19bf174cf692694ULL, 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL, |
| 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL, 0x2de92c6f592b0275ULL, |
| 0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL, |
| 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL, |
| 0xbf597fc7beef0ee4ULL, 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL, |
| 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL, 0x27b70a8546d22ffcULL, |
| 0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL, |
| 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL, |
| 0x92722c851482353bULL, 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL, |
| 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL, 0xd192e819d6ef5218ULL, |
| 0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL, |
| 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL, |
| 0x34b0bcb5e19b48a8ULL, 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL, |
| 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL, 0x748f82ee5defb2fcULL, |
| 0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL, |
| 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL, |
| 0xc67178f2e372532bULL, 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL, |
| 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL, 0x06f067aa72176fbaULL, |
| 0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL, |
| 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL, |
| 0x431d67c49c100d4cULL, 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL, |
| 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL, |
| }; |
| |
| static inline uint64_t ror64(uint64_t word, unsigned int shift) |
| { |
| return (word >> (shift & 63)) | (word << ((-shift) & 63)); |
| } |
| |
| #define e0(x) (ror64(x,28) ^ ror64(x,34) ^ ror64(x,39)) |
| #define e1(x) (ror64(x,14) ^ ror64(x,18) ^ ror64(x,41)) |
| #define s0(x) (ror64(x, 1) ^ ror64(x, 8) ^ (x >> 7)) |
| #define s1(x) (ror64(x,19) ^ ror64(x,61) ^ (x >> 6)) |
| |
| /* |
| * 64-bit integer manipulation macros (big endian) |
| */ |
| #ifndef GET_UINT64_BE |
| #define GET_UINT64_BE(n,b,i) { \ |
| (n) = ( (unsigned long long) (b)[(i) ] << 56 ) \ |
| | ( (unsigned long long) (b)[(i) + 1] << 48 ) \ |
| | ( (unsigned long long) (b)[(i) + 2] << 40 ) \ |
| | ( (unsigned long long) (b)[(i) + 3] << 32 ) \ |
| | ( (unsigned long long) (b)[(i) + 4] << 24 ) \ |
| | ( (unsigned long long) (b)[(i) + 5] << 16 ) \ |
| | ( (unsigned long long) (b)[(i) + 6] << 8 ) \ |
| | ( (unsigned long long) (b)[(i) + 7] ); \ |
| } |
| #endif |
| #ifndef PUT_UINT64_BE |
| #define PUT_UINT64_BE(n,b,i) { \ |
| (b)[(i) ] = (unsigned char) ( (n) >> 56 ); \ |
| (b)[(i) + 1] = (unsigned char) ( (n) >> 48 ); \ |
| (b)[(i) + 2] = (unsigned char) ( (n) >> 40 ); \ |
| (b)[(i) + 3] = (unsigned char) ( (n) >> 32 ); \ |
| (b)[(i) + 4] = (unsigned char) ( (n) >> 24 ); \ |
| (b)[(i) + 5] = (unsigned char) ( (n) >> 16 ); \ |
| (b)[(i) + 6] = (unsigned char) ( (n) >> 8 ); \ |
| (b)[(i) + 7] = (unsigned char) ( (n) ); \ |
| } |
| #endif |
| |
| static inline void LOAD_OP(int I, uint64_t *W, const uint8_t *input) |
| { |
| GET_UINT64_BE(W[I], input, I*8); |
| } |
| |
| static inline void BLEND_OP(int I, uint64_t *W) |
| { |
| W[I & 15] += s1(W[(I-2) & 15]) + W[(I-7) & 15] + s0(W[(I-15) & 15]); |
| } |
| |
| static void |
| sha512_transform(uint64_t *state, const uint8_t *input) |
| { |
| uint64_t a, b, c, d, e, f, g, h, t1, t2; |
| |
| int i; |
| uint64_t W[16]; |
| |
| /* load the state into our registers */ |
| a=state[0]; b=state[1]; c=state[2]; d=state[3]; |
| e=state[4]; f=state[5]; g=state[6]; h=state[7]; |
| |
| /* now iterate */ |
| for (i=0; i<80; i+=8) { |
| if (!(i & 8)) { |
| int j; |
| |
| if (i < 16) { |
| /* load the input */ |
| for (j = 0; j < 16; j++) |
| LOAD_OP(i + j, W, input); |
| } else { |
| for (j = 0; j < 16; j++) { |
| BLEND_OP(i + j, W); |
| } |
| } |
| } |
| |
| t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[(i & 15)]; |
| t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2; |
| t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[(i & 15) + 1]; |
| t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2; |
| t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[(i & 15) + 2]; |
| t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2; |
| t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[(i & 15) + 3]; |
| t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2; |
| t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[(i & 15) + 4]; |
| t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2; |
| t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[(i & 15) + 5]; |
| t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2; |
| t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[(i & 15) + 6]; |
| t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2; |
| t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[(i & 15) + 7]; |
| t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2; |
| } |
| |
| state[0] += a; state[1] += b; state[2] += c; state[3] += d; |
| state[4] += e; state[5] += f; state[6] += g; state[7] += h; |
| |
| /* erase our data */ |
| a = b = c = d = e = f = g = h = t1 = t2 = 0; |
| } |
| |
| static void sha512_block_fn(sha512_context *sst, const uint8_t *src, |
| int blocks) |
| { |
| while (blocks--) { |
| sha512_transform(sst->state, src); |
| src += SHA512_BLOCK_SIZE; |
| } |
| } |
| |
| static void sha512_base_do_update(sha512_context *sctx, |
| const uint8_t *data, |
| unsigned int len) |
| { |
| unsigned int partial = sctx->count[0] % SHA512_BLOCK_SIZE; |
| |
| sctx->count[0] += len; |
| if (sctx->count[0] < len) |
| sctx->count[1]++; |
| |
| if (unlikely((partial + len) >= SHA512_BLOCK_SIZE)) { |
| int blocks; |
| |
| if (partial) { |
| int p = SHA512_BLOCK_SIZE - partial; |
| |
| memcpy(sctx->buf + partial, data, p); |
| data += p; |
| len -= p; |
| |
| sha512_block_fn(sctx, sctx->buf, 1); |
| } |
| |
| blocks = len / SHA512_BLOCK_SIZE; |
| len %= SHA512_BLOCK_SIZE; |
| |
| if (blocks) { |
| sha512_block_fn(sctx, data, blocks); |
| data += blocks * SHA512_BLOCK_SIZE; |
| } |
| partial = 0; |
| } |
| if (len) |
| memcpy(sctx->buf + partial, data, len); |
| } |
| |
| static void sha512_base_do_finalize(sha512_context *sctx) |
| { |
| const int bit_offset = SHA512_BLOCK_SIZE - sizeof(uint64_t[2]); |
| uint64_t *bits = (uint64_t *)(sctx->buf + bit_offset); |
| unsigned int partial = sctx->count[0] % SHA512_BLOCK_SIZE; |
| |
| sctx->buf[partial++] = 0x80; |
| if (partial > bit_offset) { |
| memset(sctx->buf + partial, 0x0, SHA512_BLOCK_SIZE - partial); |
| partial = 0; |
| |
| sha512_block_fn(sctx, sctx->buf, 1); |
| } |
| |
| memset(sctx->buf + partial, 0x0, bit_offset - partial); |
| bits[0] = cpu_to_be64(sctx->count[1] << 3 | sctx->count[0] >> 61); |
| bits[1] = cpu_to_be64(sctx->count[0] << 3); |
| sha512_block_fn(sctx, sctx->buf, 1); |
| } |
| |
| #if defined(CONFIG_SHA384) |
| void sha384_starts(sha512_context * ctx) |
| { |
| ctx->state[0] = SHA384_H0; |
| ctx->state[1] = SHA384_H1; |
| ctx->state[2] = SHA384_H2; |
| ctx->state[3] = SHA384_H3; |
| ctx->state[4] = SHA384_H4; |
| ctx->state[5] = SHA384_H5; |
| ctx->state[6] = SHA384_H6; |
| ctx->state[7] = SHA384_H7; |
| ctx->count[0] = ctx->count[1] = 0; |
| } |
| |
| void sha384_update(sha512_context *ctx, const uint8_t *input, uint32_t length) |
| { |
| sha512_base_do_update(ctx, input, length); |
| } |
| |
| void sha384_finish(sha512_context * ctx, uint8_t digest[SHA384_SUM_LEN]) |
| { |
| int i; |
| |
| sha512_base_do_finalize(ctx); |
| for(i=0; i<SHA384_SUM_LEN / sizeof(uint64_t); i++) |
| PUT_UINT64_BE(ctx->state[i], digest, i * 8); |
| } |
| |
| /* |
| * Output = SHA-512( input buffer ). Trigger the watchdog every 'chunk_sz' |
| * bytes of input processed. |
| */ |
| void sha384_csum_wd(const unsigned char *input, unsigned int ilen, |
| unsigned char *output, unsigned int chunk_sz) |
| { |
| sha512_context ctx; |
| #if defined(CONFIG_HW_WATCHDOG) || defined(CONFIG_WATCHDOG) |
| const unsigned char *end; |
| unsigned char *curr; |
| int chunk; |
| #endif |
| |
| sha384_starts(&ctx); |
| |
| #if defined(CONFIG_HW_WATCHDOG) || defined(CONFIG_WATCHDOG) |
| curr = (unsigned char *)input; |
| end = input + ilen; |
| while (curr < end) { |
| chunk = end - curr; |
| if (chunk > chunk_sz) |
| chunk = chunk_sz; |
| sha384_update(&ctx, curr, chunk); |
| curr += chunk; |
| schedule(); |
| } |
| #else |
| sha384_update(&ctx, input, ilen); |
| #endif |
| |
| sha384_finish(&ctx, output); |
| } |
| |
| #endif |
| |
| void sha512_starts(sha512_context * ctx) |
| { |
| ctx->state[0] = SHA512_H0; |
| ctx->state[1] = SHA512_H1; |
| ctx->state[2] = SHA512_H2; |
| ctx->state[3] = SHA512_H3; |
| ctx->state[4] = SHA512_H4; |
| ctx->state[5] = SHA512_H5; |
| ctx->state[6] = SHA512_H6; |
| ctx->state[7] = SHA512_H7; |
| ctx->count[0] = ctx->count[1] = 0; |
| } |
| |
| void sha512_update(sha512_context *ctx, const uint8_t *input, uint32_t length) |
| { |
| sha512_base_do_update(ctx, input, length); |
| } |
| |
| void sha512_finish(sha512_context * ctx, uint8_t digest[SHA512_SUM_LEN]) |
| { |
| int i; |
| |
| sha512_base_do_finalize(ctx); |
| for(i=0; i<SHA512_SUM_LEN / sizeof(uint64_t); i++) |
| PUT_UINT64_BE(ctx->state[i], digest, i * 8); |
| } |
| |
| /* |
| * Output = SHA-512( input buffer ). Trigger the watchdog every 'chunk_sz' |
| * bytes of input processed. |
| */ |
| void sha512_csum_wd(const unsigned char *input, unsigned int ilen, |
| unsigned char *output, unsigned int chunk_sz) |
| { |
| sha512_context ctx; |
| #if defined(CONFIG_HW_WATCHDOG) || defined(CONFIG_WATCHDOG) |
| const unsigned char *end; |
| unsigned char *curr; |
| int chunk; |
| #endif |
| |
| sha512_starts(&ctx); |
| |
| #if defined(CONFIG_HW_WATCHDOG) || defined(CONFIG_WATCHDOG) |
| curr = (unsigned char *)input; |
| end = input + ilen; |
| while (curr < end) { |
| chunk = end - curr; |
| if (chunk > chunk_sz) |
| chunk = chunk_sz; |
| sha512_update(&ctx, curr, chunk); |
| curr += chunk; |
| schedule(); |
| } |
| #else |
| sha512_update(&ctx, input, ilen); |
| #endif |
| |
| sha512_finish(&ctx, output); |
| } |