|
|
@@ -0,0 +1,220 @@
|
|
|
+/*
|
|
|
+ * Copyright (c) 2015, Cameron Rich
|
|
|
+ *
|
|
|
+ * All rights reserved.
|
|
|
+ *
|
|
|
+ * Redistribution and use in source and binary forms, with or without
|
|
|
+ * modification, are permitted provided that the following conditions are met:
|
|
|
+ *
|
|
|
+ * * Redistributions of source code must retain the above copyright notice,
|
|
|
+ * this list of conditions and the following disclaimer.
|
|
|
+ * * Redistributions in binary form must reproduce the above copyright notice,
|
|
|
+ * this list of conditions and the following disclaimer in the documentation
|
|
|
+ * and/or other materials provided with the distribution.
|
|
|
+ * * Neither the name of the axTLS project nor the names of its contributors
|
|
|
+ * may be used to endorse or promote products derived from this software
|
|
|
+ * without specific prior written permission.
|
|
|
+ *
|
|
|
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
|
|
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
|
+ * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
|
+ * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
|
+ * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
|
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
|
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
+ */
|
|
|
+
|
|
|
+#include <string.h>
|
|
|
+#include "os_port.h"
|
|
|
+#include "crypto.h"
|
|
|
+
|
|
|
+#define SHR64(a, n) ((a) >> (n))
|
|
|
+#define ROR64(a, n) (((a) >> (n)) | ((a) << (64 - (n))))
|
|
|
+#define CH(x, y, z) (((x) & (y)) | (~(x) & (z)))
|
|
|
+#define MAJ(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
|
|
|
+#define SIGMA1(x) (ROR64(x, 28) ^ ROR64(x, 34) ^ ROR64(x, 39))
|
|
|
+#define SIGMA2(x) (ROR64(x, 14) ^ ROR64(x, 18) ^ ROR64(x, 41))
|
|
|
+#define SIGMA3(x) (ROR64(x, 1) ^ ROR64(x, 8) ^ SHR64(x, 7))
|
|
|
+#define SIGMA4(x) (ROR64(x, 19) ^ ROR64(x, 61) ^ SHR64(x, 6))
|
|
|
+#define MIN(x, y) ((x) < (y) ? x : y)
|
|
|
+
|
|
|
+static const uint8_t padding[128] =
|
|
|
+{
|
|
|
+ 0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
+ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
+ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
+ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
+ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
+ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
+ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
+ 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
|
|
|
+};
|
|
|
+
|
|
|
+static const uint64_t k[80] =
|
|
|
+{
|
|
|
+ 0x428A2F98D728AE22, 0x7137449123EF65CD, 0xB5C0FBCFEC4D3B2F, 0xE9B5DBA58189DBBC,
|
|
|
+ 0x3956C25BF348B538, 0x59F111F1B605D019, 0x923F82A4AF194F9B, 0xAB1C5ED5DA6D8118,
|
|
|
+ 0xD807AA98A3030242, 0x12835B0145706FBE, 0x243185BE4EE4B28C, 0x550C7DC3D5FFB4E2,
|
|
|
+ 0x72BE5D74F27B896F, 0x80DEB1FE3B1696B1, 0x9BDC06A725C71235, 0xC19BF174CF692694,
|
|
|
+ 0xE49B69C19EF14AD2, 0xEFBE4786384F25E3, 0x0FC19DC68B8CD5B5, 0x240CA1CC77AC9C65,
|
|
|
+ 0x2DE92C6F592B0275, 0x4A7484AA6EA6E483, 0x5CB0A9DCBD41FBD4, 0x76F988DA831153B5,
|
|
|
+ 0x983E5152EE66DFAB, 0xA831C66D2DB43210, 0xB00327C898FB213F, 0xBF597FC7BEEF0EE4,
|
|
|
+ 0xC6E00BF33DA88FC2, 0xD5A79147930AA725, 0x06CA6351E003826F, 0x142929670A0E6E70,
|
|
|
+ 0x27B70A8546D22FFC, 0x2E1B21385C26C926, 0x4D2C6DFC5AC42AED, 0x53380D139D95B3DF,
|
|
|
+ 0x650A73548BAF63DE, 0x766A0ABB3C77B2A8, 0x81C2C92E47EDAEE6, 0x92722C851482353B,
|
|
|
+ 0xA2BFE8A14CF10364, 0xA81A664BBC423001, 0xC24B8B70D0F89791, 0xC76C51A30654BE30,
|
|
|
+ 0xD192E819D6EF5218, 0xD69906245565A910, 0xF40E35855771202A, 0x106AA07032BBD1B8,
|
|
|
+ 0x19A4C116B8D2D0C8, 0x1E376C085141AB53, 0x2748774CDF8EEB99, 0x34B0BCB5E19B48A8,
|
|
|
+ 0x391C0CB3C5C95A63, 0x4ED8AA4AE3418ACB, 0x5B9CCA4F7763E373, 0x682E6FF3D6B2B8A3,
|
|
|
+ 0x748F82EE5DEFB2FC, 0x78A5636F43172F60, 0x84C87814A1F0AB72, 0x8CC702081A6439EC,
|
|
|
+ 0x90BEFFFA23631E28, 0xA4506CEBDE82BDE9, 0xBEF9A3F7B2C67915, 0xC67178F2E372532B,
|
|
|
+ 0xCA273ECEEA26619C, 0xD186B8C721C0C207, 0xEADA7DD6CDE0EB1E, 0xF57D4F7FEE6ED178,
|
|
|
+ 0x06F067AA72176FBA, 0x0A637DC5A2C898A6, 0x113F9804BEF90DAE, 0x1B710B35131C471B,
|
|
|
+ 0x28DB77F523047D84, 0x32CAAB7B40C72493, 0x3C9EBE0A15C9BEBC, 0x431D67C49C100D4C,
|
|
|
+ 0x4CC5D4BECB3E42B6, 0x597F299CFC657E2A, 0x5FCB6FAB3AD6FAEC, 0x6C44198C4A475817
|
|
|
+};
|
|
|
+
|
|
|
+/**
|
|
|
+* Initialize the SHA512 context
|
|
|
+*/
|
|
|
+void SHA512_Init(SHA512_CTX *ctx)
|
|
|
+{
|
|
|
+ ctx->h_dig.h[0] = 0x6A09E667F3BCC908;
|
|
|
+ ctx->h_dig.h[1] = 0xBB67AE8584CAA73B;
|
|
|
+ ctx->h_dig.h[2] = 0x3C6EF372FE94F82B;
|
|
|
+ ctx->h_dig.h[3] = 0xA54FF53A5F1D36F1;
|
|
|
+ ctx->h_dig.h[4] = 0x510E527FADE682D1;
|
|
|
+ ctx->h_dig.h[5] = 0x9B05688C2B3E6C1F;
|
|
|
+ ctx->h_dig.h[6] = 0x1F83D9ABFB41BD6B;
|
|
|
+ ctx->h_dig.h[7] = 0x5BE0CD19137E2179;
|
|
|
+ ctx->size = 0;
|
|
|
+ ctx->totalSize = 0;
|
|
|
+}
|
|
|
+
|
|
|
+static void SHA512_Process(SHA512_CTX *ctx)
|
|
|
+{
|
|
|
+ int t;
|
|
|
+ uint64_t temp1;
|
|
|
+ uint64_t temp2;
|
|
|
+
|
|
|
+ // Initialize the 8 working registers
|
|
|
+ uint64_t a = ctx->h_dig.h[0];
|
|
|
+ uint64_t b = ctx->h_dig.h[1];
|
|
|
+ uint64_t c = ctx->h_dig.h[2];
|
|
|
+ uint64_t d = ctx->h_dig.h[3];
|
|
|
+ uint64_t e = ctx->h_dig.h[4];
|
|
|
+ uint64_t f = ctx->h_dig.h[5];
|
|
|
+ uint64_t g = ctx->h_dig.h[6];
|
|
|
+ uint64_t h = ctx->h_dig.h[7];
|
|
|
+
|
|
|
+ // Process message in 16-word blocks
|
|
|
+ uint64_t *w = ctx->w_buf.w;
|
|
|
+
|
|
|
+ // Convert from big-endian byte order to host byte order
|
|
|
+ for (t = 0; t < 16; t++)
|
|
|
+ w[t] = be64toh(w[t]);
|
|
|
+
|
|
|
+ // Prepare the message schedule
|
|
|
+ for (t = 16; t < 80; t++)
|
|
|
+ w[t] = SIGMA4(w[t - 2]) + w[t - 7] + SIGMA3(w[t - 15]) + w[t - 16];
|
|
|
+
|
|
|
+ // SHA-512 hash computation
|
|
|
+ for (t = 0; t < 80; t++)
|
|
|
+ {
|
|
|
+ // Calculate T1 and T2
|
|
|
+ temp1 = h + SIGMA2(e) + CH(e, f, g) + k[t] + w[t];
|
|
|
+ temp2 = SIGMA1(a) + MAJ(a, b, c);
|
|
|
+
|
|
|
+ // Update the working registers
|
|
|
+ h = g;
|
|
|
+ g = f;
|
|
|
+ f = e;
|
|
|
+ e = d + temp1;
|
|
|
+ d = c;
|
|
|
+ c = b;
|
|
|
+ b = a;
|
|
|
+ a = temp1 + temp2;
|
|
|
+ }
|
|
|
+
|
|
|
+ // Update the hash value
|
|
|
+ ctx->h_dig.h[0] += a;
|
|
|
+ ctx->h_dig.h[1] += b;
|
|
|
+ ctx->h_dig.h[2] += c;
|
|
|
+ ctx->h_dig.h[3] += d;
|
|
|
+ ctx->h_dig.h[4] += e;
|
|
|
+ ctx->h_dig.h[5] += f;
|
|
|
+ ctx->h_dig.h[6] += g;
|
|
|
+ ctx->h_dig.h[7] += h;
|
|
|
+ }
|
|
|
+
|
|
|
+/**
|
|
|
+* Accepts an array of octets as the next portion of the message.
|
|
|
+*/
|
|
|
+void SHA512_Update(SHA512_CTX *ctx, const uint8_t * msg, int len)
|
|
|
+{
|
|
|
+ // Process the incoming data
|
|
|
+ while (len > 0)
|
|
|
+ {
|
|
|
+ // The buffer can hold at most 128 bytes
|
|
|
+ size_t n = MIN(len, 128 - ctx->size);
|
|
|
+
|
|
|
+ // Copy the data to the buffer
|
|
|
+ memcpy(ctx->w_buf.buffer + ctx->size, msg, n);
|
|
|
+
|
|
|
+ // Update the SHA-512 ctx
|
|
|
+ ctx->size += n;
|
|
|
+ ctx->totalSize += n;
|
|
|
+ // Advance the data pointer
|
|
|
+ msg = (uint8_t *) msg + n;
|
|
|
+ // Remaining bytes to process
|
|
|
+ len -= n;
|
|
|
+
|
|
|
+ // Process message in 16-word blocks
|
|
|
+ if (ctx->size == 128)
|
|
|
+ {
|
|
|
+ // Transform the 16-word block
|
|
|
+ SHA512_Process(ctx);
|
|
|
+ // Empty the buffer
|
|
|
+ ctx->size = 0;
|
|
|
+ }
|
|
|
+ }
|
|
|
+}
|
|
|
+
|
|
|
+/**
|
|
|
+* Return the 512-bit message digest into the user's array
|
|
|
+*/
|
|
|
+void SHA512_Final(uint8_t *digest, SHA512_CTX *ctx)
|
|
|
+{
|
|
|
+ int i;
|
|
|
+ size_t paddingSize;
|
|
|
+ uint64_t totalSize;
|
|
|
+
|
|
|
+ // Length of the original message (before padding)
|
|
|
+ totalSize = ctx->totalSize * 8;
|
|
|
+
|
|
|
+ // Pad the message so that its length is congruent to 112 modulo 128
|
|
|
+ paddingSize = (ctx->size < 112) ? (112 - ctx->size) :
|
|
|
+ (128 + 112 - ctx->size);
|
|
|
+ // Append padding
|
|
|
+ SHA512_Update(ctx, padding, paddingSize);
|
|
|
+
|
|
|
+ // Append the length of the original message
|
|
|
+ ctx->w_buf.w[14] = 0;
|
|
|
+ ctx->w_buf.w[15] = be64toh(totalSize);
|
|
|
+
|
|
|
+ // Calculate the message digest
|
|
|
+ SHA512_Process(ctx);
|
|
|
+
|
|
|
+ // Convert from host byte order to big-endian byte order
|
|
|
+ for (i = 0; i < 8; i++)
|
|
|
+ ctx->h_dig.h[i] = be64toh(ctx->h_dig.h[i]);
|
|
|
+
|
|
|
+ // Copy the resulting digest
|
|
|
+ if (digest != NULL)
|
|
|
+ memcpy(digest, ctx->h_dig.digest, SHA512_SIZE);
|
|
|
+ }
|
|
|
+
|