4 * include the license notice into the dynamic library to "reproduce the
5 * copyright notice" automatically, so the application developer does not have
6 * to care about this term
8 const char *d0_sha2_c_bsd_license_notice D0_USED = "\n"
11 " * AUTHOR: Aaron D. Gifford - http://www.aarongifford.com/\n"
13 " * Copyright (c) 2000-2001, Aaron D. Gifford\n"
14 " * All rights reserved.\n"
16 " * Redistribution and use in source and binary forms, with or without\n"
17 " * modification, are permitted provided that the following conditions\n"
19 " * 1. Redistributions of source code must retain the above copyright\n"
20 " * notice, this list of conditions and the following disclaimer.\n"
21 " * 2. Redistributions in binary form must reproduce the above copyright\n"
22 " * notice, this list of conditions and the following disclaimer in the\n"
23 " * documentation and/or other materials provided with the distribution.\n"
24 " * 3. Neither the name of the copyright holder nor the names of contributors\n"
25 " * may be used to endorse or promote products derived from this software\n"
26 " * without specific prior written permission.\n"
28 " * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``AS IS'' AND\n"
29 " * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n"
30 " * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n"
31 " * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTOR(S) BE LIABLE\n"
32 " * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n"
33 " * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n"
34 " * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n"
35 " * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n"
36 " * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n"
37 " * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n"
40 " * $Original-Id: sha2.c,v 1.1 2001/11/08 00:01:51 adg Exp adg $\n"
43 #include <string.h> /* memcpy()/memset() or bcopy()/bzero() */
44 #include <assert.h> /* assert() */
49 * Some sanity checking code is included using assert(). On my FreeBSD
50 * system, this additional code can be removed by compiling with NDEBUG
51 * defined. Check your own systems manpage on assert() to see how to
52 * compile WITHOUT the sanity checking code on your system.
54 * UNROLLED TRANSFORM LOOP NOTE:
55 * You can define SHA2_UNROLL_TRANSFORM to use the unrolled transform
56 * loop version for the hash transform rounds (defined using macros
57 * later in this file). Either define on the command line, for example:
59 * cc -DSHA2_UNROLL_TRANSFORM -o sha2 sha2.c sha2prog.c
63 * #define SHA2_UNROLL_TRANSFORM
68 /*** SHA-256/384/512 Machine Architecture Definitions *****************/
72 * Please make sure that your system defines BYTE_ORDER. If your
73 * architecture is little-endian, make sure it also defines
74 * LITTLE_ENDIAN and that the two (BYTE_ORDER and LITTLE_ENDIAN) are
77 * If your system does not define the above, then you can do so by
80 * #define LITTLE_ENDIAN 1234
81 * #define BIG_ENDIAN 4321
83 * And for little-endian machines, add:
85 * #define BYTE_ORDER LITTLE_ENDIAN
87 * Or for big-endian machines:
89 * #define BYTE_ORDER BIG_ENDIAN
91 * The FreeBSD machine this was written on defines BYTE_ORDER
92 * appropriately by including <sys/types.h> (which in turn includes
93 * <machine/endian.h> where the appropriate definitions are actually
96 #if !defined(BYTE_ORDER) || (BYTE_ORDER != LITTLE_ENDIAN && BYTE_ORDER != BIG_ENDIAN)
97 #error Define BYTE_ORDER to be equal to either LITTLE_ENDIAN or BIG_ENDIAN
101 * Define the followingsha2_* types to types of the correct length on
102 * the native archtecture. Most BSD systems and Linux define u_intXX_t
103 * types. Machines with very recent ANSI C headers, can use the
104 * uintXX_t definintions from inttypes.h by defining SHA2_USE_INTTYPES_H
105 * during compile or in the sha.h header file.
107 * Machines that support neither u_intXX_t nor inttypes.h's uintXX_t
108 * will need to define these three typedefs below (and the appropriate
109 * ones in sha.h too) by hand according to their system architecture.
111 * Thank you, Jun-ichiro itojun Hagino, for suggesting using u_intXX_t
112 * types and pointing out recent ANSI C support for uintXX_t in inttypes.h.
114 #ifdef SHA2_USE_INTTYPES_H
116 typedef uint8_t sha2_byte; /* Exactly 1 byte */
117 typedef uint32_t sha2_word32; /* Exactly 4 bytes */
118 typedef uint64_t sha2_word64; /* Exactly 8 bytes */
120 #else /* SHA2_USE_INTTYPES_H */
122 typedef u_int8_t sha2_byte; /* Exactly 1 byte */
123 typedef u_int32_t sha2_word32; /* Exactly 4 bytes */
124 typedef u_int64_t sha2_word64; /* Exactly 8 bytes */
126 #endif /* SHA2_USE_INTTYPES_H */
129 /*** SHA-256/384/512 Various Length Definitions ***********************/
130 /* NOTE: Most of these are in sha2.h */
131 #define SHA256_SHORT_BLOCK_LENGTH (SHA256_BLOCK_LENGTH - 8)
132 #define SHA384_SHORT_BLOCK_LENGTH (SHA384_BLOCK_LENGTH - 16)
133 #define SHA512_SHORT_BLOCK_LENGTH (SHA512_BLOCK_LENGTH - 16)
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 & 0xff00ff00UL) >> 8) | ((tmp & 0x00ff00ffUL) << 8); \
143 #define REVERSE64(w,x) { \
144 sha2_word64 tmp = (w); \
145 tmp = (tmp >> 32) | (tmp << 32); \
146 tmp = ((tmp & 0xff00ff00ff00ff00ULL) >> 8) | \
147 ((tmp & 0x00ff00ff00ff00ffULL) << 8); \
148 (x) = ((tmp & 0xffff0000ffff0000ULL) >> 16) | \
149 ((tmp & 0x0000ffff0000ffffULL) << 16); \
151 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
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
158 #define ADDINC128(w,n) { \
159 (w)[0] += (sha2_word64)(n); \
160 if ((w)[0] < (n)) { \
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().
170 * Please define either SHA2_USE_MEMSET_MEMCPY or define
171 * SHA2_USE_BZERO_BCOPY depending on which function set you
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
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!
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))
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))
194 #define MEMSET_BZERO(p, l) memset_s((p), (l), 0, (l))
195 #elif HAVE_EXPLICIT_BZERO
197 #define MEMSET_BZERO(p, l) explicit_bzero((p), (l))
201 /*** THE SIX LOGICAL FUNCTIONS ****************************************/
203 * Bit shifting and rotation (used by the six SHA-XYZ logical functions:
205 * NOTE: The naming of R and S appears backwards here (R is a SHIFT and
206 * S is a ROTATION) because the SHA-256/384/512 description document
207 * (see http://csrc.nist.gov/cryptval/shs/sha256-384-512.pdf) uses this
208 * same "backwards" definition.
210 /* Shift-right (used in SHA-256, SHA-384, and SHA-512): */
211 #define R(b,x) ((x) >> (b))
212 /* 32-bit Rotate-right (used in SHA-256): */
213 #define S32(b,x) (((x) >> (b)) | ((x) << (32 - (b))))
214 /* 64-bit Rotate-right (used in SHA-384 and SHA-512): */
215 #define S64(b,x) (((x) >> (b)) | ((x) << (64 - (b))))
217 /* Two of six logical functions used in SHA-256, SHA-384, and SHA-512: */
218 #define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
219 #define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
221 /* Four of six logical functions used in SHA-256: */
222 #define Sigma0_256(x) (S32(2, (x)) ^ S32(13, (x)) ^ S32(22, (x)))
223 #define Sigma1_256(x) (S32(6, (x)) ^ S32(11, (x)) ^ S32(25, (x)))
224 #define sigma0_256(x) (S32(7, (x)) ^ S32(18, (x)) ^ R(3 , (x)))
225 #define sigma1_256(x) (S32(17, (x)) ^ S32(19, (x)) ^ R(10, (x)))
227 /* Four of six logical functions used in SHA-384 and SHA-512: */
228 #define Sigma0_512(x) (S64(28, (x)) ^ S64(34, (x)) ^ S64(39, (x)))
229 #define Sigma1_512(x) (S64(14, (x)) ^ S64(18, (x)) ^ S64(41, (x)))
230 #define sigma0_512(x) (S64( 1, (x)) ^ S64( 8, (x)) ^ R( 7, (x)))
231 #define sigma1_512(x) (S64(19, (x)) ^ S64(61, (x)) ^ R( 6, (x)))
233 /*** INTERNAL FUNCTION PROTOTYPES *************************************/
234 /* NOTE: These should not be accessed directly from outside this
235 * library -- they are intended for private internal visibility/use
238 void SHA512_Last(SHA512_CTX*);
239 void SHA256_Transform(SHA256_CTX*, const sha2_word32*);
240 void SHA512_Transform(SHA512_CTX*, const sha2_word64*);
243 /*** SHA-XYZ INITIAL HASH VALUES AND CONSTANTS ************************/
244 /* Hash constant words K for SHA-256: */
245 const static sha2_word32 K256[64] = {
246 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL,
247 0x3956c25bUL, 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL,
248 0xd807aa98UL, 0x12835b01UL, 0x243185beUL, 0x550c7dc3UL,
249 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL, 0xc19bf174UL,
250 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL,
251 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL,
252 0x983e5152UL, 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL,
253 0xc6e00bf3UL, 0xd5a79147UL, 0x06ca6351UL, 0x14292967UL,
254 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL, 0x53380d13UL,
255 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL,
256 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL,
257 0xd192e819UL, 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL,
258 0x19a4c116UL, 0x1e376c08UL, 0x2748774cUL, 0x34b0bcb5UL,
259 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL, 0x682e6ff3UL,
260 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL,
261 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL
264 /* Initial hash value H for SHA-256: */
265 const static sha2_word32 sha256_initial_hash_value[8] = {
276 /* Hash constant words K for SHA-384 and SHA-512: */
277 const static sha2_word64 K512[80] = {
278 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL,
279 0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,
280 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
281 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,
282 0xd807aa98a3030242ULL, 0x12835b0145706fbeULL,
283 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
284 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL,
285 0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,
286 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
287 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,
288 0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL,
289 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
290 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL,
291 0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,
292 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
293 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,
294 0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL,
295 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
296 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL,
297 0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,
298 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
299 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,
300 0xd192e819d6ef5218ULL, 0xd69906245565a910ULL,
301 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
302 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL,
303 0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,
304 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
305 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,
306 0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL,
307 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
308 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL,
309 0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,
310 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
311 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,
312 0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL,
313 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
314 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL,
315 0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,
316 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
317 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL
320 /* Initial hash value H for SHA-384 */
321 const static sha2_word64 sha384_initial_hash_value[8] = {
322 0xcbbb9d5dc1059ed8ULL,
323 0x629a292a367cd507ULL,
324 0x9159015a3070dd17ULL,
325 0x152fecd8f70e5939ULL,
326 0x67332667ffc00b31ULL,
327 0x8eb44a8768581511ULL,
328 0xdb0c2e0d64f98fa7ULL,
329 0x47b5481dbefa4fa4ULL
332 /* Initial hash value H for SHA-512 */
333 const static sha2_word64 sha512_initial_hash_value[8] = {
334 0x6a09e667f3bcc908ULL,
335 0xbb67ae8584caa73bULL,
336 0x3c6ef372fe94f82bULL,
337 0xa54ff53a5f1d36f1ULL,
338 0x510e527fade682d1ULL,
339 0x9b05688c2b3e6c1fULL,
340 0x1f83d9abfb41bd6bULL,
341 0x5be0cd19137e2179ULL
345 * Constant used by SHA256/384/512_End() functions for converting the
346 * digest to a readable hexadecimal character string:
348 static const char *sha2_hex_digits = "0123456789abcdef";
351 /*** SHA-256: *********************************************************/
352 void SHA256_Init(SHA256_CTX* context) {
353 if (context == (SHA256_CTX*)0) {
356 MEMCPY_BCOPY(context->state, sha256_initial_hash_value, SHA256_DIGEST_LENGTH);
357 MEMSET_BZERO(context->buffer, SHA256_BLOCK_LENGTH);
358 context->bitcount = 0;
361 #ifdef SHA2_UNROLL_TRANSFORM
363 /* Unrolled SHA-256 round macros: */
365 #if BYTE_ORDER == LITTLE_ENDIAN
367 #define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \
368 REVERSE32(*data++, W256[j]); \
369 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + \
372 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \
376 #else /* BYTE_ORDER == LITTLE_ENDIAN */
378 #define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \
379 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + \
380 K256[j] + (W256[j] = *data++); \
382 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \
385 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
387 #define ROUND256(a,b,c,d,e,f,g,h) \
388 s0 = W256[(j+1)&0x0f]; \
389 s0 = sigma0_256(s0); \
390 s1 = W256[(j+14)&0x0f]; \
391 s1 = sigma1_256(s1); \
392 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + K256[j] + \
393 (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0); \
395 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \
398 void SHA256_Transform(SHA256_CTX* context, const sha2_word32* data) {
399 sha2_word32 a, b, c, d, e, f, g, h, s0, s1;
400 sha2_word32 T1, *W256;
403 W256 = (sha2_word32*)context->buffer;
405 /* Initialize registers with the prev. intermediate value */
406 a = context->state[0];
407 b = context->state[1];
408 c = context->state[2];
409 d = context->state[3];
410 e = context->state[4];
411 f = context->state[5];
412 g = context->state[6];
413 h = context->state[7];
417 /* Rounds 0 to 15 (unrolled): */
418 ROUND256_0_TO_15(a,b,c,d,e,f,g,h);
419 ROUND256_0_TO_15(h,a,b,c,d,e,f,g);
420 ROUND256_0_TO_15(g,h,a,b,c,d,e,f);
421 ROUND256_0_TO_15(f,g,h,a,b,c,d,e);
422 ROUND256_0_TO_15(e,f,g,h,a,b,c,d);
423 ROUND256_0_TO_15(d,e,f,g,h,a,b,c);
424 ROUND256_0_TO_15(c,d,e,f,g,h,a,b);
425 ROUND256_0_TO_15(b,c,d,e,f,g,h,a);
428 /* Now for the remaining rounds to 64: */
430 ROUND256(a,b,c,d,e,f,g,h);
431 ROUND256(h,a,b,c,d,e,f,g);
432 ROUND256(g,h,a,b,c,d,e,f);
433 ROUND256(f,g,h,a,b,c,d,e);
434 ROUND256(e,f,g,h,a,b,c,d);
435 ROUND256(d,e,f,g,h,a,b,c);
436 ROUND256(c,d,e,f,g,h,a,b);
437 ROUND256(b,c,d,e,f,g,h,a);
440 /* Compute the current intermediate hash value */
441 context->state[0] += a;
442 context->state[1] += b;
443 context->state[2] += c;
444 context->state[3] += d;
445 context->state[4] += e;
446 context->state[5] += f;
447 context->state[6] += g;
448 context->state[7] += h;
451 a = b = c = d = e = f = g = h = T1 = 0;
454 #else /* SHA2_UNROLL_TRANSFORM */
456 void SHA256_Transform(SHA256_CTX* context, const sha2_word32* data) {
457 sha2_word32 a, b, c, d, e, f, g, h, s0, s1;
458 sha2_word32 T1, T2, *W256;
461 W256 = (sha2_word32*)context->buffer;
463 /* Initialize registers with the prev. intermediate value */
464 a = context->state[0];
465 b = context->state[1];
466 c = context->state[2];
467 d = context->state[3];
468 e = context->state[4];
469 f = context->state[5];
470 g = context->state[6];
471 h = context->state[7];
475 #if BYTE_ORDER == LITTLE_ENDIAN
476 /* Copy data while converting to host byte order */
477 REVERSE32(*data++,W256[j]);
478 /* Apply the SHA-256 compression function to update a..h */
479 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + W256[j];
480 #else /* BYTE_ORDER == LITTLE_ENDIAN */
481 /* Apply the SHA-256 compression function to update a..h with copy */
482 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + (W256[j] = *data++);
483 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
484 T2 = Sigma0_256(a) + Maj(a, b, c);
498 /* Part of the message block expansion: */
499 s0 = W256[(j+1)&0x0f];
501 s1 = W256[(j+14)&0x0f];
504 /* Apply the SHA-256 compression function to update a..h */
505 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] +
506 (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0);
507 T2 = Sigma0_256(a) + Maj(a, b, c);
520 /* Compute the current intermediate hash value */
521 context->state[0] += a;
522 context->state[1] += b;
523 context->state[2] += c;
524 context->state[3] += d;
525 context->state[4] += e;
526 context->state[5] += f;
527 context->state[6] += g;
528 context->state[7] += h;
531 a = b = c = d = e = f = g = h = T1 = T2 = 0;
534 #endif /* SHA2_UNROLL_TRANSFORM */
536 void SHA256_Update(SHA256_CTX* context, const sha2_byte *data, size_t len) {
537 unsigned int freespace, usedspace;
540 /* Calling with no data is valid - we do nothing */
545 assert(context != (SHA256_CTX*)0 && data != (sha2_byte*)0);
547 usedspace = (context->bitcount >> 3) % SHA256_BLOCK_LENGTH;
549 /* Calculate how much free space is available in the buffer */
550 freespace = SHA256_BLOCK_LENGTH - usedspace;
552 if (len >= freespace) {
553 /* Fill the buffer completely and process it */
554 MEMCPY_BCOPY(&context->buffer[usedspace], data, freespace);
555 context->bitcount += freespace << 3;
558 SHA256_Transform(context, (sha2_word32*)context->buffer);
560 /* The buffer is not yet full */
561 MEMCPY_BCOPY(&context->buffer[usedspace], data, len);
562 context->bitcount += len << 3;
564 usedspace = freespace = 0;
568 while (len >= SHA256_BLOCK_LENGTH) {
569 /* Process as many complete blocks as we can */
570 SHA256_Transform(context, (sha2_word32*)data);
571 context->bitcount += SHA256_BLOCK_LENGTH << 3;
572 len -= SHA256_BLOCK_LENGTH;
573 data += SHA256_BLOCK_LENGTH;
576 /* There's left-overs, so save 'em */
577 MEMCPY_BCOPY(context->buffer, data, len);
578 context->bitcount += len << 3;
581 usedspace = freespace = 0;
584 void SHA256_Final(sha2_byte digest[], SHA256_CTX* context) {
585 sha2_word32 *d = (sha2_word32*)digest;
586 unsigned int usedspace;
589 assert(context != (SHA256_CTX*)0);
591 /* If no digest buffer is passed, we don't bother doing this: */
592 if (digest != (sha2_byte*)0) {
593 usedspace = (context->bitcount >> 3) % SHA256_BLOCK_LENGTH;
594 #if BYTE_ORDER == LITTLE_ENDIAN
595 /* Convert FROM host byte order */
596 REVERSE64(context->bitcount,context->bitcount);
599 /* Begin padding with a 1 bit: */
600 context->buffer[usedspace++] = 0x80;
602 if (usedspace <= SHA256_SHORT_BLOCK_LENGTH) {
603 /* Set-up for the last transform: */
604 MEMSET_BZERO(&context->buffer[usedspace], SHA256_SHORT_BLOCK_LENGTH - usedspace);
606 if (usedspace < SHA256_BLOCK_LENGTH) {
607 MEMSET_BZERO(&context->buffer[usedspace], SHA256_BLOCK_LENGTH - usedspace);
609 /* Do second-to-last transform: */
610 SHA256_Transform(context, (sha2_word32*)context->buffer);
612 /* And set-up for the last transform: */
613 MEMSET_BZERO(context->buffer, SHA256_SHORT_BLOCK_LENGTH);
616 /* Set-up for the last transform: */
617 MEMSET_BZERO(context->buffer, SHA256_SHORT_BLOCK_LENGTH);
619 /* Begin padding with a 1 bit: */
620 *context->buffer = 0x80;
622 /* Set the bit count: */
623 *(sha2_word64*)&context->buffer[SHA256_SHORT_BLOCK_LENGTH] = context->bitcount;
625 /* Final transform: */
626 SHA256_Transform(context, (sha2_word32*)context->buffer);
628 #if BYTE_ORDER == LITTLE_ENDIAN
630 /* Convert TO host byte order */
632 for (j = 0; j < 8; j++) {
633 REVERSE32(context->state[j],context->state[j]);
634 *d++ = context->state[j];
638 MEMCPY_BCOPY(d, context->state, SHA256_DIGEST_LENGTH);
642 /* Clean up state data: */
643 MEMSET_BZERO(context, sizeof(context));
647 char *SHA256_End(SHA256_CTX* context, char buffer[]) {
648 sha2_byte digest[SHA256_DIGEST_LENGTH], *d = digest;
652 assert(context != (SHA256_CTX*)0);
654 if (buffer != (char*)0) {
655 SHA256_Final(digest, context);
657 for (i = 0; i < SHA256_DIGEST_LENGTH; i++) {
658 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4];
659 *buffer++ = sha2_hex_digits[*d & 0x0f];
664 MEMSET_BZERO(context, sizeof(context));
666 MEMSET_BZERO(digest, SHA256_DIGEST_LENGTH);
670 char* SHA256_Data(const sha2_byte* data, size_t len, char digest[SHA256_DIGEST_STRING_LENGTH]) {
673 SHA256_Init(&context);
674 SHA256_Update(&context, data, len);
675 return SHA256_End(&context, digest);
679 /*** SHA-512: *********************************************************/
680 void SHA512_Init(SHA512_CTX* context) {
681 if (context == (SHA512_CTX*)0) {
684 MEMCPY_BCOPY(context->state, sha512_initial_hash_value, SHA512_DIGEST_LENGTH);
685 MEMSET_BZERO(context->buffer, SHA512_BLOCK_LENGTH);
686 context->bitcount[0] = context->bitcount[1] = 0;
689 #ifdef SHA2_UNROLL_TRANSFORM
691 /* Unrolled SHA-512 round macros: */
692 #if BYTE_ORDER == LITTLE_ENDIAN
694 #define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \
695 REVERSE64(*data++, W512[j]); \
696 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + \
699 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)), \
703 #else /* BYTE_ORDER == LITTLE_ENDIAN */
705 #define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \
706 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + \
707 K512[j] + (W512[j] = *data++); \
709 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \
712 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
714 #define ROUND512(a,b,c,d,e,f,g,h) \
715 s0 = W512[(j+1)&0x0f]; \
716 s0 = sigma0_512(s0); \
717 s1 = W512[(j+14)&0x0f]; \
718 s1 = sigma1_512(s1); \
719 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + K512[j] + \
720 (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0); \
722 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \
725 void SHA512_Transform(SHA512_CTX* context, const sha2_word64* data) {
726 sha2_word64 a, b, c, d, e, f, g, h, s0, s1;
727 sha2_word64 T1, *W512 = (sha2_word64*)context->buffer;
730 /* Initialize registers with the prev. intermediate value */
731 a = context->state[0];
732 b = context->state[1];
733 c = context->state[2];
734 d = context->state[3];
735 e = context->state[4];
736 f = context->state[5];
737 g = context->state[6];
738 h = context->state[7];
742 ROUND512_0_TO_15(a,b,c,d,e,f,g,h);
743 ROUND512_0_TO_15(h,a,b,c,d,e,f,g);
744 ROUND512_0_TO_15(g,h,a,b,c,d,e,f);
745 ROUND512_0_TO_15(f,g,h,a,b,c,d,e);
746 ROUND512_0_TO_15(e,f,g,h,a,b,c,d);
747 ROUND512_0_TO_15(d,e,f,g,h,a,b,c);
748 ROUND512_0_TO_15(c,d,e,f,g,h,a,b);
749 ROUND512_0_TO_15(b,c,d,e,f,g,h,a);
752 /* Now for the remaining rounds up to 79: */
754 ROUND512(a,b,c,d,e,f,g,h);
755 ROUND512(h,a,b,c,d,e,f,g);
756 ROUND512(g,h,a,b,c,d,e,f);
757 ROUND512(f,g,h,a,b,c,d,e);
758 ROUND512(e,f,g,h,a,b,c,d);
759 ROUND512(d,e,f,g,h,a,b,c);
760 ROUND512(c,d,e,f,g,h,a,b);
761 ROUND512(b,c,d,e,f,g,h,a);
764 /* Compute the current intermediate hash value */
765 context->state[0] += a;
766 context->state[1] += b;
767 context->state[2] += c;
768 context->state[3] += d;
769 context->state[4] += e;
770 context->state[5] += f;
771 context->state[6] += g;
772 context->state[7] += h;
775 a = b = c = d = e = f = g = h = T1 = 0;
778 #else /* SHA2_UNROLL_TRANSFORM */
780 void SHA512_Transform(SHA512_CTX* context, const sha2_word64* data) {
781 sha2_word64 a, b, c, d, e, f, g, h, s0, s1;
782 sha2_word64 T1, T2, *W512 = (sha2_word64*)context->buffer;
785 /* Initialize registers with the prev. intermediate value */
786 a = context->state[0];
787 b = context->state[1];
788 c = context->state[2];
789 d = context->state[3];
790 e = context->state[4];
791 f = context->state[5];
792 g = context->state[6];
793 h = context->state[7];
797 #if BYTE_ORDER == LITTLE_ENDIAN
798 /* Convert TO host byte order */
799 REVERSE64(*data++, W512[j]);
800 /* Apply the SHA-512 compression function to update a..h */
801 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + W512[j];
802 #else /* BYTE_ORDER == LITTLE_ENDIAN */
803 /* Apply the SHA-512 compression function to update a..h with copy */
804 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + (W512[j] = *data++);
805 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
806 T2 = Sigma0_512(a) + Maj(a, b, c);
820 /* Part of the message block expansion: */
821 s0 = W512[(j+1)&0x0f];
823 s1 = W512[(j+14)&0x0f];
826 /* Apply the SHA-512 compression function to update a..h */
827 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] +
828 (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0);
829 T2 = Sigma0_512(a) + Maj(a, b, c);
842 /* Compute the current intermediate hash value */
843 context->state[0] += a;
844 context->state[1] += b;
845 context->state[2] += c;
846 context->state[3] += d;
847 context->state[4] += e;
848 context->state[5] += f;
849 context->state[6] += g;
850 context->state[7] += h;
853 a = b = c = d = e = f = g = h = T1 = T2 = 0;
856 #endif /* SHA2_UNROLL_TRANSFORM */
858 void SHA512_Update(SHA512_CTX* context, const sha2_byte *data, size_t len) {
859 unsigned int freespace, usedspace;
862 /* Calling with no data is valid - we do nothing */
867 assert(context != (SHA512_CTX*)0 && data != (sha2_byte*)0);
869 usedspace = (context->bitcount[0] >> 3) % SHA512_BLOCK_LENGTH;
871 /* Calculate how much free space is available in the buffer */
872 freespace = SHA512_BLOCK_LENGTH - usedspace;
874 if (len >= freespace) {
875 /* Fill the buffer completely and process it */
876 MEMCPY_BCOPY(&context->buffer[usedspace], data, freespace);
877 ADDINC128(context->bitcount, freespace << 3);
880 SHA512_Transform(context, (sha2_word64*)context->buffer);
882 /* The buffer is not yet full */
883 MEMCPY_BCOPY(&context->buffer[usedspace], data, len);
884 ADDINC128(context->bitcount, len << 3);
886 usedspace = freespace = 0;
890 while (len >= SHA512_BLOCK_LENGTH) {
891 /* Process as many complete blocks as we can */
892 SHA512_Transform(context, (sha2_word64*)data);
893 ADDINC128(context->bitcount, SHA512_BLOCK_LENGTH << 3);
894 len -= SHA512_BLOCK_LENGTH;
895 data += SHA512_BLOCK_LENGTH;
898 /* There's left-overs, so save 'em */
899 MEMCPY_BCOPY(context->buffer, data, len);
900 ADDINC128(context->bitcount, len << 3);
903 usedspace = freespace = 0;
906 void SHA512_Last(SHA512_CTX* context) {
907 unsigned int usedspace;
909 usedspace = (context->bitcount[0] >> 3) % SHA512_BLOCK_LENGTH;
910 #if BYTE_ORDER == LITTLE_ENDIAN
911 /* Convert FROM host byte order */
912 REVERSE64(context->bitcount[0],context->bitcount[0]);
913 REVERSE64(context->bitcount[1],context->bitcount[1]);
916 /* Begin padding with a 1 bit: */
917 context->buffer[usedspace++] = 0x80;
919 if (usedspace <= SHA512_SHORT_BLOCK_LENGTH) {
920 /* Set-up for the last transform: */
921 MEMSET_BZERO(&context->buffer[usedspace], SHA512_SHORT_BLOCK_LENGTH - usedspace);
923 if (usedspace < SHA512_BLOCK_LENGTH) {
924 MEMSET_BZERO(&context->buffer[usedspace], SHA512_BLOCK_LENGTH - usedspace);
926 /* Do second-to-last transform: */
927 SHA512_Transform(context, (sha2_word64*)context->buffer);
929 /* And set-up for the last transform: */
930 MEMSET_BZERO(context->buffer, SHA512_BLOCK_LENGTH - 2);
933 /* Prepare for final transform: */
934 MEMSET_BZERO(context->buffer, SHA512_SHORT_BLOCK_LENGTH);
936 /* Begin padding with a 1 bit: */
937 *context->buffer = 0x80;
939 /* Store the length of input data (in bits): */
940 *(sha2_word64*)&context->buffer[SHA512_SHORT_BLOCK_LENGTH] = context->bitcount[1];
941 *(sha2_word64*)&context->buffer[SHA512_SHORT_BLOCK_LENGTH+8] = context->bitcount[0];
943 /* Final transform: */
944 SHA512_Transform(context, (sha2_word64*)context->buffer);
947 void SHA512_Final(sha2_byte digest[], SHA512_CTX* context) {
948 sha2_word64 *d = (sha2_word64*)digest;
951 assert(context != (SHA512_CTX*)0);
953 /* If no digest buffer is passed, we don't bother doing this: */
954 if (digest != (sha2_byte*)0) {
955 SHA512_Last(context);
957 /* Save the hash data for output: */
958 #if BYTE_ORDER == LITTLE_ENDIAN
960 /* Convert TO host byte order */
962 for (j = 0; j < 8; j++) {
963 REVERSE64(context->state[j],context->state[j]);
964 *d++ = context->state[j];
968 MEMCPY_BCOPY(d, context->state, SHA512_DIGEST_LENGTH);
972 /* Zero out state data */
973 MEMSET_BZERO(context, sizeof(context));
976 char *SHA512_End(SHA512_CTX* context, char buffer[]) {
977 sha2_byte digest[SHA512_DIGEST_LENGTH], *d = digest;
981 assert(context != (SHA512_CTX*)0);
983 if (buffer != (char*)0) {
984 SHA512_Final(digest, context);
986 for (i = 0; i < SHA512_DIGEST_LENGTH; i++) {
987 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4];
988 *buffer++ = sha2_hex_digits[*d & 0x0f];
993 MEMSET_BZERO(context, sizeof(context));
995 MEMSET_BZERO(digest, SHA512_DIGEST_LENGTH);
999 char* SHA512_Data(const sha2_byte* data, size_t len, char digest[SHA512_DIGEST_STRING_LENGTH]) {
1002 SHA512_Init(&context);
1003 SHA512_Update(&context, data, len);
1004 return SHA512_End(&context, digest);
1008 /*** SHA-384: *********************************************************/
1009 void SHA384_Init(SHA384_CTX* context) {
1010 if (context == (SHA384_CTX*)0) {
1013 MEMCPY_BCOPY(context->state, sha384_initial_hash_value, SHA512_DIGEST_LENGTH);
1014 MEMSET_BZERO(context->buffer, SHA384_BLOCK_LENGTH);
1015 context->bitcount[0] = context->bitcount[1] = 0;
1018 void SHA384_Update(SHA384_CTX* context, const sha2_byte* data, size_t len) {
1019 SHA512_Update((SHA512_CTX*)context, data, len);
1022 void SHA384_Final(sha2_byte digest[], SHA384_CTX* context) {
1023 sha2_word64 *d = (sha2_word64*)digest;
1026 assert(context != (SHA384_CTX*)0);
1028 /* If no digest buffer is passed, we don't bother doing this: */
1029 if (digest != (sha2_byte*)0) {
1030 SHA512_Last((SHA512_CTX*)context);
1032 /* Save the hash data for output: */
1033 #if BYTE_ORDER == LITTLE_ENDIAN
1035 /* Convert TO host byte order */
1037 for (j = 0; j < 6; j++) {
1038 REVERSE64(context->state[j],context->state[j]);
1039 *d++ = context->state[j];
1043 MEMCPY_BCOPY(d, context->state, SHA384_DIGEST_LENGTH);
1047 /* Zero out state data */
1048 MEMSET_BZERO(context, sizeof(context));
1051 char *SHA384_End(SHA384_CTX* context, char buffer[]) {
1052 sha2_byte digest[SHA384_DIGEST_LENGTH], *d = digest;
1056 assert(context != (SHA384_CTX*)0);
1058 if (buffer != (char*)0) {
1059 SHA384_Final(digest, context);
1061 for (i = 0; i < SHA384_DIGEST_LENGTH; i++) {
1062 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4];
1063 *buffer++ = sha2_hex_digits[*d & 0x0f];
1068 MEMSET_BZERO(context, sizeof(context));
1070 MEMSET_BZERO(digest, SHA384_DIGEST_LENGTH);
1074 char* SHA384_Data(const sha2_byte* data, size_t len, char digest[SHA384_DIGEST_STRING_LENGTH]) {
1077 SHA384_Init(&context);
1078 SHA384_Update(&context, data, len);
1079 return SHA384_End(&context, digest);