2 * Copyright (C) 2005-2007, 2009-2012 Internet Systems Consortium, Inc. ("ISC")
4 * Permission to use, copy, modify, and/or distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
9 * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
10 * AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
11 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
12 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
13 * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
14 * PERFORMANCE OF THIS SOFTWARE.
20 /* $KAME: sha2.c,v 1.8 2001/11/08 01:07:52 itojun Exp $ */
27 * Written by Aaron D. Gifford <me@aarongifford.com>
29 * Copyright 2000 Aaron D. Gifford. All rights reserved.
31 * Redistribution and use in source and binary forms, with or without
32 * modification, are permitted provided that the following conditions
34 * 1. Redistributions of source code must retain the above copyright
35 * notice, this list of conditions and the following disclaimer.
36 * 2. Redistributions in binary form must reproduce the above copyright
37 * notice, this list of conditions and the following disclaimer in the
38 * documentation and/or other materials provided with the distribution.
39 * 3. Neither the name of the copyright holder nor the names of contributors
40 * may be used to endorse or promote products derived from this software
41 * without specific prior written permission.
43 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTOR(S) ``AS IS'' AND
44 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
45 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
46 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE
47 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
48 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
49 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
50 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
51 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
52 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60 #include <isc/assertions.h>
62 #include <isc/string.h>
66 * UNROLLED TRANSFORM LOOP NOTE:
67 * You can define SHA2_UNROLL_TRANSFORM to use the unrolled transform
68 * loop version for the hash transform rounds (defined using macros
69 * later in this file). Either define on the command line, for example:
71 * cc -DISC_SHA2_UNROLL_TRANSFORM -o sha2 sha2.c sha2prog.c
75 * \#define ISC_SHA2_UNROLL_TRANSFORM
79 /*** SHA-256/384/512 Machine Architecture Definitions *****************/
83 * Please make sure that your system defines BYTE_ORDER. If your
84 * architecture is little-endian, make sure it also defines
85 * LITTLE_ENDIAN and that the two (BYTE_ORDER and LITTLE_ENDIAN) are
88 * If your system does not define the above, then you can do so by
91 * \#define LITTLE_ENDIAN 1234
92 * \#define BIG_ENDIAN 4321
94 * And for little-endian machines, add:
96 * \#define BYTE_ORDER LITTLE_ENDIAN
98 * Or for big-endian machines:
100 * \#define BYTE_ORDER BIG_ENDIAN
102 * The FreeBSD machine this was written on defines BYTE_ORDER
103 * appropriately by including <sys/types.h> (which in turn includes
104 * <machine/endian.h> where the appropriate definitions are actually
107 #if !defined(BYTE_ORDER) || (BYTE_ORDER != LITTLE_ENDIAN && BYTE_ORDER != BIG_ENDIAN)
110 #define BIG_ENDIAN 4321
112 #ifndef LITTLE_ENDIAN
113 #define LITTLE_ENDIAN 1234
115 #ifdef WORDS_BIGENDIAN
116 #define BYTE_ORDER BIG_ENDIAN
118 #define BYTE_ORDER LITTLE_ENDIAN
121 #error Define BYTE_ORDER to be equal to either LITTLE_ENDIAN or BIG_ENDIAN
125 /*** SHA-256/384/512 Various Length Definitions ***********************/
126 /* NOTE: Most of these are in sha2.h */
127 #define ISC_SHA256_SHORT_BLOCK_LENGTH (ISC_SHA256_BLOCK_LENGTH - 8)
128 #define ISC_SHA384_SHORT_BLOCK_LENGTH (ISC_SHA384_BLOCK_LENGTH - 16)
129 #define ISC_SHA512_SHORT_BLOCK_LENGTH (ISC_SHA512_BLOCK_LENGTH - 16)
132 /*** ENDIAN REVERSAL MACROS *******************************************/
133 #if BYTE_ORDER == LITTLE_ENDIAN
134 #define REVERSE32(w,x) { \
135 isc_uint32_t tmp = (w); \
136 tmp = (tmp >> 16) | (tmp << 16); \
137 (x) = ((tmp & 0xff00ff00UL) >> 8) | ((tmp & 0x00ff00ffUL) << 8); \
140 #define REVERSE64(w,x) { \
141 isc_uint64_t tmp = (w); \
142 tmp = (tmp >> 32) | (tmp << 32); \
143 tmp = ((tmp & 0xff00ff00ff00ff00UL) >> 8) | \
144 ((tmp & 0x00ff00ff00ff00ffUL) << 8); \
145 (x) = ((tmp & 0xffff0000ffff0000UL) >> 16) | \
146 ((tmp & 0x0000ffff0000ffffUL) << 16); \
149 #define REVERSE64(w,x) { \
150 isc_uint64_t tmp = (w); \
151 tmp = (tmp >> 32) | (tmp << 32); \
152 tmp = ((tmp & 0xff00ff00ff00ff00ULL) >> 8) | \
153 ((tmp & 0x00ff00ff00ff00ffULL) << 8); \
154 (x) = ((tmp & 0xffff0000ffff0000ULL) >> 16) | \
155 ((tmp & 0x0000ffff0000ffffULL) << 16); \
158 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
161 * Macro for incrementally adding the unsigned 64-bit integer n to the
162 * unsigned 128-bit integer (represented using a two-element array of
165 #define ADDINC128(w,n) { \
166 (w)[0] += (isc_uint64_t)(n); \
167 if ((w)[0] < (n)) { \
172 /*** THE SIX LOGICAL FUNCTIONS ****************************************/
174 * Bit shifting and rotation (used by the six SHA-XYZ logical functions:
176 * NOTE: The naming of R and S appears backwards here (R is a SHIFT and
177 * S is a ROTATION) because the SHA-256/384/512 description document
178 * (see http://csrc.nist.gov/cryptval/shs/sha256-384-512.pdf) uses this
179 * same "backwards" definition.
181 /* Shift-right (used in SHA-256, SHA-384, and SHA-512): */
182 #define R(b,x) ((x) >> (b))
183 /* 32-bit Rotate-right (used in SHA-256): */
184 #define S32(b,x) (((x) >> (b)) | ((x) << (32 - (b))))
185 /* 64-bit Rotate-right (used in SHA-384 and SHA-512): */
186 #define S64(b,x) (((x) >> (b)) | ((x) << (64 - (b))))
188 /* Two of six logical functions used in SHA-256, SHA-384, and SHA-512: */
189 #define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
190 #define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
192 /* Four of six logical functions used in SHA-256: */
193 #define Sigma0_256(x) (S32(2, (x)) ^ S32(13, (x)) ^ S32(22, (x)))
194 #define Sigma1_256(x) (S32(6, (x)) ^ S32(11, (x)) ^ S32(25, (x)))
195 #define sigma0_256(x) (S32(7, (x)) ^ S32(18, (x)) ^ R(3 , (x)))
196 #define sigma1_256(x) (S32(17, (x)) ^ S32(19, (x)) ^ R(10, (x)))
198 /* Four of six logical functions used in SHA-384 and SHA-512: */
199 #define Sigma0_512(x) (S64(28, (x)) ^ S64(34, (x)) ^ S64(39, (x)))
200 #define Sigma1_512(x) (S64(14, (x)) ^ S64(18, (x)) ^ S64(41, (x)))
201 #define sigma0_512(x) (S64( 1, (x)) ^ S64( 8, (x)) ^ R( 7, (x)))
202 #define sigma1_512(x) (S64(19, (x)) ^ S64(61, (x)) ^ R( 6, (x)))
204 /*** INTERNAL FUNCTION PROTOTYPES *************************************/
205 /* NOTE: These should not be accessed directly from outside this
206 * library -- they are intended for private internal visibility/use
209 void isc_sha512_last(isc_sha512_t *);
210 void isc_sha256_transform(isc_sha256_t *, const isc_uint32_t*);
211 void isc_sha512_transform(isc_sha512_t *, const isc_uint64_t*);
214 /*** SHA-XYZ INITIAL HASH VALUES AND CONSTANTS ************************/
215 /* Hash constant words K for SHA-224 and SHA-256: */
216 static const isc_uint32_t K256[64] = {
217 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL,
218 0x3956c25bUL, 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL,
219 0xd807aa98UL, 0x12835b01UL, 0x243185beUL, 0x550c7dc3UL,
220 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL, 0xc19bf174UL,
221 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL,
222 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL,
223 0x983e5152UL, 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL,
224 0xc6e00bf3UL, 0xd5a79147UL, 0x06ca6351UL, 0x14292967UL,
225 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL, 0x53380d13UL,
226 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL,
227 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL,
228 0xd192e819UL, 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL,
229 0x19a4c116UL, 0x1e376c08UL, 0x2748774cUL, 0x34b0bcb5UL,
230 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL, 0x682e6ff3UL,
231 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL,
232 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL
235 /* Initial hash value H for SHA-224: */
236 static const isc_uint32_t sha224_initial_hash_value[8] = {
247 /* Initial hash value H for SHA-256: */
248 static const isc_uint32_t sha256_initial_hash_value[8] = {
260 /* Hash constant words K for SHA-384 and SHA-512: */
261 static const isc_uint64_t K512[80] = {
262 0x428a2f98d728ae22UL, 0x7137449123ef65cdUL,
263 0xb5c0fbcfec4d3b2fUL, 0xe9b5dba58189dbbcUL,
264 0x3956c25bf348b538UL, 0x59f111f1b605d019UL,
265 0x923f82a4af194f9bUL, 0xab1c5ed5da6d8118UL,
266 0xd807aa98a3030242UL, 0x12835b0145706fbeUL,
267 0x243185be4ee4b28cUL, 0x550c7dc3d5ffb4e2UL,
268 0x72be5d74f27b896fUL, 0x80deb1fe3b1696b1UL,
269 0x9bdc06a725c71235UL, 0xc19bf174cf692694UL,
270 0xe49b69c19ef14ad2UL, 0xefbe4786384f25e3UL,
271 0x0fc19dc68b8cd5b5UL, 0x240ca1cc77ac9c65UL,
272 0x2de92c6f592b0275UL, 0x4a7484aa6ea6e483UL,
273 0x5cb0a9dcbd41fbd4UL, 0x76f988da831153b5UL,
274 0x983e5152ee66dfabUL, 0xa831c66d2db43210UL,
275 0xb00327c898fb213fUL, 0xbf597fc7beef0ee4UL,
276 0xc6e00bf33da88fc2UL, 0xd5a79147930aa725UL,
277 0x06ca6351e003826fUL, 0x142929670a0e6e70UL,
278 0x27b70a8546d22ffcUL, 0x2e1b21385c26c926UL,
279 0x4d2c6dfc5ac42aedUL, 0x53380d139d95b3dfUL,
280 0x650a73548baf63deUL, 0x766a0abb3c77b2a8UL,
281 0x81c2c92e47edaee6UL, 0x92722c851482353bUL,
282 0xa2bfe8a14cf10364UL, 0xa81a664bbc423001UL,
283 0xc24b8b70d0f89791UL, 0xc76c51a30654be30UL,
284 0xd192e819d6ef5218UL, 0xd69906245565a910UL,
285 0xf40e35855771202aUL, 0x106aa07032bbd1b8UL,
286 0x19a4c116b8d2d0c8UL, 0x1e376c085141ab53UL,
287 0x2748774cdf8eeb99UL, 0x34b0bcb5e19b48a8UL,
288 0x391c0cb3c5c95a63UL, 0x4ed8aa4ae3418acbUL,
289 0x5b9cca4f7763e373UL, 0x682e6ff3d6b2b8a3UL,
290 0x748f82ee5defb2fcUL, 0x78a5636f43172f60UL,
291 0x84c87814a1f0ab72UL, 0x8cc702081a6439ecUL,
292 0x90befffa23631e28UL, 0xa4506cebde82bde9UL,
293 0xbef9a3f7b2c67915UL, 0xc67178f2e372532bUL,
294 0xca273eceea26619cUL, 0xd186b8c721c0c207UL,
295 0xeada7dd6cde0eb1eUL, 0xf57d4f7fee6ed178UL,
296 0x06f067aa72176fbaUL, 0x0a637dc5a2c898a6UL,
297 0x113f9804bef90daeUL, 0x1b710b35131c471bUL,
298 0x28db77f523047d84UL, 0x32caab7b40c72493UL,
299 0x3c9ebe0a15c9bebcUL, 0x431d67c49c100d4cUL,
300 0x4cc5d4becb3e42b6UL, 0x597f299cfc657e2aUL,
301 0x5fcb6fab3ad6faecUL, 0x6c44198c4a475817UL
304 /* Initial hash value H for SHA-384: */
305 static const isc_uint64_t sha384_initial_hash_value[8] = {
306 0xcbbb9d5dc1059ed8UL,
307 0x629a292a367cd507UL,
308 0x9159015a3070dd17UL,
309 0x152fecd8f70e5939UL,
310 0x67332667ffc00b31UL,
311 0x8eb44a8768581511UL,
312 0xdb0c2e0d64f98fa7UL,
316 /* Initial hash value H for SHA-512: */
317 static const isc_uint64_t sha512_initial_hash_value[8] = {
319 0xbb67ae8584caa73bUL,
320 0x3c6ef372fe94f82bUL,
321 0xa54ff53a5f1d36f1UL,
322 0x510e527fade682d1UL,
323 0x9b05688c2b3e6c1fUL,
324 0x1f83d9abfb41bd6bUL,
328 /* Hash constant words K for SHA-384 and SHA-512: */
329 static const isc_uint64_t K512[80] = {
330 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL,
331 0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,
332 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
333 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,
334 0xd807aa98a3030242ULL, 0x12835b0145706fbeULL,
335 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
336 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL,
337 0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,
338 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
339 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,
340 0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL,
341 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
342 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL,
343 0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,
344 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
345 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,
346 0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL,
347 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
348 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL,
349 0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,
350 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
351 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,
352 0xd192e819d6ef5218ULL, 0xd69906245565a910ULL,
353 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
354 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL,
355 0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,
356 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
357 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,
358 0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL,
359 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
360 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL,
361 0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,
362 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
363 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,
364 0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL,
365 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
366 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL,
367 0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,
368 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
369 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL
372 /* Initial hash value H for SHA-384: */
373 static const isc_uint64_t sha384_initial_hash_value[8] = {
374 0xcbbb9d5dc1059ed8ULL,
375 0x629a292a367cd507ULL,
376 0x9159015a3070dd17ULL,
377 0x152fecd8f70e5939ULL,
378 0x67332667ffc00b31ULL,
379 0x8eb44a8768581511ULL,
380 0xdb0c2e0d64f98fa7ULL,
381 0x47b5481dbefa4fa4ULL
384 /* Initial hash value H for SHA-512: */
385 static const isc_uint64_t sha512_initial_hash_value[8] = {
386 0x6a09e667f3bcc908ULL,
387 0xbb67ae8584caa73bULL,
388 0x3c6ef372fe94f82bULL,
389 0xa54ff53a5f1d36f1ULL,
390 0x510e527fade682d1ULL,
391 0x9b05688c2b3e6c1fULL,
392 0x1f83d9abfb41bd6bULL,
393 0x5be0cd19137e2179ULL
398 * Constant used by SHA256/384/512_End() functions for converting the
399 * digest to a readable hexadecimal character string:
401 static const char *sha2_hex_digits = "0123456789abcdef";
405 /*** SHA-224: *********************************************************/
407 isc_sha224_init(isc_sha224_t *context) {
408 if (context == (isc_sha256_t *)0) {
411 memcpy(context->state, sha224_initial_hash_value,
412 ISC_SHA256_DIGESTLENGTH);
413 memset(context->buffer, 0, ISC_SHA256_BLOCK_LENGTH);
414 context->bitcount = 0;
418 isc_sha224_invalidate(isc_sha224_t *context) {
419 memset(context, 0, sizeof(isc_sha224_t));
423 isc_sha224_update(isc_sha224_t *context, const isc_uint8_t* data, size_t len) {
424 isc_sha256_update((isc_sha256_t *)context, data, len);
428 isc_sha224_final(isc_uint8_t digest[], isc_sha224_t *context) {
429 isc_uint8_t sha256_digest[ISC_SHA256_DIGESTLENGTH];
430 isc_sha256_final(sha256_digest, (isc_sha256_t *)context);
431 memcpy(digest, sha256_digest, ISC_SHA224_DIGESTLENGTH);
432 memset(sha256_digest, 0, ISC_SHA256_DIGESTLENGTH);
436 isc_sha224_end(isc_sha224_t *context, char buffer[]) {
437 isc_uint8_t digest[ISC_SHA224_DIGESTLENGTH], *d = digest;
441 REQUIRE(context != (isc_sha224_t *)0);
443 if (buffer != (char*)0) {
444 isc_sha224_final(digest, context);
446 for (i = 0; i < ISC_SHA224_DIGESTLENGTH; i++) {
447 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4];
448 *buffer++ = sha2_hex_digits[*d & 0x0f];
453 memset(context, 0, sizeof(*context));
455 memset(digest, 0, ISC_SHA224_DIGESTLENGTH);
460 isc_sha224_data(const isc_uint8_t *data, size_t len,
461 char digest[ISC_SHA224_DIGESTSTRINGLENGTH])
463 isc_sha224_t context;
465 isc_sha224_init(&context);
466 isc_sha224_update(&context, data, len);
467 return (isc_sha224_end(&context, digest));
470 /*** SHA-256: *********************************************************/
472 isc_sha256_init(isc_sha256_t *context) {
473 if (context == (isc_sha256_t *)0) {
476 memcpy(context->state, sha256_initial_hash_value,
477 ISC_SHA256_DIGESTLENGTH);
478 memset(context->buffer, 0, ISC_SHA256_BLOCK_LENGTH);
479 context->bitcount = 0;
482 #ifdef ISC_SHA2_UNROLL_TRANSFORM
484 /* Unrolled SHA-256 round macros: */
486 #if BYTE_ORDER == LITTLE_ENDIAN
488 #define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \
489 REVERSE32(*data++, W256[j]); \
490 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + \
493 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \
497 #else /* BYTE_ORDER == LITTLE_ENDIAN */
499 #define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \
500 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + \
501 K256[j] + (W256[j] = *data++); \
503 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \
506 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
508 #define ROUND256(a,b,c,d,e,f,g,h) \
509 s0 = W256[(j+1)&0x0f]; \
510 s0 = sigma0_256(s0); \
511 s1 = W256[(j+14)&0x0f]; \
512 s1 = sigma1_256(s1); \
513 T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + K256[j] + \
514 (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0); \
516 (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \
519 void isc_sha256_transform(isc_sha256_t *context, const isc_uint32_t* data) {
520 isc_uint32_t a, b, c, d, e, f, g, h, s0, s1;
521 isc_uint32_t T1, *W256;
524 W256 = (isc_uint32_t*)context->buffer;
526 /* Initialize registers with the prev. intermediate value */
527 a = context->state[0];
528 b = context->state[1];
529 c = context->state[2];
530 d = context->state[3];
531 e = context->state[4];
532 f = context->state[5];
533 g = context->state[6];
534 h = context->state[7];
538 /* Rounds 0 to 15 (unrolled): */
539 ROUND256_0_TO_15(a,b,c,d,e,f,g,h);
540 ROUND256_0_TO_15(h,a,b,c,d,e,f,g);
541 ROUND256_0_TO_15(g,h,a,b,c,d,e,f);
542 ROUND256_0_TO_15(f,g,h,a,b,c,d,e);
543 ROUND256_0_TO_15(e,f,g,h,a,b,c,d);
544 ROUND256_0_TO_15(d,e,f,g,h,a,b,c);
545 ROUND256_0_TO_15(c,d,e,f,g,h,a,b);
546 ROUND256_0_TO_15(b,c,d,e,f,g,h,a);
549 /* Now for the remaining rounds to 64: */
551 ROUND256(a,b,c,d,e,f,g,h);
552 ROUND256(h,a,b,c,d,e,f,g);
553 ROUND256(g,h,a,b,c,d,e,f);
554 ROUND256(f,g,h,a,b,c,d,e);
555 ROUND256(e,f,g,h,a,b,c,d);
556 ROUND256(d,e,f,g,h,a,b,c);
557 ROUND256(c,d,e,f,g,h,a,b);
558 ROUND256(b,c,d,e,f,g,h,a);
561 /* Compute the current intermediate hash value */
562 context->state[0] += a;
563 context->state[1] += b;
564 context->state[2] += c;
565 context->state[3] += d;
566 context->state[4] += e;
567 context->state[5] += f;
568 context->state[6] += g;
569 context->state[7] += h;
572 a = b = c = d = e = f = g = h = T1 = 0;
573 /* Avoid compiler warnings */
574 POST(a); POST(b); POST(c); POST(d); POST(e); POST(f);
575 POST(g); POST(h); POST(T1);
578 #else /* ISC_SHA2_UNROLL_TRANSFORM */
581 isc_sha256_transform(isc_sha256_t *context, const isc_uint32_t* data) {
582 isc_uint32_t a, b, c, d, e, f, g, h, s0, s1;
583 isc_uint32_t T1, T2, *W256;
586 W256 = (isc_uint32_t*)context->buffer;
588 /* Initialize registers with the prev. intermediate value */
589 a = context->state[0];
590 b = context->state[1];
591 c = context->state[2];
592 d = context->state[3];
593 e = context->state[4];
594 f = context->state[5];
595 g = context->state[6];
596 h = context->state[7];
600 #if BYTE_ORDER == LITTLE_ENDIAN
601 /* Copy data while converting to host byte order */
602 REVERSE32(*data++,W256[j]);
603 /* Apply the SHA-256 compression function to update a..h */
604 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + W256[j];
605 #else /* BYTE_ORDER == LITTLE_ENDIAN */
606 /* Apply the SHA-256 compression function to update a..h with copy */
607 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + (W256[j] = *data++);
608 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
609 T2 = Sigma0_256(a) + Maj(a, b, c);
623 /* Part of the message block expansion: */
624 s0 = W256[(j+1)&0x0f];
626 s1 = W256[(j+14)&0x0f];
629 /* Apply the SHA-256 compression function to update a..h */
630 T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] +
631 (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0);
632 T2 = Sigma0_256(a) + Maj(a, b, c);
645 /* Compute the current intermediate hash value */
646 context->state[0] += a;
647 context->state[1] += b;
648 context->state[2] += c;
649 context->state[3] += d;
650 context->state[4] += e;
651 context->state[5] += f;
652 context->state[6] += g;
653 context->state[7] += h;
656 a = b = c = d = e = f = g = h = T1 = T2 = 0;
657 /* Avoid compiler warnings */
658 POST(a); POST(b); POST(c); POST(d); POST(e); POST(f);
659 POST(g); POST(h); POST(T1); POST(T2);
662 #endif /* ISC_SHA2_UNROLL_TRANSFORM */
665 isc_sha256_invalidate(isc_sha256_t *context) {
666 memset(context, 0, sizeof(isc_sha256_t));
670 isc_sha256_update(isc_sha256_t *context, const isc_uint8_t *data, size_t len) {
671 unsigned int freespace, usedspace;
674 /* Calling with no data is valid - we do nothing */
679 REQUIRE(context != (isc_sha256_t *)0 && data != (isc_uint8_t*)0);
681 usedspace = (unsigned int)((context->bitcount >> 3) %
682 ISC_SHA256_BLOCK_LENGTH);
684 /* Calculate how much free space is available in the buffer */
685 freespace = ISC_SHA256_BLOCK_LENGTH - usedspace;
687 if (len >= freespace) {
688 /* Fill the buffer completely and process it */
689 memcpy(&context->buffer[usedspace], data, freespace);
690 context->bitcount += freespace << 3;
693 isc_sha256_transform(context,
694 (isc_uint32_t*)context->buffer);
696 /* The buffer is not yet full */
697 memcpy(&context->buffer[usedspace], data, len);
698 context->bitcount += len << 3;
700 usedspace = freespace = 0;
701 /* Avoid compiler warnings: */
702 POST(usedspace); POST(freespace);
706 while (len >= ISC_SHA256_BLOCK_LENGTH) {
707 /* Process as many complete blocks as we can */
708 memcpy(context->buffer, data, ISC_SHA256_BLOCK_LENGTH);
709 isc_sha256_transform(context, (isc_uint32_t*)context->buffer);
710 context->bitcount += ISC_SHA256_BLOCK_LENGTH << 3;
711 len -= ISC_SHA256_BLOCK_LENGTH;
712 data += ISC_SHA256_BLOCK_LENGTH;
715 /* There's left-overs, so save 'em */
716 memcpy(context->buffer, data, len);
717 context->bitcount += len << 3;
720 usedspace = freespace = 0;
721 /* Avoid compiler warnings: */
722 POST(usedspace); POST(freespace);
726 isc_sha256_final(isc_uint8_t digest[], isc_sha256_t *context) {
727 isc_uint32_t *d = (isc_uint32_t*)digest;
728 unsigned int usedspace;
731 REQUIRE(context != (isc_sha256_t *)0);
733 /* If no digest buffer is passed, we don't bother doing this: */
734 if (digest != (isc_uint8_t*)0) {
735 usedspace = (unsigned int)((context->bitcount >> 3) %
736 ISC_SHA256_BLOCK_LENGTH);
737 #if BYTE_ORDER == LITTLE_ENDIAN
738 /* Convert FROM host byte order */
739 REVERSE64(context->bitcount,context->bitcount);
742 /* Begin padding with a 1 bit: */
743 context->buffer[usedspace++] = 0x80;
745 if (usedspace <= ISC_SHA256_SHORT_BLOCK_LENGTH) {
746 /* Set-up for the last transform: */
747 memset(&context->buffer[usedspace], 0,
748 ISC_SHA256_SHORT_BLOCK_LENGTH - usedspace);
750 if (usedspace < ISC_SHA256_BLOCK_LENGTH) {
751 memset(&context->buffer[usedspace], 0,
752 ISC_SHA256_BLOCK_LENGTH -
755 /* Do second-to-last transform: */
756 isc_sha256_transform(context,
757 (isc_uint32_t*)context->buffer);
759 /* And set-up for the last transform: */
760 memset(context->buffer, 0,
761 ISC_SHA256_SHORT_BLOCK_LENGTH);
764 /* Set-up for the last transform: */
765 memset(context->buffer, 0, ISC_SHA256_SHORT_BLOCK_LENGTH);
767 /* Begin padding with a 1 bit: */
768 *context->buffer = 0x80;
770 /* Set the bit count: */
771 *(isc_uint64_t*)&context->buffer[ISC_SHA256_SHORT_BLOCK_LENGTH] = context->bitcount;
773 /* Final transform: */
774 isc_sha256_transform(context, (isc_uint32_t*)context->buffer);
776 #if BYTE_ORDER == LITTLE_ENDIAN
778 /* Convert TO host byte order */
780 for (j = 0; j < 8; j++) {
781 REVERSE32(context->state[j],context->state[j]);
782 *d++ = context->state[j];
786 memcpy(d, context->state, ISC_SHA256_DIGESTLENGTH);
790 /* Clean up state data: */
791 memset(context, 0, sizeof(*context));
797 isc_sha256_end(isc_sha256_t *context, char buffer[]) {
798 isc_uint8_t digest[ISC_SHA256_DIGESTLENGTH], *d = digest;
802 REQUIRE(context != (isc_sha256_t *)0);
804 if (buffer != (char*)0) {
805 isc_sha256_final(digest, context);
807 for (i = 0; i < ISC_SHA256_DIGESTLENGTH; i++) {
808 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4];
809 *buffer++ = sha2_hex_digits[*d & 0x0f];
814 memset(context, 0, sizeof(*context));
816 memset(digest, 0, ISC_SHA256_DIGESTLENGTH);
821 isc_sha256_data(const isc_uint8_t* data, size_t len,
822 char digest[ISC_SHA256_DIGESTSTRINGLENGTH])
824 isc_sha256_t context;
826 isc_sha256_init(&context);
827 isc_sha256_update(&context, data, len);
828 return (isc_sha256_end(&context, digest));
832 /*** SHA-512: *********************************************************/
834 isc_sha512_init(isc_sha512_t *context) {
835 if (context == (isc_sha512_t *)0) {
838 memcpy(context->state, sha512_initial_hash_value,
839 ISC_SHA512_DIGESTLENGTH);
840 memset(context->buffer, 0, ISC_SHA512_BLOCK_LENGTH);
841 context->bitcount[0] = context->bitcount[1] = 0;
844 #ifdef ISC_SHA2_UNROLL_TRANSFORM
846 /* Unrolled SHA-512 round macros: */
847 #if BYTE_ORDER == LITTLE_ENDIAN
849 #define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \
850 REVERSE64(*data++, W512[j]); \
851 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + \
854 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)), \
858 #else /* BYTE_ORDER == LITTLE_ENDIAN */
860 #define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \
861 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + \
862 K512[j] + (W512[j] = *data++); \
864 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \
867 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
869 #define ROUND512(a,b,c,d,e,f,g,h) \
870 s0 = W512[(j+1)&0x0f]; \
871 s0 = sigma0_512(s0); \
872 s1 = W512[(j+14)&0x0f]; \
873 s1 = sigma1_512(s1); \
874 T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + K512[j] + \
875 (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0); \
877 (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \
880 void isc_sha512_transform(isc_sha512_t *context, const isc_uint64_t* data) {
881 isc_uint64_t a, b, c, d, e, f, g, h, s0, s1;
882 isc_uint64_t T1, *W512 = (isc_uint64_t*)context->buffer;
885 /* Initialize registers with the prev. intermediate value */
886 a = context->state[0];
887 b = context->state[1];
888 c = context->state[2];
889 d = context->state[3];
890 e = context->state[4];
891 f = context->state[5];
892 g = context->state[6];
893 h = context->state[7];
897 ROUND512_0_TO_15(a,b,c,d,e,f,g,h);
898 ROUND512_0_TO_15(h,a,b,c,d,e,f,g);
899 ROUND512_0_TO_15(g,h,a,b,c,d,e,f);
900 ROUND512_0_TO_15(f,g,h,a,b,c,d,e);
901 ROUND512_0_TO_15(e,f,g,h,a,b,c,d);
902 ROUND512_0_TO_15(d,e,f,g,h,a,b,c);
903 ROUND512_0_TO_15(c,d,e,f,g,h,a,b);
904 ROUND512_0_TO_15(b,c,d,e,f,g,h,a);
907 /* Now for the remaining rounds up to 79: */
909 ROUND512(a,b,c,d,e,f,g,h);
910 ROUND512(h,a,b,c,d,e,f,g);
911 ROUND512(g,h,a,b,c,d,e,f);
912 ROUND512(f,g,h,a,b,c,d,e);
913 ROUND512(e,f,g,h,a,b,c,d);
914 ROUND512(d,e,f,g,h,a,b,c);
915 ROUND512(c,d,e,f,g,h,a,b);
916 ROUND512(b,c,d,e,f,g,h,a);
919 /* Compute the current intermediate hash value */
920 context->state[0] += a;
921 context->state[1] += b;
922 context->state[2] += c;
923 context->state[3] += d;
924 context->state[4] += e;
925 context->state[5] += f;
926 context->state[6] += g;
927 context->state[7] += h;
930 a = b = c = d = e = f = g = h = T1 = 0;
931 /* Avoid compiler warnings */
932 POST(a); POST(b); POST(c); POST(d); POST(e); POST(f);
933 POST(g); POST(h); POST(T1);
936 #else /* ISC_SHA2_UNROLL_TRANSFORM */
939 isc_sha512_transform(isc_sha512_t *context, const isc_uint64_t* data) {
940 isc_uint64_t a, b, c, d, e, f, g, h, s0, s1;
941 isc_uint64_t T1, T2, *W512 = (isc_uint64_t*)context->buffer;
944 /* Initialize registers with the prev. intermediate value */
945 a = context->state[0];
946 b = context->state[1];
947 c = context->state[2];
948 d = context->state[3];
949 e = context->state[4];
950 f = context->state[5];
951 g = context->state[6];
952 h = context->state[7];
956 #if BYTE_ORDER == LITTLE_ENDIAN
957 /* Convert TO host byte order */
958 REVERSE64(*data++, W512[j]);
959 /* Apply the SHA-512 compression function to update a..h */
960 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + W512[j];
961 #else /* BYTE_ORDER == LITTLE_ENDIAN */
962 /* Apply the SHA-512 compression function to update a..h with copy */
963 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + (W512[j] = *data++);
964 #endif /* BYTE_ORDER == LITTLE_ENDIAN */
965 T2 = Sigma0_512(a) + Maj(a, b, c);
979 /* Part of the message block expansion: */
980 s0 = W512[(j+1)&0x0f];
982 s1 = W512[(j+14)&0x0f];
985 /* Apply the SHA-512 compression function to update a..h */
986 T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] +
987 (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0);
988 T2 = Sigma0_512(a) + Maj(a, b, c);
1001 /* Compute the current intermediate hash value */
1002 context->state[0] += a;
1003 context->state[1] += b;
1004 context->state[2] += c;
1005 context->state[3] += d;
1006 context->state[4] += e;
1007 context->state[5] += f;
1008 context->state[6] += g;
1009 context->state[7] += h;
1012 a = b = c = d = e = f = g = h = T1 = T2 = 0;
1013 /* Avoid compiler warnings */
1014 POST(a); POST(b); POST(c); POST(d); POST(e); POST(f);
1015 POST(g); POST(h); POST(T1); POST(T2);
1018 #endif /* ISC_SHA2_UNROLL_TRANSFORM */
1021 isc_sha512_invalidate(isc_sha512_t *context) {
1022 memset(context, 0, sizeof(isc_sha512_t));
1026 isc_sha512_update(isc_sha512_t *context, const isc_uint8_t *data, size_t len) {
1027 unsigned int freespace, usedspace;
1030 /* Calling with no data is valid - we do nothing */
1035 REQUIRE(context != (isc_sha512_t *)0 && data != (isc_uint8_t*)0);
1037 usedspace = (unsigned int)((context->bitcount[0] >> 3) %
1038 ISC_SHA512_BLOCK_LENGTH);
1039 if (usedspace > 0) {
1040 /* Calculate how much free space is available in the buffer */
1041 freespace = ISC_SHA512_BLOCK_LENGTH - usedspace;
1043 if (len >= freespace) {
1044 /* Fill the buffer completely and process it */
1045 memcpy(&context->buffer[usedspace], data, freespace);
1046 ADDINC128(context->bitcount, freespace << 3);
1049 isc_sha512_transform(context,
1050 (isc_uint64_t*)context->buffer);
1052 /* The buffer is not yet full */
1053 memcpy(&context->buffer[usedspace], data, len);
1054 ADDINC128(context->bitcount, len << 3);
1056 usedspace = freespace = 0;
1057 /* Avoid compiler warnings: */
1058 POST(usedspace); POST(freespace);
1062 while (len >= ISC_SHA512_BLOCK_LENGTH) {
1063 /* Process as many complete blocks as we can */
1064 memcpy(context->buffer, data, ISC_SHA512_BLOCK_LENGTH);
1065 isc_sha512_transform(context, (isc_uint64_t*)context->buffer);
1066 ADDINC128(context->bitcount, ISC_SHA512_BLOCK_LENGTH << 3);
1067 len -= ISC_SHA512_BLOCK_LENGTH;
1068 data += ISC_SHA512_BLOCK_LENGTH;
1071 /* There's left-overs, so save 'em */
1072 memcpy(context->buffer, data, len);
1073 ADDINC128(context->bitcount, len << 3);
1076 usedspace = freespace = 0;
1077 /* Avoid compiler warnings: */
1078 POST(usedspace); POST(freespace);
1081 void isc_sha512_last(isc_sha512_t *context) {
1082 unsigned int usedspace;
1084 usedspace = (unsigned int)((context->bitcount[0] >> 3) %
1085 ISC_SHA512_BLOCK_LENGTH);
1086 #if BYTE_ORDER == LITTLE_ENDIAN
1087 /* Convert FROM host byte order */
1088 REVERSE64(context->bitcount[0],context->bitcount[0]);
1089 REVERSE64(context->bitcount[1],context->bitcount[1]);
1091 if (usedspace > 0) {
1092 /* Begin padding with a 1 bit: */
1093 context->buffer[usedspace++] = 0x80;
1095 if (usedspace <= ISC_SHA512_SHORT_BLOCK_LENGTH) {
1096 /* Set-up for the last transform: */
1097 memset(&context->buffer[usedspace], 0,
1098 ISC_SHA512_SHORT_BLOCK_LENGTH - usedspace);
1100 if (usedspace < ISC_SHA512_BLOCK_LENGTH) {
1101 memset(&context->buffer[usedspace], 0,
1102 ISC_SHA512_BLOCK_LENGTH - usedspace);
1104 /* Do second-to-last transform: */
1105 isc_sha512_transform(context,
1106 (isc_uint64_t*)context->buffer);
1108 /* And set-up for the last transform: */
1109 memset(context->buffer, 0, ISC_SHA512_BLOCK_LENGTH - 2);
1112 /* Prepare for final transform: */
1113 memset(context->buffer, 0, ISC_SHA512_SHORT_BLOCK_LENGTH);
1115 /* Begin padding with a 1 bit: */
1116 *context->buffer = 0x80;
1118 /* Store the length of input data (in bits): */
1119 *(isc_uint64_t*)&context->buffer[ISC_SHA512_SHORT_BLOCK_LENGTH] = context->bitcount[1];
1120 *(isc_uint64_t*)&context->buffer[ISC_SHA512_SHORT_BLOCK_LENGTH+8] = context->bitcount[0];
1122 /* Final transform: */
1123 isc_sha512_transform(context, (isc_uint64_t*)context->buffer);
1126 void isc_sha512_final(isc_uint8_t digest[], isc_sha512_t *context) {
1127 isc_uint64_t *d = (isc_uint64_t*)digest;
1130 REQUIRE(context != (isc_sha512_t *)0);
1132 /* If no digest buffer is passed, we don't bother doing this: */
1133 if (digest != (isc_uint8_t*)0) {
1134 isc_sha512_last(context);
1136 /* Save the hash data for output: */
1137 #if BYTE_ORDER == LITTLE_ENDIAN
1139 /* Convert TO host byte order */
1141 for (j = 0; j < 8; j++) {
1142 REVERSE64(context->state[j],context->state[j]);
1143 *d++ = context->state[j];
1147 memcpy(d, context->state, ISC_SHA512_DIGESTLENGTH);
1151 /* Zero out state data */
1152 memset(context, 0, sizeof(*context));
1156 isc_sha512_end(isc_sha512_t *context, char buffer[]) {
1157 isc_uint8_t digest[ISC_SHA512_DIGESTLENGTH], *d = digest;
1161 REQUIRE(context != (isc_sha512_t *)0);
1163 if (buffer != (char*)0) {
1164 isc_sha512_final(digest, context);
1166 for (i = 0; i < ISC_SHA512_DIGESTLENGTH; i++) {
1167 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4];
1168 *buffer++ = sha2_hex_digits[*d & 0x0f];
1173 memset(context, 0, sizeof(*context));
1175 memset(digest, 0, ISC_SHA512_DIGESTLENGTH);
1180 isc_sha512_data(const isc_uint8_t *data, size_t len,
1181 char digest[ISC_SHA512_DIGESTSTRINGLENGTH])
1183 isc_sha512_t context;
1185 isc_sha512_init(&context);
1186 isc_sha512_update(&context, data, len);
1187 return (isc_sha512_end(&context, digest));
1191 /*** SHA-384: *********************************************************/
1193 isc_sha384_init(isc_sha384_t *context) {
1194 if (context == (isc_sha384_t *)0) {
1197 memcpy(context->state, sha384_initial_hash_value,
1198 ISC_SHA512_DIGESTLENGTH);
1199 memset(context->buffer, 0, ISC_SHA384_BLOCK_LENGTH);
1200 context->bitcount[0] = context->bitcount[1] = 0;
1204 isc_sha384_invalidate(isc_sha384_t *context) {
1205 memset(context, 0, sizeof(isc_sha384_t));
1209 isc_sha384_update(isc_sha384_t *context, const isc_uint8_t* data, size_t len) {
1210 isc_sha512_update((isc_sha512_t *)context, data, len);
1214 isc_sha384_final(isc_uint8_t digest[], isc_sha384_t *context) {
1215 isc_uint64_t *d = (isc_uint64_t*)digest;
1218 REQUIRE(context != (isc_sha384_t *)0);
1220 /* If no digest buffer is passed, we don't bother doing this: */
1221 if (digest != (isc_uint8_t*)0) {
1222 isc_sha512_last((isc_sha512_t *)context);
1224 /* Save the hash data for output: */
1225 #if BYTE_ORDER == LITTLE_ENDIAN
1227 /* Convert TO host byte order */
1229 for (j = 0; j < 6; j++) {
1230 REVERSE64(context->state[j],context->state[j]);
1231 *d++ = context->state[j];
1235 memcpy(d, context->state, ISC_SHA384_DIGESTLENGTH);
1239 /* Zero out state data */
1240 memset(context, 0, sizeof(*context));
1244 isc_sha384_end(isc_sha384_t *context, char buffer[]) {
1245 isc_uint8_t digest[ISC_SHA384_DIGESTLENGTH], *d = digest;
1249 REQUIRE(context != (isc_sha384_t *)0);
1251 if (buffer != (char*)0) {
1252 isc_sha384_final(digest, context);
1254 for (i = 0; i < ISC_SHA384_DIGESTLENGTH; i++) {
1255 *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4];
1256 *buffer++ = sha2_hex_digits[*d & 0x0f];
1261 memset(context, 0, sizeof(*context));
1263 memset(digest, 0, ISC_SHA384_DIGESTLENGTH);
1268 isc_sha384_data(const isc_uint8_t *data, size_t len,
1269 char digest[ISC_SHA384_DIGESTSTRINGLENGTH])
1271 isc_sha384_t context;
1273 isc_sha384_init(&context);
1274 isc_sha384_update(&context, data, len);
1275 return (isc_sha384_end(&context, digest));