bsd/crypto/sha2/sha2.c

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