|
|
@@ -1,307 +1,218 @@
|
|
|
/*
|
|
|
- * FIPS-180-2 compliant SHA-256 implementation
|
|
|
+ * FIPS 180-2 SHA-224/256/384/512 implementation
|
|
|
+ * Last update: 02/02/2007
|
|
|
+ * Issue date: 04/30/2005
|
|
|
*
|
|
|
- * Copyright (C) 2011, Con Kolivas
|
|
|
- * Copyright (C) 2006-2010, Brainspark B.V.
|
|
|
+ * Copyright 2013 Con Kolivas
|
|
|
+ * Copyright 2005 2007 Olivier Gay
|
|
|
+ * All rights reserved.
|
|
|
*
|
|
|
- * This file is part of PolarSSL (http://www.polarssl.org)
|
|
|
- * Lead Maintainer: Paul Bakker <polarssl_maintainer at polarssl.org>
|
|
|
+ * Redistribution and use in source and binary forms, with or without
|
|
|
+ * modification, are permitted provided that the following conditions
|
|
|
+ * are met:
|
|
|
+ * 1. Redistributions of source code must retain the above copyright
|
|
|
+ * notice, this list of conditions and the following disclaimer.
|
|
|
+ * 2. 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.
|
|
|
+ * 3. Neither the name of the project nor the names of its contributors
|
|
|
+ * may be used to endorse or promote products derived from this software
|
|
|
+ * without specific prior written permission.
|
|
|
*
|
|
|
- * All rights reserved.
|
|
|
- *
|
|
|
- * This program is free software; you can redistribute it and/or modify
|
|
|
- * it under the terms of the GNU General Public License as published by
|
|
|
- * the Free Software Foundation; either version 3 of the License, or
|
|
|
- * (at your option) any later version.
|
|
|
- *
|
|
|
- * This program is distributed in the hope that it will be useful,
|
|
|
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
- * GNU General Public License for more details.
|
|
|
- *
|
|
|
- * You should have received a copy of the GNU General Public License along
|
|
|
- * with this program; if not, write to the Free Software Foundation, Inc.,
|
|
|
- * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
- */
|
|
|
-/*
|
|
|
- * The SHA-256 Secure Hash Standard was published by NIST in 2002.
|
|
|
- *
|
|
|
- * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
|
|
|
+ * THIS SOFTWARE IS PROVIDED BY THE PROJECT 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 PROJECT 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 "sha2.h"
|
|
|
|
|
|
-#include <string.h>
|
|
|
-#include <stdio.h>
|
|
|
+#define SHFR(x, n) (x >> n)
|
|
|
+#define ROTR(x, n) ((x >> n) | (x << ((sizeof(x) << 3) - n)))
|
|
|
+#define CH(x, y, z) ((x & y) ^ (~x & z))
|
|
|
+#define MAJ(x, y, z) ((x & y) ^ (x & z) ^ (y & z))
|
|
|
+
|
|
|
+#define SHA256_F1(x) (ROTR(x, 2) ^ ROTR(x, 13) ^ ROTR(x, 22))
|
|
|
+#define SHA256_F2(x) (ROTR(x, 6) ^ ROTR(x, 11) ^ ROTR(x, 25))
|
|
|
+#define SHA256_F3(x) (ROTR(x, 7) ^ ROTR(x, 18) ^ SHFR(x, 3))
|
|
|
+#define SHA256_F4(x) (ROTR(x, 17) ^ ROTR(x, 19) ^ SHFR(x, 10))
|
|
|
+
|
|
|
+#define UNPACK32(x, str) \
|
|
|
+{ \
|
|
|
+ *((str) + 3) = (uint8_t) ((x) ); \
|
|
|
+ *((str) + 2) = (uint8_t) ((x) >> 8); \
|
|
|
+ *((str) + 1) = (uint8_t) ((x) >> 16); \
|
|
|
+ *((str) + 0) = (uint8_t) ((x) >> 24); \
|
|
|
+}
|
|
|
|
|
|
-/*
|
|
|
- * 32-bit integer manipulation macros (big endian)
|
|
|
- */
|
|
|
-#ifndef GET_ULONG_BE
|
|
|
-#define GET_ULONG_BE(n,b,i) \
|
|
|
-{ \
|
|
|
- (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
|
|
|
- | ( (uint32_t) (b)[(i) + 1] << 16 ) \
|
|
|
- | ( (uint32_t) (b)[(i) + 2] << 8 ) \
|
|
|
- | ( (uint32_t) (b)[(i) + 3] ); \
|
|
|
+#define PACK32(str, x) \
|
|
|
+{ \
|
|
|
+ *(x) = ((uint32_t) *((str) + 3) ) \
|
|
|
+ | ((uint32_t) *((str) + 2) << 8) \
|
|
|
+ | ((uint32_t) *((str) + 1) << 16) \
|
|
|
+ | ((uint32_t) *((str) + 0) << 24); \
|
|
|
}
|
|
|
-#endif
|
|
|
-
|
|
|
-#ifndef PUT_ULONG_BE
|
|
|
-#define PUT_ULONG_BE(n,b,i) \
|
|
|
-{ \
|
|
|
- (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
|
|
|
- (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
|
|
|
- (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
|
|
|
- (b)[(i) + 3] = (unsigned char) ( (n) ); \
|
|
|
+
|
|
|
+#define SHA256_SCR(i) \
|
|
|
+{ \
|
|
|
+ w[i] = SHA256_F4(w[i - 2]) + w[i - 7] \
|
|
|
+ + SHA256_F3(w[i - 15]) + w[i - 16]; \
|
|
|
}
|
|
|
-#endif
|
|
|
|
|
|
-/*
|
|
|
- * SHA-256 context setup
|
|
|
- */
|
|
|
-void sha2_starts( sha2_context *ctx )
|
|
|
+uint32_t sha256_h0[8] =
|
|
|
+ {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
|
|
|
+ 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
|
|
|
+
|
|
|
+uint32_t sha256_k[64] =
|
|
|
+ {0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
|
|
|
+ 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
|
|
|
+ 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
|
|
|
+ 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
|
|
|
+ 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
|
|
|
+ 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
|
|
|
+ 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
|
|
|
+ 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
|
|
|
+ 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
|
|
|
+ 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
|
|
|
+ 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
|
|
|
+ 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
|
|
|
+ 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
|
|
|
+ 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
|
|
|
+ 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
|
|
|
+ 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2};
|
|
|
+
|
|
|
+/* SHA-256 functions */
|
|
|
+
|
|
|
+void sha256_transf(sha256_ctx *ctx, const unsigned char *message,
|
|
|
+ unsigned int block_nb)
|
|
|
{
|
|
|
- ctx->total[0] = 0;
|
|
|
- ctx->total[1] = 0;
|
|
|
-
|
|
|
- ctx->state[0] = 0x6A09E667;
|
|
|
- ctx->state[1] = 0xBB67AE85;
|
|
|
- ctx->state[2] = 0x3C6EF372;
|
|
|
- ctx->state[3] = 0xA54FF53A;
|
|
|
- ctx->state[4] = 0x510E527F;
|
|
|
- ctx->state[5] = 0x9B05688C;
|
|
|
- ctx->state[6] = 0x1F83D9AB;
|
|
|
- ctx->state[7] = 0x5BE0CD19;
|
|
|
+ uint32_t w[64];
|
|
|
+ uint32_t wv[8];
|
|
|
+ uint32_t t1, t2;
|
|
|
+ const unsigned char *sub_block;
|
|
|
+ int i;
|
|
|
+
|
|
|
+ int j;
|
|
|
+
|
|
|
+ for (i = 0; i < (int) block_nb; i++) {
|
|
|
+ sub_block = message + (i << 6);
|
|
|
+
|
|
|
+ for (j = 0; j < 16; j++) {
|
|
|
+ PACK32(&sub_block[j << 2], &w[j]);
|
|
|
+ }
|
|
|
+
|
|
|
+ for (j = 16; j < 64; j++) {
|
|
|
+ SHA256_SCR(j);
|
|
|
+ }
|
|
|
+
|
|
|
+ for (j = 0; j < 8; j++) {
|
|
|
+ wv[j] = ctx->h[j];
|
|
|
+ }
|
|
|
+
|
|
|
+ for (j = 0; j < 64; j++) {
|
|
|
+ t1 = wv[7] + SHA256_F2(wv[4]) + CH(wv[4], wv[5], wv[6])
|
|
|
+ + sha256_k[j] + w[j];
|
|
|
+ t2 = SHA256_F1(wv[0]) + MAJ(wv[0], wv[1], wv[2]);
|
|
|
+ wv[7] = wv[6];
|
|
|
+ wv[6] = wv[5];
|
|
|
+ wv[5] = wv[4];
|
|
|
+ wv[4] = wv[3] + t1;
|
|
|
+ wv[3] = wv[2];
|
|
|
+ wv[2] = wv[1];
|
|
|
+ wv[1] = wv[0];
|
|
|
+ wv[0] = t1 + t2;
|
|
|
+ }
|
|
|
+
|
|
|
+ for (j = 0; j < 8; j++) {
|
|
|
+ ctx->h[j] += wv[j];
|
|
|
+ }
|
|
|
+ }
|
|
|
}
|
|
|
|
|
|
-static void sha2_process( sha2_context *ctx, const unsigned char data[64] )
|
|
|
+void sha256(const unsigned char *message, unsigned int len, unsigned char *digest)
|
|
|
{
|
|
|
- uint32_t temp1, temp2, W[64];
|
|
|
- uint32_t A, B, C, D, E, F, G, H;
|
|
|
-
|
|
|
- GET_ULONG_BE( W[ 0], data, 0 );
|
|
|
- GET_ULONG_BE( W[ 1], data, 4 );
|
|
|
- GET_ULONG_BE( W[ 2], data, 8 );
|
|
|
- GET_ULONG_BE( W[ 3], data, 12 );
|
|
|
- GET_ULONG_BE( W[ 4], data, 16 );
|
|
|
- GET_ULONG_BE( W[ 5], data, 20 );
|
|
|
- GET_ULONG_BE( W[ 6], data, 24 );
|
|
|
- GET_ULONG_BE( W[ 7], data, 28 );
|
|
|
- GET_ULONG_BE( W[ 8], data, 32 );
|
|
|
- GET_ULONG_BE( W[ 9], data, 36 );
|
|
|
- GET_ULONG_BE( W[10], data, 40 );
|
|
|
- GET_ULONG_BE( W[11], data, 44 );
|
|
|
- GET_ULONG_BE( W[12], data, 48 );
|
|
|
- GET_ULONG_BE( W[13], data, 52 );
|
|
|
- GET_ULONG_BE( W[14], data, 56 );
|
|
|
- GET_ULONG_BE( W[15], data, 60 );
|
|
|
-
|
|
|
-#define SHR(x,n) ((x & 0xFFFFFFFF) >> n)
|
|
|
-#define ROTR(x,n) (SHR(x,n) | (x << (32 - n)))
|
|
|
-
|
|
|
-#define S0(x) (ROTR(x, 7) ^ ROTR(x,18) ^ SHR(x, 3))
|
|
|
-#define S1(x) (ROTR(x,17) ^ ROTR(x,19) ^ SHR(x,10))
|
|
|
-
|
|
|
-#define S2(x) (ROTR(x, 2) ^ ROTR(x,13) ^ ROTR(x,22))
|
|
|
-#define S3(x) (ROTR(x, 6) ^ ROTR(x,11) ^ ROTR(x,25))
|
|
|
-
|
|
|
-#define F0(x,y,z) ((x & y) | (z & (x | y)))
|
|
|
-#define F1(x,y,z) (z ^ (x & (y ^ z)))
|
|
|
-
|
|
|
-#define R(t) \
|
|
|
-( \
|
|
|
- W[t] = S1(W[t - 2]) + W[t - 7] + \
|
|
|
- S0(W[t - 15]) + W[t - 16] \
|
|
|
-)
|
|
|
-
|
|
|
-#define P(a,b,c,d,e,f,g,h,x,K) \
|
|
|
-{ \
|
|
|
- temp1 = h + S3(e) + F1(e,f,g) + K + x; \
|
|
|
- temp2 = S2(a) + F0(a,b,c); \
|
|
|
- d += temp1; h = temp1 + temp2; \
|
|
|
-}
|
|
|
+ sha256_ctx ctx;
|
|
|
|
|
|
- A = ctx->state[0];
|
|
|
- B = ctx->state[1];
|
|
|
- C = ctx->state[2];
|
|
|
- D = ctx->state[3];
|
|
|
- E = ctx->state[4];
|
|
|
- F = ctx->state[5];
|
|
|
- G = ctx->state[6];
|
|
|
- H = ctx->state[7];
|
|
|
-
|
|
|
- P( A, B, C, D, E, F, G, H, W[ 0], 0x428A2F98 );
|
|
|
- P( H, A, B, C, D, E, F, G, W[ 1], 0x71374491 );
|
|
|
- P( G, H, A, B, C, D, E, F, W[ 2], 0xB5C0FBCF );
|
|
|
- P( F, G, H, A, B, C, D, E, W[ 3], 0xE9B5DBA5 );
|
|
|
- P( E, F, G, H, A, B, C, D, W[ 4], 0x3956C25B );
|
|
|
- P( D, E, F, G, H, A, B, C, W[ 5], 0x59F111F1 );
|
|
|
- P( C, D, E, F, G, H, A, B, W[ 6], 0x923F82A4 );
|
|
|
- P( B, C, D, E, F, G, H, A, W[ 7], 0xAB1C5ED5 );
|
|
|
- P( A, B, C, D, E, F, G, H, W[ 8], 0xD807AA98 );
|
|
|
- P( H, A, B, C, D, E, F, G, W[ 9], 0x12835B01 );
|
|
|
- P( G, H, A, B, C, D, E, F, W[10], 0x243185BE );
|
|
|
- P( F, G, H, A, B, C, D, E, W[11], 0x550C7DC3 );
|
|
|
- P( E, F, G, H, A, B, C, D, W[12], 0x72BE5D74 );
|
|
|
- P( D, E, F, G, H, A, B, C, W[13], 0x80DEB1FE );
|
|
|
- P( C, D, E, F, G, H, A, B, W[14], 0x9BDC06A7 );
|
|
|
- P( B, C, D, E, F, G, H, A, W[15], 0xC19BF174 );
|
|
|
- P( A, B, C, D, E, F, G, H, R(16), 0xE49B69C1 );
|
|
|
- P( H, A, B, C, D, E, F, G, R(17), 0xEFBE4786 );
|
|
|
- P( G, H, A, B, C, D, E, F, R(18), 0x0FC19DC6 );
|
|
|
- P( F, G, H, A, B, C, D, E, R(19), 0x240CA1CC );
|
|
|
- P( E, F, G, H, A, B, C, D, R(20), 0x2DE92C6F );
|
|
|
- P( D, E, F, G, H, A, B, C, R(21), 0x4A7484AA );
|
|
|
- P( C, D, E, F, G, H, A, B, R(22), 0x5CB0A9DC );
|
|
|
- P( B, C, D, E, F, G, H, A, R(23), 0x76F988DA );
|
|
|
- P( A, B, C, D, E, F, G, H, R(24), 0x983E5152 );
|
|
|
- P( H, A, B, C, D, E, F, G, R(25), 0xA831C66D );
|
|
|
- P( G, H, A, B, C, D, E, F, R(26), 0xB00327C8 );
|
|
|
- P( F, G, H, A, B, C, D, E, R(27), 0xBF597FC7 );
|
|
|
- P( E, F, G, H, A, B, C, D, R(28), 0xC6E00BF3 );
|
|
|
- P( D, E, F, G, H, A, B, C, R(29), 0xD5A79147 );
|
|
|
- P( C, D, E, F, G, H, A, B, R(30), 0x06CA6351 );
|
|
|
- P( B, C, D, E, F, G, H, A, R(31), 0x14292967 );
|
|
|
- P( A, B, C, D, E, F, G, H, R(32), 0x27B70A85 );
|
|
|
- P( H, A, B, C, D, E, F, G, R(33), 0x2E1B2138 );
|
|
|
- P( G, H, A, B, C, D, E, F, R(34), 0x4D2C6DFC );
|
|
|
- P( F, G, H, A, B, C, D, E, R(35), 0x53380D13 );
|
|
|
- P( E, F, G, H, A, B, C, D, R(36), 0x650A7354 );
|
|
|
- P( D, E, F, G, H, A, B, C, R(37), 0x766A0ABB );
|
|
|
- P( C, D, E, F, G, H, A, B, R(38), 0x81C2C92E );
|
|
|
- P( B, C, D, E, F, G, H, A, R(39), 0x92722C85 );
|
|
|
- P( A, B, C, D, E, F, G, H, R(40), 0xA2BFE8A1 );
|
|
|
- P( H, A, B, C, D, E, F, G, R(41), 0xA81A664B );
|
|
|
- P( G, H, A, B, C, D, E, F, R(42), 0xC24B8B70 );
|
|
|
- P( F, G, H, A, B, C, D, E, R(43), 0xC76C51A3 );
|
|
|
- P( E, F, G, H, A, B, C, D, R(44), 0xD192E819 );
|
|
|
- P( D, E, F, G, H, A, B, C, R(45), 0xD6990624 );
|
|
|
- P( C, D, E, F, G, H, A, B, R(46), 0xF40E3585 );
|
|
|
- P( B, C, D, E, F, G, H, A, R(47), 0x106AA070 );
|
|
|
- P( A, B, C, D, E, F, G, H, R(48), 0x19A4C116 );
|
|
|
- P( H, A, B, C, D, E, F, G, R(49), 0x1E376C08 );
|
|
|
- P( G, H, A, B, C, D, E, F, R(50), 0x2748774C );
|
|
|
- P( F, G, H, A, B, C, D, E, R(51), 0x34B0BCB5 );
|
|
|
- P( E, F, G, H, A, B, C, D, R(52), 0x391C0CB3 );
|
|
|
- P( D, E, F, G, H, A, B, C, R(53), 0x4ED8AA4A );
|
|
|
- P( C, D, E, F, G, H, A, B, R(54), 0x5B9CCA4F );
|
|
|
- P( B, C, D, E, F, G, H, A, R(55), 0x682E6FF3 );
|
|
|
- P( A, B, C, D, E, F, G, H, R(56), 0x748F82EE );
|
|
|
- P( H, A, B, C, D, E, F, G, R(57), 0x78A5636F );
|
|
|
- P( G, H, A, B, C, D, E, F, R(58), 0x84C87814 );
|
|
|
- P( F, G, H, A, B, C, D, E, R(59), 0x8CC70208 );
|
|
|
- P( E, F, G, H, A, B, C, D, R(60), 0x90BEFFFA );
|
|
|
- P( D, E, F, G, H, A, B, C, R(61), 0xA4506CEB );
|
|
|
- P( C, D, E, F, G, H, A, B, R(62), 0xBEF9A3F7 );
|
|
|
- P( B, C, D, E, F, G, H, A, R(63), 0xC67178F2 );
|
|
|
-
|
|
|
- ctx->state[0] += A;
|
|
|
- ctx->state[1] += B;
|
|
|
- ctx->state[2] += C;
|
|
|
- ctx->state[3] += D;
|
|
|
- ctx->state[4] += E;
|
|
|
- ctx->state[5] += F;
|
|
|
- ctx->state[6] += G;
|
|
|
- ctx->state[7] += H;
|
|
|
+ sha256_init(&ctx);
|
|
|
+ sha256_update(&ctx, message, len);
|
|
|
+ sha256_final(&ctx, digest);
|
|
|
}
|
|
|
|
|
|
-/*
|
|
|
- * SHA-256 process buffer
|
|
|
- */
|
|
|
-void sha2_update( sha2_context *ctx, const unsigned char *input, int ilen )
|
|
|
+void sha256_init(sha256_ctx *ctx)
|
|
|
{
|
|
|
- int fill;
|
|
|
- uint32_t left;
|
|
|
+ int i;
|
|
|
+ for (i = 0; i < 8; i++) {
|
|
|
+ ctx->h[i] = sha256_h0[i];
|
|
|
+ }
|
|
|
|
|
|
- if( ilen <= 0 )
|
|
|
- return;
|
|
|
+ ctx->len = 0;
|
|
|
+ ctx->tot_len = 0;
|
|
|
+}
|
|
|
|
|
|
- left = ctx->total[0] & 0x3F;
|
|
|
- fill = 64 - left;
|
|
|
+void sha256_update(sha256_ctx *ctx, const unsigned char *message,
|
|
|
+ unsigned int len)
|
|
|
+{
|
|
|
+ unsigned int block_nb;
|
|
|
+ unsigned int new_len, rem_len, tmp_len;
|
|
|
+ const unsigned char *shifted_message;
|
|
|
|
|
|
- ctx->total[0] += ilen;
|
|
|
- ctx->total[0] &= 0xFFFFFFFF;
|
|
|
+ tmp_len = SHA256_BLOCK_SIZE - ctx->len;
|
|
|
+ rem_len = len < tmp_len ? len : tmp_len;
|
|
|
|
|
|
- if( ctx->total[0] < (uint32_t) ilen )
|
|
|
- ctx->total[1]++;
|
|
|
+ memcpy(&ctx->block[ctx->len], message, rem_len);
|
|
|
|
|
|
- if( left && ilen >= fill )
|
|
|
- {
|
|
|
- memcpy( (void *) (ctx->buffer + left),
|
|
|
- (void *) input, fill );
|
|
|
- sha2_process( ctx, ctx->buffer );
|
|
|
- input += fill;
|
|
|
- ilen -= fill;
|
|
|
- left = 0;
|
|
|
+ if (ctx->len + len < SHA256_BLOCK_SIZE) {
|
|
|
+ ctx->len += len;
|
|
|
+ return;
|
|
|
}
|
|
|
|
|
|
- while( ilen >= 64 )
|
|
|
- {
|
|
|
- sha2_process( ctx, input );
|
|
|
- input += 64;
|
|
|
- ilen -= 64;
|
|
|
- }
|
|
|
+ new_len = len - rem_len;
|
|
|
+ block_nb = new_len / SHA256_BLOCK_SIZE;
|
|
|
|
|
|
- if( ilen > 0 )
|
|
|
- {
|
|
|
- memcpy( (void *) (ctx->buffer + left),
|
|
|
- (void *) input, ilen );
|
|
|
- }
|
|
|
-}
|
|
|
+ shifted_message = message + rem_len;
|
|
|
|
|
|
-static const unsigned char sha2_padding[64] =
|
|
|
-{
|
|
|
- 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
|
|
|
-};
|
|
|
+ sha256_transf(ctx, ctx->block, 1);
|
|
|
+ sha256_transf(ctx, shifted_message, block_nb);
|
|
|
|
|
|
-/*
|
|
|
- * SHA-256 final digest
|
|
|
- */
|
|
|
-void sha2_finish( sha2_context *ctx, unsigned char output[32] )
|
|
|
-{
|
|
|
- uint32_t last, padn;
|
|
|
- uint32_t high, low;
|
|
|
- unsigned char msglen[8];
|
|
|
+ rem_len = new_len % SHA256_BLOCK_SIZE;
|
|
|
|
|
|
- high = ( ctx->total[0] >> 29 )
|
|
|
- | ( ctx->total[1] << 3 );
|
|
|
- low = ( ctx->total[0] << 3 );
|
|
|
+ memcpy(ctx->block, &shifted_message[block_nb << 6],
|
|
|
+ rem_len);
|
|
|
|
|
|
- PUT_ULONG_BE( high, msglen, 0 );
|
|
|
- PUT_ULONG_BE( low, msglen, 4 );
|
|
|
+ ctx->len = rem_len;
|
|
|
+ ctx->tot_len += (block_nb + 1) << 6;
|
|
|
+}
|
|
|
|
|
|
- last = ctx->total[0] & 0x3F;
|
|
|
- padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
|
|
|
+void sha256_final(sha256_ctx *ctx, unsigned char *digest)
|
|
|
+{
|
|
|
+ unsigned int block_nb;
|
|
|
+ unsigned int pm_len;
|
|
|
+ unsigned int len_b;
|
|
|
|
|
|
- sha2_update( ctx, (unsigned char *) sha2_padding, padn );
|
|
|
- sha2_update( ctx, msglen, 8 );
|
|
|
+ int i;
|
|
|
|
|
|
- PUT_ULONG_BE( ctx->state[0], output, 0 );
|
|
|
- PUT_ULONG_BE( ctx->state[1], output, 4 );
|
|
|
- PUT_ULONG_BE( ctx->state[2], output, 8 );
|
|
|
- PUT_ULONG_BE( ctx->state[3], output, 12 );
|
|
|
- PUT_ULONG_BE( ctx->state[4], output, 16 );
|
|
|
- PUT_ULONG_BE( ctx->state[5], output, 20 );
|
|
|
- PUT_ULONG_BE( ctx->state[6], output, 24 );
|
|
|
+ block_nb = (1 + ((SHA256_BLOCK_SIZE - 9)
|
|
|
+ < (ctx->len % SHA256_BLOCK_SIZE)));
|
|
|
|
|
|
- PUT_ULONG_BE( ctx->state[7], output, 28 );
|
|
|
-}
|
|
|
+ len_b = (ctx->tot_len + ctx->len) << 3;
|
|
|
+ pm_len = block_nb << 6;
|
|
|
|
|
|
-/*
|
|
|
- * output = SHA-256( input buffer )
|
|
|
- */
|
|
|
-void sha2( const unsigned char *input, int ilen,
|
|
|
- unsigned char output[32] )
|
|
|
-{
|
|
|
- sha2_context ctx;
|
|
|
+ memset(ctx->block + ctx->len, 0, pm_len - ctx->len);
|
|
|
+ ctx->block[ctx->len] = 0x80;
|
|
|
+ UNPACK32(len_b, ctx->block + pm_len - 4);
|
|
|
|
|
|
- sha2_starts( &ctx );
|
|
|
- sha2_update( &ctx, input, ilen );
|
|
|
- sha2_finish( &ctx, output );
|
|
|
+ sha256_transf(ctx, ctx->block, block_nb);
|
|
|
|
|
|
- memset( &ctx, 0, sizeof( sha2_context ) );
|
|
|
+ for (i = 0 ; i < 8; i++) {
|
|
|
+ UNPACK32(ctx->h[i], &digest[i << 2]);
|
|
|
+ }
|
|
|
}
|
Luke Dashjr