1*97447ea4SJohn-Mark Gurney /*- 2*97447ea4SJohn-Mark Gurney * Copyright 2005 Colin Percival 3*97447ea4SJohn-Mark Gurney * All rights reserved. 4*97447ea4SJohn-Mark Gurney * 5*97447ea4SJohn-Mark Gurney * Redistribution and use in source and binary forms, with or without 6*97447ea4SJohn-Mark Gurney * modification, are permitted provided that the following conditions 7*97447ea4SJohn-Mark Gurney * are met: 8*97447ea4SJohn-Mark Gurney * 1. Redistributions of source code must retain the above copyright 9*97447ea4SJohn-Mark Gurney * notice, this list of conditions and the following disclaimer. 10*97447ea4SJohn-Mark Gurney * 2. Redistributions in binary form must reproduce the above copyright 11*97447ea4SJohn-Mark Gurney * notice, this list of conditions and the following disclaimer in the 12*97447ea4SJohn-Mark Gurney * documentation and/or other materials provided with the distribution. 13*97447ea4SJohn-Mark Gurney * 14*97447ea4SJohn-Mark Gurney * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15*97447ea4SJohn-Mark Gurney * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16*97447ea4SJohn-Mark Gurney * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17*97447ea4SJohn-Mark Gurney * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18*97447ea4SJohn-Mark Gurney * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19*97447ea4SJohn-Mark Gurney * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20*97447ea4SJohn-Mark Gurney * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21*97447ea4SJohn-Mark Gurney * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22*97447ea4SJohn-Mark Gurney * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23*97447ea4SJohn-Mark Gurney * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24*97447ea4SJohn-Mark Gurney * SUCH DAMAGE. 25*97447ea4SJohn-Mark Gurney */ 26*97447ea4SJohn-Mark Gurney 27*97447ea4SJohn-Mark Gurney #include <sys/cdefs.h> 28*97447ea4SJohn-Mark Gurney __FBSDID("$FreeBSD$"); 29*97447ea4SJohn-Mark Gurney 30*97447ea4SJohn-Mark Gurney #include <sys/endian.h> 31*97447ea4SJohn-Mark Gurney #include <sys/types.h> 32*97447ea4SJohn-Mark Gurney 33*97447ea4SJohn-Mark Gurney #include <string.h> 34*97447ea4SJohn-Mark Gurney 35*97447ea4SJohn-Mark Gurney #include "sha256.h" 36*97447ea4SJohn-Mark Gurney 37*97447ea4SJohn-Mark Gurney #if BYTE_ORDER == BIG_ENDIAN 38*97447ea4SJohn-Mark Gurney 39*97447ea4SJohn-Mark Gurney /* Copy a vector of big-endian uint32_t into a vector of bytes */ 40*97447ea4SJohn-Mark Gurney #define be32enc_vect(dst, src, len) \ 41*97447ea4SJohn-Mark Gurney memcpy((void *)dst, (const void *)src, (size_t)len) 42*97447ea4SJohn-Mark Gurney 43*97447ea4SJohn-Mark Gurney /* Copy a vector of bytes into a vector of big-endian uint32_t */ 44*97447ea4SJohn-Mark Gurney #define be32dec_vect(dst, src, len) \ 45*97447ea4SJohn-Mark Gurney memcpy((void *)dst, (const void *)src, (size_t)len) 46*97447ea4SJohn-Mark Gurney 47*97447ea4SJohn-Mark Gurney #else /* BYTE_ORDER != BIG_ENDIAN */ 48*97447ea4SJohn-Mark Gurney 49*97447ea4SJohn-Mark Gurney /* 50*97447ea4SJohn-Mark Gurney * Encode a length len/4 vector of (uint32_t) into a length len vector of 51*97447ea4SJohn-Mark Gurney * (unsigned char) in big-endian form. Assumes len is a multiple of 4. 52*97447ea4SJohn-Mark Gurney */ 53*97447ea4SJohn-Mark Gurney static void 54*97447ea4SJohn-Mark Gurney be32enc_vect(unsigned char *dst, const uint32_t *src, size_t len) 55*97447ea4SJohn-Mark Gurney { 56*97447ea4SJohn-Mark Gurney size_t i; 57*97447ea4SJohn-Mark Gurney 58*97447ea4SJohn-Mark Gurney for (i = 0; i < len / 4; i++) 59*97447ea4SJohn-Mark Gurney be32enc(dst + i * 4, src[i]); 60*97447ea4SJohn-Mark Gurney } 61*97447ea4SJohn-Mark Gurney 62*97447ea4SJohn-Mark Gurney /* 63*97447ea4SJohn-Mark Gurney * Decode a big-endian length len vector of (unsigned char) into a length 64*97447ea4SJohn-Mark Gurney * len/4 vector of (uint32_t). Assumes len is a multiple of 4. 65*97447ea4SJohn-Mark Gurney */ 66*97447ea4SJohn-Mark Gurney static void 67*97447ea4SJohn-Mark Gurney be32dec_vect(uint32_t *dst, const unsigned char *src, size_t len) 68*97447ea4SJohn-Mark Gurney { 69*97447ea4SJohn-Mark Gurney size_t i; 70*97447ea4SJohn-Mark Gurney 71*97447ea4SJohn-Mark Gurney for (i = 0; i < len / 4; i++) 72*97447ea4SJohn-Mark Gurney dst[i] = be32dec(src + i * 4); 73*97447ea4SJohn-Mark Gurney } 74*97447ea4SJohn-Mark Gurney 75*97447ea4SJohn-Mark Gurney #endif /* BYTE_ORDER != BIG_ENDIAN */ 76*97447ea4SJohn-Mark Gurney 77*97447ea4SJohn-Mark Gurney /* Elementary functions used by SHA256 */ 78*97447ea4SJohn-Mark Gurney #define Ch(x, y, z) ((x & (y ^ z)) ^ z) 79*97447ea4SJohn-Mark Gurney #define Maj(x, y, z) ((x & (y | z)) | (y & z)) 80*97447ea4SJohn-Mark Gurney #define SHR(x, n) (x >> n) 81*97447ea4SJohn-Mark Gurney #define ROTR(x, n) ((x >> n) | (x << (32 - n))) 82*97447ea4SJohn-Mark Gurney #define S0(x) (ROTR(x, 2) ^ ROTR(x, 13) ^ ROTR(x, 22)) 83*97447ea4SJohn-Mark Gurney #define S1(x) (ROTR(x, 6) ^ ROTR(x, 11) ^ ROTR(x, 25)) 84*97447ea4SJohn-Mark Gurney #define s0(x) (ROTR(x, 7) ^ ROTR(x, 18) ^ SHR(x, 3)) 85*97447ea4SJohn-Mark Gurney #define s1(x) (ROTR(x, 17) ^ ROTR(x, 19) ^ SHR(x, 10)) 86*97447ea4SJohn-Mark Gurney 87*97447ea4SJohn-Mark Gurney /* SHA256 round function */ 88*97447ea4SJohn-Mark Gurney #define RND(a, b, c, d, e, f, g, h, k) \ 89*97447ea4SJohn-Mark Gurney t0 = h + S1(e) + Ch(e, f, g) + k; \ 90*97447ea4SJohn-Mark Gurney t1 = S0(a) + Maj(a, b, c); \ 91*97447ea4SJohn-Mark Gurney d += t0; \ 92*97447ea4SJohn-Mark Gurney h = t0 + t1; 93*97447ea4SJohn-Mark Gurney 94*97447ea4SJohn-Mark Gurney /* Adjusted round function for rotating state */ 95*97447ea4SJohn-Mark Gurney #define RNDr(S, W, i, k) \ 96*97447ea4SJohn-Mark Gurney RND(S[(64 - i) % 8], S[(65 - i) % 8], \ 97*97447ea4SJohn-Mark Gurney S[(66 - i) % 8], S[(67 - i) % 8], \ 98*97447ea4SJohn-Mark Gurney S[(68 - i) % 8], S[(69 - i) % 8], \ 99*97447ea4SJohn-Mark Gurney S[(70 - i) % 8], S[(71 - i) % 8], \ 100*97447ea4SJohn-Mark Gurney W[i] + k) 101*97447ea4SJohn-Mark Gurney 102*97447ea4SJohn-Mark Gurney /* 103*97447ea4SJohn-Mark Gurney * SHA256 block compression function. The 256-bit state is transformed via 104*97447ea4SJohn-Mark Gurney * the 512-bit input block to produce a new state. 105*97447ea4SJohn-Mark Gurney */ 106*97447ea4SJohn-Mark Gurney static void 107*97447ea4SJohn-Mark Gurney SHA256_Transform(uint32_t * state, const unsigned char block[64]) 108*97447ea4SJohn-Mark Gurney { 109*97447ea4SJohn-Mark Gurney uint32_t W[64]; 110*97447ea4SJohn-Mark Gurney uint32_t S[8]; 111*97447ea4SJohn-Mark Gurney uint32_t t0, t1; 112*97447ea4SJohn-Mark Gurney int i; 113*97447ea4SJohn-Mark Gurney 114*97447ea4SJohn-Mark Gurney /* 1. Prepare message schedule W. */ 115*97447ea4SJohn-Mark Gurney be32dec_vect(W, block, 64); 116*97447ea4SJohn-Mark Gurney for (i = 16; i < 64; i++) 117*97447ea4SJohn-Mark Gurney W[i] = s1(W[i - 2]) + W[i - 7] + s0(W[i - 15]) + W[i - 16]; 118*97447ea4SJohn-Mark Gurney 119*97447ea4SJohn-Mark Gurney /* 2. Initialize working variables. */ 120*97447ea4SJohn-Mark Gurney memcpy(S, state, 32); 121*97447ea4SJohn-Mark Gurney 122*97447ea4SJohn-Mark Gurney /* 3. Mix. */ 123*97447ea4SJohn-Mark Gurney RNDr(S, W, 0, 0x428a2f98); 124*97447ea4SJohn-Mark Gurney RNDr(S, W, 1, 0x71374491); 125*97447ea4SJohn-Mark Gurney RNDr(S, W, 2, 0xb5c0fbcf); 126*97447ea4SJohn-Mark Gurney RNDr(S, W, 3, 0xe9b5dba5); 127*97447ea4SJohn-Mark Gurney RNDr(S, W, 4, 0x3956c25b); 128*97447ea4SJohn-Mark Gurney RNDr(S, W, 5, 0x59f111f1); 129*97447ea4SJohn-Mark Gurney RNDr(S, W, 6, 0x923f82a4); 130*97447ea4SJohn-Mark Gurney RNDr(S, W, 7, 0xab1c5ed5); 131*97447ea4SJohn-Mark Gurney RNDr(S, W, 8, 0xd807aa98); 132*97447ea4SJohn-Mark Gurney RNDr(S, W, 9, 0x12835b01); 133*97447ea4SJohn-Mark Gurney RNDr(S, W, 10, 0x243185be); 134*97447ea4SJohn-Mark Gurney RNDr(S, W, 11, 0x550c7dc3); 135*97447ea4SJohn-Mark Gurney RNDr(S, W, 12, 0x72be5d74); 136*97447ea4SJohn-Mark Gurney RNDr(S, W, 13, 0x80deb1fe); 137*97447ea4SJohn-Mark Gurney RNDr(S, W, 14, 0x9bdc06a7); 138*97447ea4SJohn-Mark Gurney RNDr(S, W, 15, 0xc19bf174); 139*97447ea4SJohn-Mark Gurney RNDr(S, W, 16, 0xe49b69c1); 140*97447ea4SJohn-Mark Gurney RNDr(S, W, 17, 0xefbe4786); 141*97447ea4SJohn-Mark Gurney RNDr(S, W, 18, 0x0fc19dc6); 142*97447ea4SJohn-Mark Gurney RNDr(S, W, 19, 0x240ca1cc); 143*97447ea4SJohn-Mark Gurney RNDr(S, W, 20, 0x2de92c6f); 144*97447ea4SJohn-Mark Gurney RNDr(S, W, 21, 0x4a7484aa); 145*97447ea4SJohn-Mark Gurney RNDr(S, W, 22, 0x5cb0a9dc); 146*97447ea4SJohn-Mark Gurney RNDr(S, W, 23, 0x76f988da); 147*97447ea4SJohn-Mark Gurney RNDr(S, W, 24, 0x983e5152); 148*97447ea4SJohn-Mark Gurney RNDr(S, W, 25, 0xa831c66d); 149*97447ea4SJohn-Mark Gurney RNDr(S, W, 26, 0xb00327c8); 150*97447ea4SJohn-Mark Gurney RNDr(S, W, 27, 0xbf597fc7); 151*97447ea4SJohn-Mark Gurney RNDr(S, W, 28, 0xc6e00bf3); 152*97447ea4SJohn-Mark Gurney RNDr(S, W, 29, 0xd5a79147); 153*97447ea4SJohn-Mark Gurney RNDr(S, W, 30, 0x06ca6351); 154*97447ea4SJohn-Mark Gurney RNDr(S, W, 31, 0x14292967); 155*97447ea4SJohn-Mark Gurney RNDr(S, W, 32, 0x27b70a85); 156*97447ea4SJohn-Mark Gurney RNDr(S, W, 33, 0x2e1b2138); 157*97447ea4SJohn-Mark Gurney RNDr(S, W, 34, 0x4d2c6dfc); 158*97447ea4SJohn-Mark Gurney RNDr(S, W, 35, 0x53380d13); 159*97447ea4SJohn-Mark Gurney RNDr(S, W, 36, 0x650a7354); 160*97447ea4SJohn-Mark Gurney RNDr(S, W, 37, 0x766a0abb); 161*97447ea4SJohn-Mark Gurney RNDr(S, W, 38, 0x81c2c92e); 162*97447ea4SJohn-Mark Gurney RNDr(S, W, 39, 0x92722c85); 163*97447ea4SJohn-Mark Gurney RNDr(S, W, 40, 0xa2bfe8a1); 164*97447ea4SJohn-Mark Gurney RNDr(S, W, 41, 0xa81a664b); 165*97447ea4SJohn-Mark Gurney RNDr(S, W, 42, 0xc24b8b70); 166*97447ea4SJohn-Mark Gurney RNDr(S, W, 43, 0xc76c51a3); 167*97447ea4SJohn-Mark Gurney RNDr(S, W, 44, 0xd192e819); 168*97447ea4SJohn-Mark Gurney RNDr(S, W, 45, 0xd6990624); 169*97447ea4SJohn-Mark Gurney RNDr(S, W, 46, 0xf40e3585); 170*97447ea4SJohn-Mark Gurney RNDr(S, W, 47, 0x106aa070); 171*97447ea4SJohn-Mark Gurney RNDr(S, W, 48, 0x19a4c116); 172*97447ea4SJohn-Mark Gurney RNDr(S, W, 49, 0x1e376c08); 173*97447ea4SJohn-Mark Gurney RNDr(S, W, 50, 0x2748774c); 174*97447ea4SJohn-Mark Gurney RNDr(S, W, 51, 0x34b0bcb5); 175*97447ea4SJohn-Mark Gurney RNDr(S, W, 52, 0x391c0cb3); 176*97447ea4SJohn-Mark Gurney RNDr(S, W, 53, 0x4ed8aa4a); 177*97447ea4SJohn-Mark Gurney RNDr(S, W, 54, 0x5b9cca4f); 178*97447ea4SJohn-Mark Gurney RNDr(S, W, 55, 0x682e6ff3); 179*97447ea4SJohn-Mark Gurney RNDr(S, W, 56, 0x748f82ee); 180*97447ea4SJohn-Mark Gurney RNDr(S, W, 57, 0x78a5636f); 181*97447ea4SJohn-Mark Gurney RNDr(S, W, 58, 0x84c87814); 182*97447ea4SJohn-Mark Gurney RNDr(S, W, 59, 0x8cc70208); 183*97447ea4SJohn-Mark Gurney RNDr(S, W, 60, 0x90befffa); 184*97447ea4SJohn-Mark Gurney RNDr(S, W, 61, 0xa4506ceb); 185*97447ea4SJohn-Mark Gurney RNDr(S, W, 62, 0xbef9a3f7); 186*97447ea4SJohn-Mark Gurney RNDr(S, W, 63, 0xc67178f2); 187*97447ea4SJohn-Mark Gurney 188*97447ea4SJohn-Mark Gurney /* 4. Mix local working variables into global state */ 189*97447ea4SJohn-Mark Gurney for (i = 0; i < 8; i++) 190*97447ea4SJohn-Mark Gurney state[i] += S[i]; 191*97447ea4SJohn-Mark Gurney } 192*97447ea4SJohn-Mark Gurney 193*97447ea4SJohn-Mark Gurney static unsigned char PAD[64] = { 194*97447ea4SJohn-Mark Gurney 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 195*97447ea4SJohn-Mark Gurney 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 196*97447ea4SJohn-Mark Gurney 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 197*97447ea4SJohn-Mark Gurney 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 198*97447ea4SJohn-Mark Gurney }; 199*97447ea4SJohn-Mark Gurney 200*97447ea4SJohn-Mark Gurney /* Add padding and terminating bit-count. */ 201*97447ea4SJohn-Mark Gurney static void 202*97447ea4SJohn-Mark Gurney SHA256_Pad(SHA256_CTX * ctx) 203*97447ea4SJohn-Mark Gurney { 204*97447ea4SJohn-Mark Gurney unsigned char len[8]; 205*97447ea4SJohn-Mark Gurney uint32_t r, plen; 206*97447ea4SJohn-Mark Gurney 207*97447ea4SJohn-Mark Gurney /* 208*97447ea4SJohn-Mark Gurney * Convert length to a vector of bytes -- we do this now rather 209*97447ea4SJohn-Mark Gurney * than later because the length will change after we pad. 210*97447ea4SJohn-Mark Gurney */ 211*97447ea4SJohn-Mark Gurney be64enc(len, ctx->count); 212*97447ea4SJohn-Mark Gurney 213*97447ea4SJohn-Mark Gurney /* Add 1--64 bytes so that the resulting length is 56 mod 64 */ 214*97447ea4SJohn-Mark Gurney r = (ctx->count >> 3) & 0x3f; 215*97447ea4SJohn-Mark Gurney plen = (r < 56) ? (56 - r) : (120 - r); 216*97447ea4SJohn-Mark Gurney SHA256_Update(ctx, PAD, (size_t)plen); 217*97447ea4SJohn-Mark Gurney 218*97447ea4SJohn-Mark Gurney /* Add the terminating bit-count */ 219*97447ea4SJohn-Mark Gurney SHA256_Update(ctx, len, 8); 220*97447ea4SJohn-Mark Gurney } 221*97447ea4SJohn-Mark Gurney 222*97447ea4SJohn-Mark Gurney /* SHA-256 initialization. Begins a SHA-256 operation. */ 223*97447ea4SJohn-Mark Gurney void 224*97447ea4SJohn-Mark Gurney SHA256_Init(SHA256_CTX * ctx) 225*97447ea4SJohn-Mark Gurney { 226*97447ea4SJohn-Mark Gurney 227*97447ea4SJohn-Mark Gurney /* Zero bits processed so far */ 228*97447ea4SJohn-Mark Gurney ctx->count = 0; 229*97447ea4SJohn-Mark Gurney 230*97447ea4SJohn-Mark Gurney /* Magic initialization constants */ 231*97447ea4SJohn-Mark Gurney ctx->state[0] = 0x6A09E667; 232*97447ea4SJohn-Mark Gurney ctx->state[1] = 0xBB67AE85; 233*97447ea4SJohn-Mark Gurney ctx->state[2] = 0x3C6EF372; 234*97447ea4SJohn-Mark Gurney ctx->state[3] = 0xA54FF53A; 235*97447ea4SJohn-Mark Gurney ctx->state[4] = 0x510E527F; 236*97447ea4SJohn-Mark Gurney ctx->state[5] = 0x9B05688C; 237*97447ea4SJohn-Mark Gurney ctx->state[6] = 0x1F83D9AB; 238*97447ea4SJohn-Mark Gurney ctx->state[7] = 0x5BE0CD19; 239*97447ea4SJohn-Mark Gurney } 240*97447ea4SJohn-Mark Gurney 241*97447ea4SJohn-Mark Gurney /* Add bytes into the hash */ 242*97447ea4SJohn-Mark Gurney void 243*97447ea4SJohn-Mark Gurney SHA256_Update(SHA256_CTX * ctx, const void *in, size_t len) 244*97447ea4SJohn-Mark Gurney { 245*97447ea4SJohn-Mark Gurney uint64_t bitlen; 246*97447ea4SJohn-Mark Gurney uint32_t r; 247*97447ea4SJohn-Mark Gurney const unsigned char *src = in; 248*97447ea4SJohn-Mark Gurney 249*97447ea4SJohn-Mark Gurney /* Number of bytes left in the buffer from previous updates */ 250*97447ea4SJohn-Mark Gurney r = (ctx->count >> 3) & 0x3f; 251*97447ea4SJohn-Mark Gurney 252*97447ea4SJohn-Mark Gurney /* Convert the length into a number of bits */ 253*97447ea4SJohn-Mark Gurney bitlen = len << 3; 254*97447ea4SJohn-Mark Gurney 255*97447ea4SJohn-Mark Gurney /* Update number of bits */ 256*97447ea4SJohn-Mark Gurney ctx->count += bitlen; 257*97447ea4SJohn-Mark Gurney 258*97447ea4SJohn-Mark Gurney /* Handle the case where we don't need to perform any transforms */ 259*97447ea4SJohn-Mark Gurney if (len < 64 - r) { 260*97447ea4SJohn-Mark Gurney memcpy(&ctx->buf[r], src, len); 261*97447ea4SJohn-Mark Gurney return; 262*97447ea4SJohn-Mark Gurney } 263*97447ea4SJohn-Mark Gurney 264*97447ea4SJohn-Mark Gurney /* Finish the current block */ 265*97447ea4SJohn-Mark Gurney memcpy(&ctx->buf[r], src, 64 - r); 266*97447ea4SJohn-Mark Gurney SHA256_Transform(ctx->state, ctx->buf); 267*97447ea4SJohn-Mark Gurney src += 64 - r; 268*97447ea4SJohn-Mark Gurney len -= 64 - r; 269*97447ea4SJohn-Mark Gurney 270*97447ea4SJohn-Mark Gurney /* Perform complete blocks */ 271*97447ea4SJohn-Mark Gurney while (len >= 64) { 272*97447ea4SJohn-Mark Gurney SHA256_Transform(ctx->state, src); 273*97447ea4SJohn-Mark Gurney src += 64; 274*97447ea4SJohn-Mark Gurney len -= 64; 275*97447ea4SJohn-Mark Gurney } 276*97447ea4SJohn-Mark Gurney 277*97447ea4SJohn-Mark Gurney /* Copy left over data into buffer */ 278*97447ea4SJohn-Mark Gurney memcpy(ctx->buf, src, len); 279*97447ea4SJohn-Mark Gurney } 280*97447ea4SJohn-Mark Gurney 281*97447ea4SJohn-Mark Gurney /* 282*97447ea4SJohn-Mark Gurney * SHA-256 finalization. Pads the input data, exports the hash value, 283*97447ea4SJohn-Mark Gurney * and clears the context state. 284*97447ea4SJohn-Mark Gurney */ 285*97447ea4SJohn-Mark Gurney void 286*97447ea4SJohn-Mark Gurney SHA256_Final(unsigned char digest[32], SHA256_CTX * ctx) 287*97447ea4SJohn-Mark Gurney { 288*97447ea4SJohn-Mark Gurney 289*97447ea4SJohn-Mark Gurney /* Add padding */ 290*97447ea4SJohn-Mark Gurney SHA256_Pad(ctx); 291*97447ea4SJohn-Mark Gurney 292*97447ea4SJohn-Mark Gurney /* Write the hash */ 293*97447ea4SJohn-Mark Gurney be32enc_vect(digest, ctx->state, 32); 294*97447ea4SJohn-Mark Gurney 295*97447ea4SJohn-Mark Gurney /* Clear the context state */ 296*97447ea4SJohn-Mark Gurney memset((void *)ctx, 0, sizeof(*ctx)); 297*97447ea4SJohn-Mark Gurney } 298