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