1/* 2 * FILE: sha2.c 3 * AUTHOR: Aaron D. Gifford - http://www.aarongifford.com/ 4 * 5 * Copyright (c) 2000-2001, Aaron D. Gifford 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. Neither the name of the copyright holder nor the names of contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTOR(S) BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 * 32 * $OrigId: sha2.c,v 1.1 2001/11/08 00:01:51 adg Exp adg $ 33 * $RoughId: sha2.c,v 1.3 2002/02/26 22:03:36 knu Exp $ 34 * $Id: sha2.c 35505 2012-04-30 21:04:16Z nobu $ 35 */ 36 37#include "defs.h" 38#include <string.h> /* memcpy()/memset() or bcopy()/bzero() */ 39#include <assert.h> /* assert() */ 40#include "sha2.h" 41 42/* 43 * ASSERT NOTE: 44 * Some sanity checking code is included using assert(). On my FreeBSD 45 * system, this additional code can be removed by compiling with NDEBUG 46 * defined. Check your own systems manpage on assert() to see how to 47 * compile WITHOUT the sanity checking code on your system. 48 * 49 * UNROLLED TRANSFORM LOOP NOTE: 50 * You can define SHA2_UNROLL_TRANSFORM to use the unrolled transform 51 * loop version for the hash transform rounds (defined using macros 52 * later in this file). Either define on the command line, for example: 53 * 54 * cc -DSHA2_UNROLL_TRANSFORM -o sha2 sha2.c sha2prog.c 55 * 56 * or define below: 57 * 58 * #define SHA2_UNROLL_TRANSFORM 59 * 60 */ 61 62 63/*** SHA-256/384/512 Machine Architecture Definitions *****************/ 64/* 65 * BYTE_ORDER NOTE: 66 * 67 * Please make sure that your system defines BYTE_ORDER. If your 68 * architecture is little-endian, make sure it also defines 69 * LITTLE_ENDIAN and that the two (BYTE_ORDER and LITTLE_ENDIAN) are 70 * equivilent. 71 * 72 * If your system does not define the above, then you can do so by 73 * hand like this: 74 * 75 * #define LITTLE_ENDIAN 1234 76 * #define BIG_ENDIAN 4321 77 * 78 * And for little-endian machines, add: 79 * 80 * #define BYTE_ORDER LITTLE_ENDIAN 81 * 82 * Or for big-endian machines: 83 * 84 * #define BYTE_ORDER BIG_ENDIAN 85 * 86 * The FreeBSD machine this was written on defines BYTE_ORDER 87 * appropriately by including <sys/types.h> (which in turn includes 88 * <machine/endian.h> where the appropriate definitions are actually 89 * made). 90 */ 91#if !defined(BYTE_ORDER) || (BYTE_ORDER != LITTLE_ENDIAN && BYTE_ORDER != BIG_ENDIAN) 92#error Define BYTE_ORDER to be equal to either LITTLE_ENDIAN or BIG_ENDIAN 93#endif 94 95/* 96 * Define the followingsha2_* types to types of the correct length on 97 * the native archtecture. Most BSD systems and Linux define u_intXX_t 98 * types. Machines with very recent ANSI C headers, can use the 99 * uintXX_t definintions from inttypes.h by defining SHA2_USE_INTTYPES_H 100 * during compile or in the sha.h header file. 101 * 102 * Machines that support neither u_intXX_t nor inttypes.h's uintXX_t 103 * will need to define these three typedefs below (and the appropriate 104 * ones in sha.h too) by hand according to their system architecture. 105 * 106 * Thank you, Jun-ichiro itojun Hagino, for suggesting using u_intXX_t 107 * types and pointing out recent ANSI C support for uintXX_t in inttypes.h. 108 */ 109#ifdef SHA2_USE_INTTYPES_H 110 111typedef uint8_t sha2_byte; /* Exactly 1 byte */ 112typedef uint32_t sha2_word32; /* Exactly 4 bytes */ 113typedef uint64_t sha2_word64; /* Exactly 8 bytes */ 114 115#else /* SHA2_USE_INTTYPES_H */ 116 117typedef u_int8_t sha2_byte; /* Exactly 1 byte */ 118typedef u_int32_t sha2_word32; /* Exactly 4 bytes */ 119typedef u_int64_t sha2_word64; /* Exactly 8 bytes */ 120 121#endif /* SHA2_USE_INTTYPES_H */ 122 123 124/*** SHA-256/384/512 Various Length Definitions ***********************/ 125/* NOTE: Most of these are in sha2.h */ 126#define SHA256_SHORT_BLOCK_LENGTH (SHA256_BLOCK_LENGTH - 8) 127#define SHA384_SHORT_BLOCK_LENGTH (SHA384_BLOCK_LENGTH - 16) 128#define SHA512_SHORT_BLOCK_LENGTH (SHA512_BLOCK_LENGTH - 16) 129 130 131#if (defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)) || defined(__GNUC__) || defined(_HPUX_SOURCE) || defined(__IBMC__) 132#define ULL(number) number##ULL 133#else 134#define ULL(number) (uint64_t)(number) 135#endif 136/*** ENDIAN REVERSAL MACROS *******************************************/ 137#if BYTE_ORDER == LITTLE_ENDIAN 138#define REVERSE32(w,x) { \ 139 sha2_word32 tmp = (w); \ 140 tmp = (tmp >> 16) | (tmp << 16); \ 141 (x) = ((tmp & (sha2_word32)0xff00ff00UL) >> 8) | ((tmp & (sha2_word32)0x00ff00ffUL) << 8); \ 142} 143#define REVERSE64(w,x) { \ 144 sha2_word64 tmp = (w); \ 145 tmp = (tmp >> 32) | (tmp << 32); \ 146 tmp = ((tmp & ULL(0xff00ff00ff00ff00)) >> 8) | \ 147 ((tmp & ULL(0x00ff00ff00ff00ff)) << 8); \ 148 (x) = ((tmp & ULL(0xffff0000ffff0000)) >> 16) | \ 149 ((tmp & ULL(0x0000ffff0000ffff)) << 16); \ 150} 151#endif /* BYTE_ORDER == LITTLE_ENDIAN */ 152 153/* 154 * Macro for incrementally adding the unsigned 64-bit integer n to the 155 * unsigned 128-bit integer (represented using a two-element array of 156 * 64-bit words): 157 */ 158#define ADDINC128(w,n) { \ 159 (w)[0] += (sha2_word64)(n); \ 160 if ((w)[0] < (n)) { \ 161 (w)[1]++; \ 162 } \ 163} 164 165/* 166 * Macros for copying blocks of memory and for zeroing out ranges 167 * of memory. Using these macros makes it easy to switch from 168 * using memset()/memcpy() and using bzero()/bcopy(). 169 * 170 * Please define either SHA2_USE_MEMSET_MEMCPY or define 171 * SHA2_USE_BZERO_BCOPY depending on which function set you 172 * choose to use: 173 */ 174#if !defined(SHA2_USE_MEMSET_MEMCPY) && !defined(SHA2_USE_BZERO_BCOPY) 175/* Default to memset()/memcpy() if no option is specified */ 176#define SHA2_USE_MEMSET_MEMCPY 1 177#endif 178#if defined(SHA2_USE_MEMSET_MEMCPY) && defined(SHA2_USE_BZERO_BCOPY) 179/* Abort with an error if BOTH options are defined */ 180#error Define either SHA2_USE_MEMSET_MEMCPY or SHA2_USE_BZERO_BCOPY, not both! 181#endif 182 183#ifdef SHA2_USE_MEMSET_MEMCPY 184#define MEMSET_BZERO(p,l) memset((p), 0, (l)) 185#define MEMCPY_BCOPY(d,s,l) memcpy((d), (s), (l)) 186#endif 187#ifdef SHA2_USE_BZERO_BCOPY 188#define MEMSET_BZERO(p,l) bzero((p), (l)) 189#define MEMCPY_BCOPY(d,s,l) bcopy((s), (d), (l)) 190#endif 191 192 193/*** THE SIX LOGICAL FUNCTIONS ****************************************/ 194/* 195 * Bit shifting and rotation (used by the six SHA-XYZ logical functions: 196 * 197 * NOTE: The naming of R and S appears backwards here (R is a SHIFT and 198 * S is a ROTATION) because the SHA-256/384/512 description document 199 * (see http://csrc.nist.gov/cryptval/shs/sha256-384-512.pdf) uses this 200 * same "backwards" definition. 201 */ 202/* Shift-right (used in SHA-256, SHA-384, and SHA-512): */ 203#define R(b,x) ((x) >> (b)) 204/* 32-bit Rotate-right (used in SHA-256): */ 205#define S32(b,x) (((x) >> (b)) | ((x) << (32 - (b)))) 206/* 64-bit Rotate-right (used in SHA-384 and SHA-512): */ 207#define S64(b,x) (((x) >> (b)) | ((x) << (64 - (b)))) 208 209/* Two of six logical functions used in SHA-256, SHA-384, and SHA-512: */ 210#define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z))) 211#define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z))) 212 213/* Four of six logical functions used in SHA-256: */ 214#define Sigma0_256(x) (S32(2, (x)) ^ S32(13, (x)) ^ S32(22, (x))) 215#define Sigma1_256(x) (S32(6, (x)) ^ S32(11, (x)) ^ S32(25, (x))) 216#define sigma0_256(x) (S32(7, (x)) ^ S32(18, (x)) ^ R(3 , (x))) 217#define sigma1_256(x) (S32(17, (x)) ^ S32(19, (x)) ^ R(10, (x))) 218 219/* Four of six logical functions used in SHA-384 and SHA-512: */ 220#define Sigma0_512(x) (S64(28, (x)) ^ S64(34, (x)) ^ S64(39, (x))) 221#define Sigma1_512(x) (S64(14, (x)) ^ S64(18, (x)) ^ S64(41, (x))) 222#define sigma0_512(x) (S64( 1, (x)) ^ S64( 8, (x)) ^ R( 7, (x))) 223#define sigma1_512(x) (S64(19, (x)) ^ S64(61, (x)) ^ R( 6, (x))) 224 225/*** INTERNAL FUNCTION PROTOTYPES *************************************/ 226/* NOTE: These should not be accessed directly from outside this 227 * library -- they are intended for private internal visibility/use 228 * only. 229 */ 230void SHA512_Last(SHA512_CTX*); 231void SHA256_Transform(SHA256_CTX*, const sha2_word32*); 232void SHA512_Transform(SHA512_CTX*, const sha2_word64*); 233 234 235/*** SHA-XYZ INITIAL HASH VALUES AND CONSTANTS ************************/ 236/* Hash constant words K for SHA-256: */ 237static const sha2_word32 K256[64] = { 238 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL, 239 0x3956c25bUL, 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL, 240 0xd807aa98UL, 0x12835b01UL, 0x243185beUL, 0x550c7dc3UL, 241 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL, 0xc19bf174UL, 242 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL, 243 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL, 244 0x983e5152UL, 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL, 245 0xc6e00bf3UL, 0xd5a79147UL, 0x06ca6351UL, 0x14292967UL, 246 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL, 0x53380d13UL, 247 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL, 248 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL, 249 0xd192e819UL, 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL, 250 0x19a4c116UL, 0x1e376c08UL, 0x2748774cUL, 0x34b0bcb5UL, 251 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL, 0x682e6ff3UL, 252 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL, 253 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL 254}; 255 256/* Initial hash value H for SHA-256: */ 257static const sha2_word32 sha256_initial_hash_value[8] = { 258 0x6a09e667UL, 259 0xbb67ae85UL, 260 0x3c6ef372UL, 261 0xa54ff53aUL, 262 0x510e527fUL, 263 0x9b05688cUL, 264 0x1f83d9abUL, 265 0x5be0cd19UL 266}; 267 268/* Hash constant words K for SHA-384 and SHA-512: */ 269static const sha2_word64 K512[80] = { 270 ULL(0x428a2f98d728ae22), ULL(0x7137449123ef65cd), 271 ULL(0xb5c0fbcfec4d3b2f), ULL(0xe9b5dba58189dbbc), 272 ULL(0x3956c25bf348b538), ULL(0x59f111f1b605d019), 273 ULL(0x923f82a4af194f9b), ULL(0xab1c5ed5da6d8118), 274 ULL(0xd807aa98a3030242), ULL(0x12835b0145706fbe), 275 ULL(0x243185be4ee4b28c), ULL(0x550c7dc3d5ffb4e2), 276 ULL(0x72be5d74f27b896f), ULL(0x80deb1fe3b1696b1), 277 ULL(0x9bdc06a725c71235), ULL(0xc19bf174cf692694), 278 ULL(0xe49b69c19ef14ad2), ULL(0xefbe4786384f25e3), 279 ULL(0x0fc19dc68b8cd5b5), ULL(0x240ca1cc77ac9c65), 280 ULL(0x2de92c6f592b0275), ULL(0x4a7484aa6ea6e483), 281 ULL(0x5cb0a9dcbd41fbd4), ULL(0x76f988da831153b5), 282 ULL(0x983e5152ee66dfab), ULL(0xa831c66d2db43210), 283 ULL(0xb00327c898fb213f), ULL(0xbf597fc7beef0ee4), 284 ULL(0xc6e00bf33da88fc2), ULL(0xd5a79147930aa725), 285 ULL(0x06ca6351e003826f), ULL(0x142929670a0e6e70), 286 ULL(0x27b70a8546d22ffc), ULL(0x2e1b21385c26c926), 287 ULL(0x4d2c6dfc5ac42aed), ULL(0x53380d139d95b3df), 288 ULL(0x650a73548baf63de), ULL(0x766a0abb3c77b2a8), 289 ULL(0x81c2c92e47edaee6), ULL(0x92722c851482353b), 290 ULL(0xa2bfe8a14cf10364), ULL(0xa81a664bbc423001), 291 ULL(0xc24b8b70d0f89791), ULL(0xc76c51a30654be30), 292 ULL(0xd192e819d6ef5218), ULL(0xd69906245565a910), 293 ULL(0xf40e35855771202a), ULL(0x106aa07032bbd1b8), 294 ULL(0x19a4c116b8d2d0c8), ULL(0x1e376c085141ab53), 295 ULL(0x2748774cdf8eeb99), ULL(0x34b0bcb5e19b48a8), 296 ULL(0x391c0cb3c5c95a63), ULL(0x4ed8aa4ae3418acb), 297 ULL(0x5b9cca4f7763e373), ULL(0x682e6ff3d6b2b8a3), 298 ULL(0x748f82ee5defb2fc), ULL(0x78a5636f43172f60), 299 ULL(0x84c87814a1f0ab72), ULL(0x8cc702081a6439ec), 300 ULL(0x90befffa23631e28), ULL(0xa4506cebde82bde9), 301 ULL(0xbef9a3f7b2c67915), ULL(0xc67178f2e372532b), 302 ULL(0xca273eceea26619c), ULL(0xd186b8c721c0c207), 303 ULL(0xeada7dd6cde0eb1e), ULL(0xf57d4f7fee6ed178), 304 ULL(0x06f067aa72176fba), ULL(0x0a637dc5a2c898a6), 305 ULL(0x113f9804bef90dae), ULL(0x1b710b35131c471b), 306 ULL(0x28db77f523047d84), ULL(0x32caab7b40c72493), 307 ULL(0x3c9ebe0a15c9bebc), ULL(0x431d67c49c100d4c), 308 ULL(0x4cc5d4becb3e42b6), ULL(0x597f299cfc657e2a), 309 ULL(0x5fcb6fab3ad6faec), ULL(0x6c44198c4a475817) 310}; 311 312/* Initial hash value H for SHA-384 */ 313static const sha2_word64 sha384_initial_hash_value[8] = { 314 ULL(0xcbbb9d5dc1059ed8), 315 ULL(0x629a292a367cd507), 316 ULL(0x9159015a3070dd17), 317 ULL(0x152fecd8f70e5939), 318 ULL(0x67332667ffc00b31), 319 ULL(0x8eb44a8768581511), 320 ULL(0xdb0c2e0d64f98fa7), 321 ULL(0x47b5481dbefa4fa4) 322}; 323 324/* Initial hash value H for SHA-512 */ 325static const sha2_word64 sha512_initial_hash_value[8] = { 326 ULL(0x6a09e667f3bcc908), 327 ULL(0xbb67ae8584caa73b), 328 ULL(0x3c6ef372fe94f82b), 329 ULL(0xa54ff53a5f1d36f1), 330 ULL(0x510e527fade682d1), 331 ULL(0x9b05688c2b3e6c1f), 332 ULL(0x1f83d9abfb41bd6b), 333 ULL(0x5be0cd19137e2179) 334}; 335 336/* 337 * Constant used by SHA256/384/512_End() functions for converting the 338 * digest to a readable hexadecimal character string: 339 */ 340static const char *sha2_hex_digits = "0123456789abcdef"; 341 342 343/*** SHA-256: *********************************************************/ 344void SHA256_Init(SHA256_CTX* context) { 345 if (context == (SHA256_CTX*)0) { 346 return; 347 } 348 MEMCPY_BCOPY(context->state, sha256_initial_hash_value, SHA256_DIGEST_LENGTH); 349 MEMSET_BZERO(context->buffer, SHA256_BLOCK_LENGTH); 350 context->bitcount = 0; 351} 352 353#ifdef SHA2_UNROLL_TRANSFORM 354 355/* Unrolled SHA-256 round macros: */ 356 357#if BYTE_ORDER == LITTLE_ENDIAN 358 359#define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \ 360 REVERSE32(*data++, W256[j]); \ 361 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + \ 362 K256[j] + W256[j]; \ 363 (d) += T1; \ 364 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \ 365 j++ 366 367 368#else /* BYTE_ORDER == LITTLE_ENDIAN */ 369 370#define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \ 371 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + \ 372 K256[j] + (W256[j] = *data++); \ 373 (d) += T1; \ 374 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \ 375 j++ 376 377#endif /* BYTE_ORDER == LITTLE_ENDIAN */ 378 379#define ROUND256(a,b,c,d,e,f,g,h) \ 380 s0 = W256[(j+1)&0x0f]; \ 381 s0 = sigma0_256(s0); \ 382 s1 = W256[(j+14)&0x0f]; \ 383 s1 = sigma1_256(s1); \ 384 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + K256[j] + \ 385 (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0); \ 386 (d) += T1; \ 387 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \ 388 j++ 389 390void SHA256_Transform(SHA256_CTX* context, const sha2_word32* data) { 391 sha2_word32 a, b, c, d, e, f, g, h, s0, s1; 392 sha2_word32 T1, *W256; 393 int j; 394 395 W256 = (sha2_word32*)context->buffer; 396 397 /* Initialize registers with the prev. intermediate value */ 398 a = context->state[0]; 399 b = context->state[1]; 400 c = context->state[2]; 401 d = context->state[3]; 402 e = context->state[4]; 403 f = context->state[5]; 404 g = context->state[6]; 405 h = context->state[7]; 406 407 j = 0; 408 do { 409 /* Rounds 0 to 15 (unrolled): */ 410 ROUND256_0_TO_15(a,b,c,d,e,f,g,h); 411 ROUND256_0_TO_15(h,a,b,c,d,e,f,g); 412 ROUND256_0_TO_15(g,h,a,b,c,d,e,f); 413 ROUND256_0_TO_15(f,g,h,a,b,c,d,e); 414 ROUND256_0_TO_15(e,f,g,h,a,b,c,d); 415 ROUND256_0_TO_15(d,e,f,g,h,a,b,c); 416 ROUND256_0_TO_15(c,d,e,f,g,h,a,b); 417 ROUND256_0_TO_15(b,c,d,e,f,g,h,a); 418 } while (j < 16); 419 420 /* Now for the remaining rounds to 64: */ 421 do { 422 ROUND256(a,b,c,d,e,f,g,h); 423 ROUND256(h,a,b,c,d,e,f,g); 424 ROUND256(g,h,a,b,c,d,e,f); 425 ROUND256(f,g,h,a,b,c,d,e); 426 ROUND256(e,f,g,h,a,b,c,d); 427 ROUND256(d,e,f,g,h,a,b,c); 428 ROUND256(c,d,e,f,g,h,a,b); 429 ROUND256(b,c,d,e,f,g,h,a); 430 } while (j < 64); 431 432 /* Compute the current intermediate hash value */ 433 context->state[0] += a; 434 context->state[1] += b; 435 context->state[2] += c; 436 context->state[3] += d; 437 context->state[4] += e; 438 context->state[5] += f; 439 context->state[6] += g; 440 context->state[7] += h; 441 442 /* Clean up */ 443 a = b = c = d = e = f = g = h = T1 = 0; 444} 445 446#else /* SHA2_UNROLL_TRANSFORM */ 447 448void SHA256_Transform(SHA256_CTX* context, const sha2_word32* data) { 449 sha2_word32 a, b, c, d, e, f, g, h, s0, s1; 450 sha2_word32 T1, T2, *W256; 451 int j; 452 453 W256 = (sha2_word32*)context->buffer; 454 455 /* Initialize registers with the prev. intermediate value */ 456 a = context->state[0]; 457 b = context->state[1]; 458 c = context->state[2]; 459 d = context->state[3]; 460 e = context->state[4]; 461 f = context->state[5]; 462 g = context->state[6]; 463 h = context->state[7]; 464 465 j = 0; 466 do { 467#if BYTE_ORDER == LITTLE_ENDIAN 468 /* Copy data while converting to host byte order */ 469 REVERSE32(*data++,W256[j]); 470 /* Apply the SHA-256 compression function to update a..h */ 471 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + W256[j]; 472#else /* BYTE_ORDER == LITTLE_ENDIAN */ 473 /* Apply the SHA-256 compression function to update a..h with copy */ 474 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + (W256[j] = *data++); 475#endif /* BYTE_ORDER == LITTLE_ENDIAN */ 476 T2 = Sigma0_256(a) + Maj(a, b, c); 477 h = g; 478 g = f; 479 f = e; 480 e = d + T1; 481 d = c; 482 c = b; 483 b = a; 484 a = T1 + T2; 485 486 j++; 487 } while (j < 16); 488 489 do { 490 /* Part of the message block expansion: */ 491 s0 = W256[(j+1)&0x0f]; 492 s0 = sigma0_256(s0); 493 s1 = W256[(j+14)&0x0f]; 494 s1 = sigma1_256(s1); 495 496 /* Apply the SHA-256 compression function to update a..h */ 497 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + 498 (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0); 499 T2 = Sigma0_256(a) + Maj(a, b, c); 500 h = g; 501 g = f; 502 f = e; 503 e = d + T1; 504 d = c; 505 c = b; 506 b = a; 507 a = T1 + T2; 508 509 j++; 510 } while (j < 64); 511 512 /* Compute the current intermediate hash value */ 513 context->state[0] += a; 514 context->state[1] += b; 515 context->state[2] += c; 516 context->state[3] += d; 517 context->state[4] += e; 518 context->state[5] += f; 519 context->state[6] += g; 520 context->state[7] += h; 521 522 /* Clean up */ 523 a = b = c = d = e = f = g = h = T1 = T2 = 0; 524} 525 526#endif /* SHA2_UNROLL_TRANSFORM */ 527 528void SHA256_Update(SHA256_CTX* context, const sha2_byte *data, size_t len) { 529 unsigned int freespace, usedspace; 530 531 if (len == 0) { 532 /* Calling with no data is valid - we do nothing */ 533 return; 534 } 535 536 /* Sanity check: */ 537 assert(context != (SHA256_CTX*)0 && data != (sha2_byte*)0); 538 539 usedspace = (unsigned int)((context->bitcount >> 3) % SHA256_BLOCK_LENGTH); 540 if (usedspace > 0) { 541 /* Calculate how much free space is available in the buffer */ 542 freespace = SHA256_BLOCK_LENGTH - usedspace; 543 544 if (len >= freespace) { 545 /* Fill the buffer completely and process it */ 546 MEMCPY_BCOPY(&context->buffer[usedspace], data, freespace); 547 context->bitcount += freespace << 3; 548 len -= freespace; 549 data += freespace; 550 SHA256_Transform(context, (sha2_word32*)context->buffer); 551 } else { 552 /* The buffer is not yet full */ 553 MEMCPY_BCOPY(&context->buffer[usedspace], data, len); 554 context->bitcount += len << 3; 555 /* Clean up: */ 556 usedspace = freespace = 0; 557 return; 558 } 559 } 560 while (len >= SHA256_BLOCK_LENGTH) { 561 /* Process as many complete blocks as we can */ 562 MEMCPY_BCOPY(context->buffer, data, SHA256_BLOCK_LENGTH); 563 SHA256_Transform(context, (sha2_word32*)context->buffer); 564 context->bitcount += SHA256_BLOCK_LENGTH << 3; 565 len -= SHA256_BLOCK_LENGTH; 566 data += SHA256_BLOCK_LENGTH; 567 } 568 if (len > 0) { 569 /* There's left-overs, so save 'em */ 570 MEMCPY_BCOPY(context->buffer, data, len); 571 context->bitcount += len << 3; 572 } 573 /* Clean up: */ 574 usedspace = freespace = 0; 575} 576 577void SHA256_Final(sha2_byte digest[], SHA256_CTX* context) { 578 sha2_word32 *d = (sha2_word32*)digest; 579 unsigned int usedspace; 580 581 /* Sanity check: */ 582 assert(context != (SHA256_CTX*)0); 583 584 /* If no digest buffer is passed, we don't bother doing this: */ 585 if (digest != (sha2_byte*)0) { 586 usedspace = (unsigned int)((context->bitcount >> 3) % SHA256_BLOCK_LENGTH); 587#if BYTE_ORDER == LITTLE_ENDIAN 588 /* Convert FROM host byte order */ 589 REVERSE64(context->bitcount,context->bitcount); 590#endif 591 if (usedspace > 0) { 592 /* Begin padding with a 1 bit: */ 593 context->buffer[usedspace++] = 0x80; 594 595 if (usedspace <= SHA256_SHORT_BLOCK_LENGTH) { 596 /* Set-up for the last transform: */ 597 MEMSET_BZERO(&context->buffer[usedspace], SHA256_SHORT_BLOCK_LENGTH - usedspace); 598 } else { 599 if (usedspace < SHA256_BLOCK_LENGTH) { 600 MEMSET_BZERO(&context->buffer[usedspace], SHA256_BLOCK_LENGTH - usedspace); 601 } 602 /* Do second-to-last transform: */ 603 SHA256_Transform(context, (sha2_word32*)context->buffer); 604 605 /* And set-up for the last transform: */ 606 MEMSET_BZERO(context->buffer, SHA256_SHORT_BLOCK_LENGTH); 607 } 608 } else { 609 /* Set-up for the last transform: */ 610 MEMSET_BZERO(context->buffer, SHA256_SHORT_BLOCK_LENGTH); 611 612 /* Begin padding with a 1 bit: */ 613 *context->buffer = 0x80; 614 } 615 /* Set the bit count: */ 616 *(sha2_word64*)&context->buffer[SHA256_SHORT_BLOCK_LENGTH] = context->bitcount; 617 618 /* Final transform: */ 619 SHA256_Transform(context, (sha2_word32*)context->buffer); 620 621#if BYTE_ORDER == LITTLE_ENDIAN 622 { 623 /* Convert TO host byte order */ 624 int j; 625 for (j = 0; j < 8; j++) { 626 REVERSE32(context->state[j],context->state[j]); 627 *d++ = context->state[j]; 628 } 629 } 630#else 631 MEMCPY_BCOPY(d, context->state, SHA256_DIGEST_LENGTH); 632#endif 633 } 634 635 /* Clean up state data: */ 636 MEMSET_BZERO(context, sizeof(*context)); 637 usedspace = 0; 638} 639 640char *SHA256_End(SHA256_CTX* context, char buffer[]) { 641 sha2_byte digest[SHA256_DIGEST_LENGTH], *d = digest; 642 int i; 643 644 /* Sanity check: */ 645 assert(context != (SHA256_CTX*)0); 646 647 if (buffer != (char*)0) { 648 SHA256_Final(digest, context); 649 for (i = 0; i < SHA256_DIGEST_LENGTH; i++) { 650 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4]; 651 *buffer++ = sha2_hex_digits[*d & 0x0f]; 652 d++; 653 } 654 *buffer = (char)0; 655 } else { 656 MEMSET_BZERO(context, sizeof(*context)); 657 } 658 MEMSET_BZERO(digest, SHA256_DIGEST_LENGTH); 659 return buffer; 660} 661 662char* SHA256_Data(const sha2_byte* data, size_t len, char digest[SHA256_DIGEST_STRING_LENGTH]) { 663 SHA256_CTX context; 664 665 SHA256_Init(&context); 666 SHA256_Update(&context, data, len); 667 return SHA256_End(&context, digest); 668} 669 670 671/*** SHA-512: *********************************************************/ 672void SHA512_Init(SHA512_CTX* context) { 673 if (context == (SHA512_CTX*)0) { 674 return; 675 } 676 MEMCPY_BCOPY(context->state, sha512_initial_hash_value, SHA512_DIGEST_LENGTH); 677 MEMSET_BZERO(context->buffer, SHA512_BLOCK_LENGTH); 678 context->bitcount[0] = context->bitcount[1] = 0; 679} 680 681#ifdef SHA2_UNROLL_TRANSFORM 682 683/* Unrolled SHA-512 round macros: */ 684#if BYTE_ORDER == LITTLE_ENDIAN 685 686#define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \ 687 REVERSE64(*data++, W512[j]); \ 688 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + \ 689 K512[j] + W512[j]; \ 690 (d) += T1, \ 691 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)), \ 692 j++ 693 694 695#else /* BYTE_ORDER == LITTLE_ENDIAN */ 696 697#define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \ 698 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + \ 699 K512[j] + (W512[j] = *data++); \ 700 (d) += T1; \ 701 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \ 702 j++ 703 704#endif /* BYTE_ORDER == LITTLE_ENDIAN */ 705 706#define ROUND512(a,b,c,d,e,f,g,h) \ 707 s0 = W512[(j+1)&0x0f]; \ 708 s0 = sigma0_512(s0); \ 709 s1 = W512[(j+14)&0x0f]; \ 710 s1 = sigma1_512(s1); \ 711 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + K512[j] + \ 712 (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0); \ 713 (d) += T1; \ 714 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \ 715 j++ 716 717void SHA512_Transform(SHA512_CTX* context, const sha2_word64* data) { 718 sha2_word64 a, b, c, d, e, f, g, h, s0, s1; 719 sha2_word64 T1, *W512 = (sha2_word64*)context->buffer; 720 int j; 721 722 /* Initialize registers with the prev. intermediate value */ 723 a = context->state[0]; 724 b = context->state[1]; 725 c = context->state[2]; 726 d = context->state[3]; 727 e = context->state[4]; 728 f = context->state[5]; 729 g = context->state[6]; 730 h = context->state[7]; 731 732 j = 0; 733 do { 734 ROUND512_0_TO_15(a,b,c,d,e,f,g,h); 735 ROUND512_0_TO_15(h,a,b,c,d,e,f,g); 736 ROUND512_0_TO_15(g,h,a,b,c,d,e,f); 737 ROUND512_0_TO_15(f,g,h,a,b,c,d,e); 738 ROUND512_0_TO_15(e,f,g,h,a,b,c,d); 739 ROUND512_0_TO_15(d,e,f,g,h,a,b,c); 740 ROUND512_0_TO_15(c,d,e,f,g,h,a,b); 741 ROUND512_0_TO_15(b,c,d,e,f,g,h,a); 742 } while (j < 16); 743 744 /* Now for the remaining rounds up to 79: */ 745 do { 746 ROUND512(a,b,c,d,e,f,g,h); 747 ROUND512(h,a,b,c,d,e,f,g); 748 ROUND512(g,h,a,b,c,d,e,f); 749 ROUND512(f,g,h,a,b,c,d,e); 750 ROUND512(e,f,g,h,a,b,c,d); 751 ROUND512(d,e,f,g,h,a,b,c); 752 ROUND512(c,d,e,f,g,h,a,b); 753 ROUND512(b,c,d,e,f,g,h,a); 754 } while (j < 80); 755 756 /* Compute the current intermediate hash value */ 757 context->state[0] += a; 758 context->state[1] += b; 759 context->state[2] += c; 760 context->state[3] += d; 761 context->state[4] += e; 762 context->state[5] += f; 763 context->state[6] += g; 764 context->state[7] += h; 765 766 /* Clean up */ 767 a = b = c = d = e = f = g = h = T1 = 0; 768} 769 770#else /* SHA2_UNROLL_TRANSFORM */ 771 772void SHA512_Transform(SHA512_CTX* context, const sha2_word64* data) { 773 sha2_word64 a, b, c, d, e, f, g, h, s0, s1; 774 sha2_word64 T1, T2, *W512 = (sha2_word64*)context->buffer; 775 int j; 776 777 /* Initialize registers with the prev. intermediate value */ 778 a = context->state[0]; 779 b = context->state[1]; 780 c = context->state[2]; 781 d = context->state[3]; 782 e = context->state[4]; 783 f = context->state[5]; 784 g = context->state[6]; 785 h = context->state[7]; 786 787 j = 0; 788 do { 789#if BYTE_ORDER == LITTLE_ENDIAN 790 /* Convert TO host byte order */ 791 REVERSE64(*data++, W512[j]); 792 /* Apply the SHA-512 compression function to update a..h */ 793 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + W512[j]; 794#else /* BYTE_ORDER == LITTLE_ENDIAN */ 795 /* Apply the SHA-512 compression function to update a..h with copy */ 796 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + (W512[j] = *data++); 797#endif /* BYTE_ORDER == LITTLE_ENDIAN */ 798 T2 = Sigma0_512(a) + Maj(a, b, c); 799 h = g; 800 g = f; 801 f = e; 802 e = d + T1; 803 d = c; 804 c = b; 805 b = a; 806 a = T1 + T2; 807 808 j++; 809 } while (j < 16); 810 811 do { 812 /* Part of the message block expansion: */ 813 s0 = W512[(j+1)&0x0f]; 814 s0 = sigma0_512(s0); 815 s1 = W512[(j+14)&0x0f]; 816 s1 = sigma1_512(s1); 817 818 /* Apply the SHA-512 compression function to update a..h */ 819 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + 820 (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0); 821 T2 = Sigma0_512(a) + Maj(a, b, c); 822 h = g; 823 g = f; 824 f = e; 825 e = d + T1; 826 d = c; 827 c = b; 828 b = a; 829 a = T1 + T2; 830 831 j++; 832 } while (j < 80); 833 834 /* Compute the current intermediate hash value */ 835 context->state[0] += a; 836 context->state[1] += b; 837 context->state[2] += c; 838 context->state[3] += d; 839 context->state[4] += e; 840 context->state[5] += f; 841 context->state[6] += g; 842 context->state[7] += h; 843 844 /* Clean up */ 845 a = b = c = d = e = f = g = h = T1 = T2 = 0; 846} 847 848#endif /* SHA2_UNROLL_TRANSFORM */ 849 850void SHA512_Update(SHA512_CTX* context, const sha2_byte *data, size_t len) { 851 unsigned int freespace, usedspace; 852 853 if (len == 0) { 854 /* Calling with no data is valid - we do nothing */ 855 return; 856 } 857 858 /* Sanity check: */ 859 assert(context != (SHA512_CTX*)0 && data != (sha2_byte*)0); 860 861 usedspace = (unsigned int)((context->bitcount[0] >> 3) % SHA512_BLOCK_LENGTH); 862 if (usedspace > 0) { 863 /* Calculate how much free space is available in the buffer */ 864 freespace = SHA512_BLOCK_LENGTH - usedspace; 865 866 if (len >= freespace) { 867 /* Fill the buffer completely and process it */ 868 MEMCPY_BCOPY(&context->buffer[usedspace], data, freespace); 869 ADDINC128(context->bitcount, freespace << 3); 870 len -= freespace; 871 data += freespace; 872 SHA512_Transform(context, (sha2_word64*)context->buffer); 873 } else { 874 /* The buffer is not yet full */ 875 MEMCPY_BCOPY(&context->buffer[usedspace], data, len); 876 ADDINC128(context->bitcount, len << 3); 877 /* Clean up: */ 878 usedspace = freespace = 0; 879 return; 880 } 881 } 882 while (len >= SHA512_BLOCK_LENGTH) { 883 /* Process as many complete blocks as we can */ 884 MEMCPY_BCOPY(context->buffer, data, SHA512_BLOCK_LENGTH); 885 SHA512_Transform(context, (sha2_word64*)context->buffer); 886 ADDINC128(context->bitcount, SHA512_BLOCK_LENGTH << 3); 887 len -= SHA512_BLOCK_LENGTH; 888 data += SHA512_BLOCK_LENGTH; 889 } 890 if (len > 0) { 891 /* There's left-overs, so save 'em */ 892 MEMCPY_BCOPY(context->buffer, data, len); 893 ADDINC128(context->bitcount, len << 3); 894 } 895 /* Clean up: */ 896 usedspace = freespace = 0; 897} 898 899void SHA512_Last(SHA512_CTX* context) { 900 unsigned int usedspace; 901 902 usedspace = (unsigned int)((context->bitcount[0] >> 3) % SHA512_BLOCK_LENGTH); 903#if BYTE_ORDER == LITTLE_ENDIAN 904 /* Convert FROM host byte order */ 905 REVERSE64(context->bitcount[0],context->bitcount[0]); 906 REVERSE64(context->bitcount[1],context->bitcount[1]); 907#endif 908 if (usedspace > 0) { 909 /* Begin padding with a 1 bit: */ 910 context->buffer[usedspace++] = 0x80; 911 912 if (usedspace <= SHA512_SHORT_BLOCK_LENGTH) { 913 /* Set-up for the last transform: */ 914 MEMSET_BZERO(&context->buffer[usedspace], SHA512_SHORT_BLOCK_LENGTH - usedspace); 915 } else { 916 if (usedspace < SHA512_BLOCK_LENGTH) { 917 MEMSET_BZERO(&context->buffer[usedspace], SHA512_BLOCK_LENGTH - usedspace); 918 } 919 /* Do second-to-last transform: */ 920 SHA512_Transform(context, (sha2_word64*)context->buffer); 921 922 /* And set-up for the last transform: */ 923 MEMSET_BZERO(context->buffer, SHA512_BLOCK_LENGTH - 2); 924 } 925 } else { 926 /* Prepare for final transform: */ 927 MEMSET_BZERO(context->buffer, SHA512_SHORT_BLOCK_LENGTH); 928 929 /* Begin padding with a 1 bit: */ 930 *context->buffer = 0x80; 931 } 932 /* Store the length of input data (in bits): */ 933 *(sha2_word64*)&context->buffer[SHA512_SHORT_BLOCK_LENGTH] = context->bitcount[1]; 934 *(sha2_word64*)&context->buffer[SHA512_SHORT_BLOCK_LENGTH+8] = context->bitcount[0]; 935 936 /* Final transform: */ 937 SHA512_Transform(context, (sha2_word64*)context->buffer); 938} 939 940void SHA512_Final(sha2_byte digest[], SHA512_CTX* context) { 941 sha2_word64 *d = (sha2_word64*)digest; 942 943 /* Sanity check: */ 944 assert(context != (SHA512_CTX*)0); 945 946 /* If no digest buffer is passed, we don't bother doing this: */ 947 if (digest != (sha2_byte*)0) { 948 SHA512_Last(context); 949 950 /* Save the hash data for output: */ 951#if BYTE_ORDER == LITTLE_ENDIAN 952 { 953 /* Convert TO host byte order */ 954 int j; 955 for (j = 0; j < 8; j++) { 956 REVERSE64(context->state[j],context->state[j]); 957 *d++ = context->state[j]; 958 } 959 } 960#else 961 MEMCPY_BCOPY(d, context->state, SHA512_DIGEST_LENGTH); 962#endif 963 } 964 965 /* Zero out state data */ 966 MEMSET_BZERO(context, sizeof(*context)); 967} 968 969char *SHA512_End(SHA512_CTX* context, char buffer[]) { 970 sha2_byte digest[SHA512_DIGEST_LENGTH], *d = digest; 971 int i; 972 973 /* Sanity check: */ 974 assert(context != (SHA512_CTX*)0); 975 976 if (buffer != (char*)0) { 977 SHA512_Final(digest, context); 978 for (i = 0; i < SHA512_DIGEST_LENGTH; i++) { 979 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4]; 980 *buffer++ = sha2_hex_digits[*d & 0x0f]; 981 d++; 982 } 983 *buffer = (char)0; 984 } else { 985 MEMSET_BZERO(context, sizeof(*context)); 986 } 987 MEMSET_BZERO(digest, SHA512_DIGEST_LENGTH); 988 return buffer; 989} 990 991char* SHA512_Data(const sha2_byte* data, size_t len, char digest[SHA512_DIGEST_STRING_LENGTH]) { 992 SHA512_CTX context; 993 994 SHA512_Init(&context); 995 SHA512_Update(&context, data, len); 996 return SHA512_End(&context, digest); 997} 998 999 1000/*** SHA-384: *********************************************************/ 1001void SHA384_Init(SHA384_CTX* context) { 1002 if (context == (SHA384_CTX*)0) { 1003 return; 1004 } 1005 MEMCPY_BCOPY(context->state, sha384_initial_hash_value, SHA512_DIGEST_LENGTH); 1006 MEMSET_BZERO(context->buffer, SHA384_BLOCK_LENGTH); 1007 context->bitcount[0] = context->bitcount[1] = 0; 1008} 1009 1010void SHA384_Update(SHA384_CTX* context, const sha2_byte* data, size_t len) { 1011 SHA512_Update((SHA512_CTX*)context, data, len); 1012} 1013 1014void SHA384_Final(sha2_byte digest[], SHA384_CTX* context) { 1015 sha2_word64 *d = (sha2_word64*)digest; 1016 1017 /* Sanity check: */ 1018 assert(context != (SHA384_CTX*)0); 1019 1020 /* If no digest buffer is passed, we don't bother doing this: */ 1021 if (digest != (sha2_byte*)0) { 1022 SHA512_Last((SHA512_CTX*)context); 1023 1024 /* Save the hash data for output: */ 1025#if BYTE_ORDER == LITTLE_ENDIAN 1026 { 1027 /* Convert TO host byte order */ 1028 int j; 1029 for (j = 0; j < 6; j++) { 1030 REVERSE64(context->state[j],context->state[j]); 1031 *d++ = context->state[j]; 1032 } 1033 } 1034#else 1035 MEMCPY_BCOPY(d, context->state, SHA384_DIGEST_LENGTH); 1036#endif 1037 } 1038 1039 /* Zero out state data */ 1040 MEMSET_BZERO(context, sizeof(*context)); 1041} 1042 1043char *SHA384_End(SHA384_CTX* context, char buffer[]) { 1044 sha2_byte digest[SHA384_DIGEST_LENGTH], *d = digest; 1045 int i; 1046 1047 /* Sanity check: */ 1048 assert(context != (SHA384_CTX*)0); 1049 1050 if (buffer != (char*)0) { 1051 SHA384_Final(digest, context); 1052 for (i = 0; i < SHA384_DIGEST_LENGTH; i++) { 1053 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4]; 1054 *buffer++ = sha2_hex_digits[*d & 0x0f]; 1055 d++; 1056 } 1057 *buffer = (char)0; 1058 } else { 1059 MEMSET_BZERO(context, sizeof(*context)); 1060 } 1061 MEMSET_BZERO(digest, SHA384_DIGEST_LENGTH); 1062 return buffer; 1063} 1064 1065char* SHA384_Data(const sha2_byte* data, size_t len, char digest[SHA384_DIGEST_STRING_LENGTH]) { 1066 SHA384_CTX context; 1067 1068 SHA384_Init(&context); 1069 SHA384_Update(&context, data, len); 1070 return SHA384_End(&context, digest); 1071} 1072 1073