1 b1ec8cee 2023-02-25 thomas /* $OpenBSD: sha2.c,v 1.28 2019/07/23 12:35:22 dtucker Exp $ */
4 b1ec8cee 2023-02-25 thomas * FILE: sha2.c
5 b1ec8cee 2023-02-25 thomas * AUTHOR: Aaron D. Gifford <me@aarongifford.com>
7 b1ec8cee 2023-02-25 thomas * Copyright (c) 2000-2001, Aaron D. Gifford
8 b1ec8cee 2023-02-25 thomas * All rights reserved.
10 b1ec8cee 2023-02-25 thomas * Redistribution and use in source and binary forms, with or without
11 b1ec8cee 2023-02-25 thomas * modification, are permitted provided that the following conditions
12 b1ec8cee 2023-02-25 thomas * are met:
13 b1ec8cee 2023-02-25 thomas * 1. Redistributions of source code must retain the above copyright
14 b1ec8cee 2023-02-25 thomas * notice, this list of conditions and the following disclaimer.
15 b1ec8cee 2023-02-25 thomas * 2. Redistributions in binary form must reproduce the above copyright
16 b1ec8cee 2023-02-25 thomas * notice, this list of conditions and the following disclaimer in the
17 b1ec8cee 2023-02-25 thomas * documentation and/or other materials provided with the distribution.
18 b1ec8cee 2023-02-25 thomas * 3. Neither the name of the copyright holder nor the names of contributors
19 b1ec8cee 2023-02-25 thomas * may be used to endorse or promote products derived from this software
20 b1ec8cee 2023-02-25 thomas * without specific prior written permission.
22 b1ec8cee 2023-02-25 thomas * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``AS IS'' AND
23 b1ec8cee 2023-02-25 thomas * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 b1ec8cee 2023-02-25 thomas * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 b1ec8cee 2023-02-25 thomas * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTOR(S) BE LIABLE
26 b1ec8cee 2023-02-25 thomas * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 b1ec8cee 2023-02-25 thomas * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 b1ec8cee 2023-02-25 thomas * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 b1ec8cee 2023-02-25 thomas * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 b1ec8cee 2023-02-25 thomas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 b1ec8cee 2023-02-25 thomas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 b1ec8cee 2023-02-25 thomas * SUCH DAMAGE.
34 b1ec8cee 2023-02-25 thomas * $From: sha2.c,v 1.1 2001/11/08 00:01:51 adg Exp adg $
37 b1ec8cee 2023-02-25 thomas /* OPENBSD ORIGINAL: lib/libc/hash/sha2.c */
39 b1ec8cee 2023-02-25 thomas #include <string.h>
41 b1ec8cee 2023-02-25 thomas #include "got_compat.h"
43 b1ec8cee 2023-02-25 thomas #define DEF_WEAK(x) void __ssh_compat_weak_##x(void)
45 b1ec8cee 2023-02-25 thomas #if !defined(HAVE_SHA256UPDATE) || !defined(HAVE_SHA384UPDATE) || \
46 b1ec8cee 2023-02-25 thomas !defined(HAVE_SHA512UPDATE)
48 b1ec8cee 2023-02-25 thomas /* no-op out, similar to DEF_WEAK but only needed here */
49 b1ec8cee 2023-02-25 thomas #define MAKE_CLONE(x, y) void __ssh_compat_make_clone_##x_##y(void)
52 b1ec8cee 2023-02-25 thomas * UNROLLED TRANSFORM LOOP NOTE:
53 b1ec8cee 2023-02-25 thomas * You can define SHA2_UNROLL_TRANSFORM to use the unrolled transform
54 b1ec8cee 2023-02-25 thomas * loop version for the hash transform rounds (defined using macros
55 b1ec8cee 2023-02-25 thomas * later in this file). Either define on the command line, for example:
57 b1ec8cee 2023-02-25 thomas * cc -DSHA2_UNROLL_TRANSFORM -o sha2 sha2.c sha2prog.c
59 b1ec8cee 2023-02-25 thomas * or define below:
61 b1ec8cee 2023-02-25 thomas * #define SHA2_UNROLL_TRANSFORM
64 b1ec8cee 2023-02-25 thomas #ifndef SHA2_SMALL
65 b1ec8cee 2023-02-25 thomas #if defined(__amd64__) || defined(__i386__)
66 b1ec8cee 2023-02-25 thomas #define SHA2_UNROLL_TRANSFORM
70 b1ec8cee 2023-02-25 thomas /*** SHA-224/256/384/512 Machine Architecture Definitions *****************/
72 b1ec8cee 2023-02-25 thomas * BYTE_ORDER NOTE:
74 b1ec8cee 2023-02-25 thomas * Please make sure that your system defines BYTE_ORDER. If your
75 b1ec8cee 2023-02-25 thomas * architecture is little-endian, make sure it also defines
76 b1ec8cee 2023-02-25 thomas * LITTLE_ENDIAN and that the two (BYTE_ORDER and LITTLE_ENDIAN) are
77 b1ec8cee 2023-02-25 thomas * equivalent.
79 b1ec8cee 2023-02-25 thomas * If your system does not define the above, then you can do so by
80 b1ec8cee 2023-02-25 thomas * hand like this:
82 b1ec8cee 2023-02-25 thomas * #define LITTLE_ENDIAN 1234
83 b1ec8cee 2023-02-25 thomas * #define BIG_ENDIAN 4321
85 b1ec8cee 2023-02-25 thomas * And for little-endian machines, add:
87 b1ec8cee 2023-02-25 thomas * #define BYTE_ORDER LITTLE_ENDIAN
89 b1ec8cee 2023-02-25 thomas * Or for big-endian machines:
91 b1ec8cee 2023-02-25 thomas * #define BYTE_ORDER BIG_ENDIAN
93 b1ec8cee 2023-02-25 thomas * The FreeBSD machine this was written on defines BYTE_ORDER
94 b1ec8cee 2023-02-25 thomas * appropriately by including <sys/types.h> (which in turn includes
95 b1ec8cee 2023-02-25 thomas * <machine/endian.h> where the appropriate definitions are actually
98 b1ec8cee 2023-02-25 thomas #if !defined(BYTE_ORDER) || (BYTE_ORDER != LITTLE_ENDIAN && BYTE_ORDER != BIG_ENDIAN)
99 b1ec8cee 2023-02-25 thomas #error Define BYTE_ORDER to be equal to either LITTLE_ENDIAN or BIG_ENDIAN
103 b1ec8cee 2023-02-25 thomas /*** SHA-224/256/384/512 Various Length Definitions ***********************/
104 b1ec8cee 2023-02-25 thomas /* NOTE: Most of these are in sha2.h */
105 b1ec8cee 2023-02-25 thomas #define SHA224_SHORT_BLOCK_LENGTH (SHA224_BLOCK_LENGTH - 8)
106 b1ec8cee 2023-02-25 thomas #define SHA256_SHORT_BLOCK_LENGTH (SHA256_BLOCK_LENGTH - 8)
107 b1ec8cee 2023-02-25 thomas #define SHA384_SHORT_BLOCK_LENGTH (SHA384_BLOCK_LENGTH - 16)
108 b1ec8cee 2023-02-25 thomas #define SHA512_SHORT_BLOCK_LENGTH (SHA512_BLOCK_LENGTH - 16)
110 b1ec8cee 2023-02-25 thomas /*** ENDIAN SPECIFIC COPY MACROS **************************************/
111 b1ec8cee 2023-02-25 thomas #define BE_8_TO_32(dst, cp) do { \
112 b1ec8cee 2023-02-25 thomas (dst) = (u_int32_t)(cp)[3] | ((u_int32_t)(cp)[2] << 8) | \
113 b1ec8cee 2023-02-25 thomas ((u_int32_t)(cp)[1] << 16) | ((u_int32_t)(cp)[0] << 24); \
114 b1ec8cee 2023-02-25 thomas } while(0)
116 b1ec8cee 2023-02-25 thomas #define BE_8_TO_64(dst, cp) do { \
117 b1ec8cee 2023-02-25 thomas (dst) = (u_int64_t)(cp)[7] | ((u_int64_t)(cp)[6] << 8) | \
118 b1ec8cee 2023-02-25 thomas ((u_int64_t)(cp)[5] << 16) | ((u_int64_t)(cp)[4] << 24) | \
119 b1ec8cee 2023-02-25 thomas ((u_int64_t)(cp)[3] << 32) | ((u_int64_t)(cp)[2] << 40) | \
120 b1ec8cee 2023-02-25 thomas ((u_int64_t)(cp)[1] << 48) | ((u_int64_t)(cp)[0] << 56); \
121 b1ec8cee 2023-02-25 thomas } while (0)
123 b1ec8cee 2023-02-25 thomas #define BE_64_TO_8(cp, src) do { \
124 b1ec8cee 2023-02-25 thomas (cp)[0] = (src) >> 56; \
125 b1ec8cee 2023-02-25 thomas (cp)[1] = (src) >> 48; \
126 b1ec8cee 2023-02-25 thomas (cp)[2] = (src) >> 40; \
127 b1ec8cee 2023-02-25 thomas (cp)[3] = (src) >> 32; \
128 b1ec8cee 2023-02-25 thomas (cp)[4] = (src) >> 24; \
129 b1ec8cee 2023-02-25 thomas (cp)[5] = (src) >> 16; \
130 b1ec8cee 2023-02-25 thomas (cp)[6] = (src) >> 8; \
131 b1ec8cee 2023-02-25 thomas (cp)[7] = (src); \
132 b1ec8cee 2023-02-25 thomas } while (0)
134 b1ec8cee 2023-02-25 thomas #define BE_32_TO_8(cp, src) do { \
135 b1ec8cee 2023-02-25 thomas (cp)[0] = (src) >> 24; \
136 b1ec8cee 2023-02-25 thomas (cp)[1] = (src) >> 16; \
137 b1ec8cee 2023-02-25 thomas (cp)[2] = (src) >> 8; \
138 b1ec8cee 2023-02-25 thomas (cp)[3] = (src); \
139 b1ec8cee 2023-02-25 thomas } while (0)
142 b1ec8cee 2023-02-25 thomas * Macro for incrementally adding the unsigned 64-bit integer n to the
143 b1ec8cee 2023-02-25 thomas * unsigned 128-bit integer (represented using a two-element array of
144 b1ec8cee 2023-02-25 thomas * 64-bit words):
146 b1ec8cee 2023-02-25 thomas #define ADDINC128(w,n) do { \
147 b1ec8cee 2023-02-25 thomas (w)[0] += (u_int64_t)(n); \
148 b1ec8cee 2023-02-25 thomas if ((w)[0] < (n)) { \
149 b1ec8cee 2023-02-25 thomas (w)[1]++; \
151 b1ec8cee 2023-02-25 thomas } while (0)
153 b1ec8cee 2023-02-25 thomas /*** THE SIX LOGICAL FUNCTIONS ****************************************/
155 b1ec8cee 2023-02-25 thomas * Bit shifting and rotation (used by the six SHA-XYZ logical functions:
157 b1ec8cee 2023-02-25 thomas * NOTE: The naming of R and S appears backwards here (R is a SHIFT and
158 b1ec8cee 2023-02-25 thomas * S is a ROTATION) because the SHA-224/256/384/512 description document
159 b1ec8cee 2023-02-25 thomas * (see http://csrc.nist.gov/cryptval/shs/sha256-384-512.pdf) uses this
160 b1ec8cee 2023-02-25 thomas * same "backwards" definition.
162 b1ec8cee 2023-02-25 thomas /* Shift-right (used in SHA-224, SHA-256, SHA-384, and SHA-512): */
163 b1ec8cee 2023-02-25 thomas #define R(b,x) ((x) >> (b))
164 b1ec8cee 2023-02-25 thomas /* 32-bit Rotate-right (used in SHA-224 and SHA-256): */
165 b1ec8cee 2023-02-25 thomas #define S32(b,x) (((x) >> (b)) | ((x) << (32 - (b))))
166 b1ec8cee 2023-02-25 thomas /* 64-bit Rotate-right (used in SHA-384 and SHA-512): */
167 b1ec8cee 2023-02-25 thomas #define S64(b,x) (((x) >> (b)) | ((x) << (64 - (b))))
169 b1ec8cee 2023-02-25 thomas /* Two of six logical functions used in SHA-224, SHA-256, SHA-384, and SHA-512: */
170 b1ec8cee 2023-02-25 thomas #define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
171 b1ec8cee 2023-02-25 thomas #define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
173 b1ec8cee 2023-02-25 thomas /* Four of six logical functions used in SHA-224 and SHA-256: */
174 b1ec8cee 2023-02-25 thomas #define Sigma0_256(x) (S32(2, (x)) ^ S32(13, (x)) ^ S32(22, (x)))
175 b1ec8cee 2023-02-25 thomas #define Sigma1_256(x) (S32(6, (x)) ^ S32(11, (x)) ^ S32(25, (x)))
176 b1ec8cee 2023-02-25 thomas #define sigma0_256(x) (S32(7, (x)) ^ S32(18, (x)) ^ R(3 , (x)))
177 b1ec8cee 2023-02-25 thomas #define sigma1_256(x) (S32(17, (x)) ^ S32(19, (x)) ^ R(10, (x)))
179 b1ec8cee 2023-02-25 thomas /* Four of six logical functions used in SHA-384 and SHA-512: */
180 b1ec8cee 2023-02-25 thomas #define Sigma0_512(x) (S64(28, (x)) ^ S64(34, (x)) ^ S64(39, (x)))
181 b1ec8cee 2023-02-25 thomas #define Sigma1_512(x) (S64(14, (x)) ^ S64(18, (x)) ^ S64(41, (x)))
182 b1ec8cee 2023-02-25 thomas #define sigma0_512(x) (S64( 1, (x)) ^ S64( 8, (x)) ^ R( 7, (x)))
183 b1ec8cee 2023-02-25 thomas #define sigma1_512(x) (S64(19, (x)) ^ S64(61, (x)) ^ R( 6, (x)))
186 b1ec8cee 2023-02-25 thomas /*** SHA-XYZ INITIAL HASH VALUES AND CONSTANTS ************************/
187 b1ec8cee 2023-02-25 thomas /* Hash constant words K for SHA-224 and SHA-256: */
188 b1ec8cee 2023-02-25 thomas static const u_int32_t K256[64] = {
189 b1ec8cee 2023-02-25 thomas 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL,
190 b1ec8cee 2023-02-25 thomas 0x3956c25bUL, 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL,
191 b1ec8cee 2023-02-25 thomas 0xd807aa98UL, 0x12835b01UL, 0x243185beUL, 0x550c7dc3UL,
192 b1ec8cee 2023-02-25 thomas 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL, 0xc19bf174UL,
193 b1ec8cee 2023-02-25 thomas 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL,
194 b1ec8cee 2023-02-25 thomas 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL,
195 b1ec8cee 2023-02-25 thomas 0x983e5152UL, 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL,
196 b1ec8cee 2023-02-25 thomas 0xc6e00bf3UL, 0xd5a79147UL, 0x06ca6351UL, 0x14292967UL,
197 b1ec8cee 2023-02-25 thomas 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL, 0x53380d13UL,
198 b1ec8cee 2023-02-25 thomas 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL,
199 b1ec8cee 2023-02-25 thomas 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL,
200 b1ec8cee 2023-02-25 thomas 0xd192e819UL, 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL,
201 b1ec8cee 2023-02-25 thomas 0x19a4c116UL, 0x1e376c08UL, 0x2748774cUL, 0x34b0bcb5UL,
202 b1ec8cee 2023-02-25 thomas 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL, 0x682e6ff3UL,
203 b1ec8cee 2023-02-25 thomas 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL,
204 b1ec8cee 2023-02-25 thomas 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL
207 b1ec8cee 2023-02-25 thomas /* Initial hash value H for SHA-256: */
208 b1ec8cee 2023-02-25 thomas static const u_int32_t sha256_initial_hash_value[8] = {
209 b1ec8cee 2023-02-25 thomas 0x6a09e667UL,
210 b1ec8cee 2023-02-25 thomas 0xbb67ae85UL,
211 b1ec8cee 2023-02-25 thomas 0x3c6ef372UL,
212 b1ec8cee 2023-02-25 thomas 0xa54ff53aUL,
213 b1ec8cee 2023-02-25 thomas 0x510e527fUL,
214 b1ec8cee 2023-02-25 thomas 0x9b05688cUL,
215 b1ec8cee 2023-02-25 thomas 0x1f83d9abUL,
216 b1ec8cee 2023-02-25 thomas 0x5be0cd19UL
219 b1ec8cee 2023-02-25 thomas /* Hash constant words K for SHA-384 and SHA-512: */
220 b1ec8cee 2023-02-25 thomas static const u_int64_t K512[80] = {
221 b1ec8cee 2023-02-25 thomas 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL,
222 b1ec8cee 2023-02-25 thomas 0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,
223 b1ec8cee 2023-02-25 thomas 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
224 b1ec8cee 2023-02-25 thomas 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,
225 b1ec8cee 2023-02-25 thomas 0xd807aa98a3030242ULL, 0x12835b0145706fbeULL,
226 b1ec8cee 2023-02-25 thomas 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
227 b1ec8cee 2023-02-25 thomas 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL,
228 b1ec8cee 2023-02-25 thomas 0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,
229 b1ec8cee 2023-02-25 thomas 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
230 b1ec8cee 2023-02-25 thomas 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,
231 b1ec8cee 2023-02-25 thomas 0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL,
232 b1ec8cee 2023-02-25 thomas 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
233 b1ec8cee 2023-02-25 thomas 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL,
234 b1ec8cee 2023-02-25 thomas 0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,
235 b1ec8cee 2023-02-25 thomas 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
236 b1ec8cee 2023-02-25 thomas 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,
237 b1ec8cee 2023-02-25 thomas 0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL,
238 b1ec8cee 2023-02-25 thomas 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
239 b1ec8cee 2023-02-25 thomas 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL,
240 b1ec8cee 2023-02-25 thomas 0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,
241 b1ec8cee 2023-02-25 thomas 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
242 b1ec8cee 2023-02-25 thomas 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,
243 b1ec8cee 2023-02-25 thomas 0xd192e819d6ef5218ULL, 0xd69906245565a910ULL,
244 b1ec8cee 2023-02-25 thomas 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
245 b1ec8cee 2023-02-25 thomas 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL,
246 b1ec8cee 2023-02-25 thomas 0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,
247 b1ec8cee 2023-02-25 thomas 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
248 b1ec8cee 2023-02-25 thomas 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,
249 b1ec8cee 2023-02-25 thomas 0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL,
250 b1ec8cee 2023-02-25 thomas 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
251 b1ec8cee 2023-02-25 thomas 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL,
252 b1ec8cee 2023-02-25 thomas 0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,
253 b1ec8cee 2023-02-25 thomas 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
254 b1ec8cee 2023-02-25 thomas 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,
255 b1ec8cee 2023-02-25 thomas 0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL,
256 b1ec8cee 2023-02-25 thomas 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
257 b1ec8cee 2023-02-25 thomas 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL,
258 b1ec8cee 2023-02-25 thomas 0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,
259 b1ec8cee 2023-02-25 thomas 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
260 b1ec8cee 2023-02-25 thomas 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL
263 b1ec8cee 2023-02-25 thomas /* Initial hash value H for SHA-512 */
264 b1ec8cee 2023-02-25 thomas static const u_int64_t sha512_initial_hash_value[8] = {
265 b1ec8cee 2023-02-25 thomas 0x6a09e667f3bcc908ULL,
266 b1ec8cee 2023-02-25 thomas 0xbb67ae8584caa73bULL,
267 b1ec8cee 2023-02-25 thomas 0x3c6ef372fe94f82bULL,
268 b1ec8cee 2023-02-25 thomas 0xa54ff53a5f1d36f1ULL,
269 b1ec8cee 2023-02-25 thomas 0x510e527fade682d1ULL,
270 b1ec8cee 2023-02-25 thomas 0x9b05688c2b3e6c1fULL,
271 b1ec8cee 2023-02-25 thomas 0x1f83d9abfb41bd6bULL,
272 b1ec8cee 2023-02-25 thomas 0x5be0cd19137e2179ULL
275 b1ec8cee 2023-02-25 thomas #if !defined(SHA2_SMALL)
277 b1ec8cee 2023-02-25 thomas /* Initial hash value H for SHA-224: */
278 b1ec8cee 2023-02-25 thomas static const u_int32_t sha224_initial_hash_value[8] = {
279 b1ec8cee 2023-02-25 thomas 0xc1059ed8UL,
280 b1ec8cee 2023-02-25 thomas 0x367cd507UL,
281 b1ec8cee 2023-02-25 thomas 0x3070dd17UL,
282 b1ec8cee 2023-02-25 thomas 0xf70e5939UL,
283 b1ec8cee 2023-02-25 thomas 0xffc00b31UL,
284 b1ec8cee 2023-02-25 thomas 0x68581511UL,
285 b1ec8cee 2023-02-25 thomas 0x64f98fa7UL,
286 b1ec8cee 2023-02-25 thomas 0xbefa4fa4UL
288 b1ec8cee 2023-02-25 thomas #endif /* 0 */
290 b1ec8cee 2023-02-25 thomas /* Initial hash value H for SHA-384 */
291 b1ec8cee 2023-02-25 thomas static const u_int64_t sha384_initial_hash_value[8] = {
292 b1ec8cee 2023-02-25 thomas 0xcbbb9d5dc1059ed8ULL,
293 b1ec8cee 2023-02-25 thomas 0x629a292a367cd507ULL,
294 b1ec8cee 2023-02-25 thomas 0x9159015a3070dd17ULL,
295 b1ec8cee 2023-02-25 thomas 0x152fecd8f70e5939ULL,
296 b1ec8cee 2023-02-25 thomas 0x67332667ffc00b31ULL,
297 b1ec8cee 2023-02-25 thomas 0x8eb44a8768581511ULL,
298 b1ec8cee 2023-02-25 thomas 0xdb0c2e0d64f98fa7ULL,
299 b1ec8cee 2023-02-25 thomas 0x47b5481dbefa4fa4ULL
303 b1ec8cee 2023-02-25 thomas /* Initial hash value H for SHA-512-256 */
304 b1ec8cee 2023-02-25 thomas static const u_int64_t sha512_256_initial_hash_value[8] = {
305 b1ec8cee 2023-02-25 thomas 0x22312194fc2bf72cULL,
306 b1ec8cee 2023-02-25 thomas 0x9f555fa3c84c64c2ULL,
307 b1ec8cee 2023-02-25 thomas 0x2393b86b6f53b151ULL,
308 b1ec8cee 2023-02-25 thomas 0x963877195940eabdULL,
309 b1ec8cee 2023-02-25 thomas 0x96283ee2a88effe3ULL,
310 b1ec8cee 2023-02-25 thomas 0xbe5e1e2553863992ULL,
311 b1ec8cee 2023-02-25 thomas 0x2b0199fc2c85b8aaULL,
312 b1ec8cee 2023-02-25 thomas 0x0eb72ddc81c52ca2ULL
315 b1ec8cee 2023-02-25 thomas /*** SHA-224: *********************************************************/
317 b1ec8cee 2023-02-25 thomas SHA224Init(SHA2_CTX *context)
319 b1ec8cee 2023-02-25 thomas memcpy(context->state.st32, sha224_initial_hash_value,
320 b1ec8cee 2023-02-25 thomas sizeof(sha224_initial_hash_value));
321 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, sizeof(context->buffer));
322 b1ec8cee 2023-02-25 thomas context->bitcount[0] = 0;
324 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA224Init);
326 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA224Transform, SHA256Transform);
327 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA224Update, SHA256Update);
328 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA224Pad, SHA256Pad);
329 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA224Transform);
330 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA224Update);
331 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA224Pad);
334 b1ec8cee 2023-02-25 thomas SHA224Final(u_int8_t digest[SHA224_DIGEST_LENGTH], SHA2_CTX *context)
336 b1ec8cee 2023-02-25 thomas SHA224Pad(context);
338 b1ec8cee 2023-02-25 thomas #if BYTE_ORDER == LITTLE_ENDIAN
341 b1ec8cee 2023-02-25 thomas /* Convert TO host byte order */
342 b1ec8cee 2023-02-25 thomas for (i = 0; i < 7; i++)
343 b1ec8cee 2023-02-25 thomas BE_32_TO_8(digest + i * 4, context->state.st32[i]);
345 b1ec8cee 2023-02-25 thomas memcpy(digest, context->state.st32, SHA224_DIGEST_LENGTH);
347 b1ec8cee 2023-02-25 thomas explicit_bzero(context, sizeof(*context));
349 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA224Final);
350 b1ec8cee 2023-02-25 thomas #endif /* !defined(SHA2_SMALL) */
351 b1ec8cee 2023-02-25 thomas #endif /* 0 */
353 b1ec8cee 2023-02-25 thomas /*** SHA-256: *********************************************************/
355 b1ec8cee 2023-02-25 thomas SHA256Init(SHA2_CTX *context)
357 b1ec8cee 2023-02-25 thomas memcpy(context->state.st32, sha256_initial_hash_value,
358 b1ec8cee 2023-02-25 thomas sizeof(sha256_initial_hash_value));
359 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, sizeof(context->buffer));
360 b1ec8cee 2023-02-25 thomas context->bitcount[0] = 0;
362 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA256Init);
364 b1ec8cee 2023-02-25 thomas #ifdef SHA2_UNROLL_TRANSFORM
366 b1ec8cee 2023-02-25 thomas /* Unrolled SHA-256 round macros: */
368 b1ec8cee 2023-02-25 thomas #define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) do { \
369 b1ec8cee 2023-02-25 thomas BE_8_TO_32(W256[j], data); \
370 b1ec8cee 2023-02-25 thomas data += 4; \
371 b1ec8cee 2023-02-25 thomas T1 = (h) + Sigma1_256((e)) + Ch((e), (f), (g)) + K256[j] + W256[j]; \
372 b1ec8cee 2023-02-25 thomas (d) += T1; \
373 b1ec8cee 2023-02-25 thomas (h) = T1 + Sigma0_256((a)) + Maj((a), (b), (c)); \
375 b1ec8cee 2023-02-25 thomas } while(0)
377 b1ec8cee 2023-02-25 thomas #define ROUND256(a,b,c,d,e,f,g,h) do { \
378 b1ec8cee 2023-02-25 thomas s0 = W256[(j+1)&0x0f]; \
379 b1ec8cee 2023-02-25 thomas s0 = sigma0_256(s0); \
380 b1ec8cee 2023-02-25 thomas s1 = W256[(j+14)&0x0f]; \
381 b1ec8cee 2023-02-25 thomas s1 = sigma1_256(s1); \
382 b1ec8cee 2023-02-25 thomas T1 = (h) + Sigma1_256((e)) + Ch((e), (f), (g)) + K256[j] + \
383 b1ec8cee 2023-02-25 thomas (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0); \
384 b1ec8cee 2023-02-25 thomas (d) += T1; \
385 b1ec8cee 2023-02-25 thomas (h) = T1 + Sigma0_256((a)) + Maj((a), (b), (c)); \
387 b1ec8cee 2023-02-25 thomas } while(0)
390 b1ec8cee 2023-02-25 thomas SHA256Transform(u_int32_t state[8], const u_int8_t data[SHA256_BLOCK_LENGTH])
392 b1ec8cee 2023-02-25 thomas u_int32_t a, b, c, d, e, f, g, h, s0, s1;
393 b1ec8cee 2023-02-25 thomas u_int32_t T1, W256[16];
396 b1ec8cee 2023-02-25 thomas /* Initialize registers with the prev. intermediate value */
397 b1ec8cee 2023-02-25 thomas a = state[0];
398 b1ec8cee 2023-02-25 thomas b = state[1];
399 b1ec8cee 2023-02-25 thomas c = state[2];
400 b1ec8cee 2023-02-25 thomas d = state[3];
401 b1ec8cee 2023-02-25 thomas e = state[4];
402 b1ec8cee 2023-02-25 thomas f = state[5];
403 b1ec8cee 2023-02-25 thomas g = state[6];
404 b1ec8cee 2023-02-25 thomas h = state[7];
408 b1ec8cee 2023-02-25 thomas /* Rounds 0 to 15 (unrolled): */
409 b1ec8cee 2023-02-25 thomas ROUND256_0_TO_15(a,b,c,d,e,f,g,h);
410 b1ec8cee 2023-02-25 thomas ROUND256_0_TO_15(h,a,b,c,d,e,f,g);
411 b1ec8cee 2023-02-25 thomas ROUND256_0_TO_15(g,h,a,b,c,d,e,f);
412 b1ec8cee 2023-02-25 thomas ROUND256_0_TO_15(f,g,h,a,b,c,d,e);
413 b1ec8cee 2023-02-25 thomas ROUND256_0_TO_15(e,f,g,h,a,b,c,d);
414 b1ec8cee 2023-02-25 thomas ROUND256_0_TO_15(d,e,f,g,h,a,b,c);
415 b1ec8cee 2023-02-25 thomas ROUND256_0_TO_15(c,d,e,f,g,h,a,b);
416 b1ec8cee 2023-02-25 thomas ROUND256_0_TO_15(b,c,d,e,f,g,h,a);
417 b1ec8cee 2023-02-25 thomas } while (j < 16);
419 b1ec8cee 2023-02-25 thomas /* Now for the remaining rounds up to 63: */
421 b1ec8cee 2023-02-25 thomas ROUND256(a,b,c,d,e,f,g,h);
422 b1ec8cee 2023-02-25 thomas ROUND256(h,a,b,c,d,e,f,g);
423 b1ec8cee 2023-02-25 thomas ROUND256(g,h,a,b,c,d,e,f);
424 b1ec8cee 2023-02-25 thomas ROUND256(f,g,h,a,b,c,d,e);
425 b1ec8cee 2023-02-25 thomas ROUND256(e,f,g,h,a,b,c,d);
426 b1ec8cee 2023-02-25 thomas ROUND256(d,e,f,g,h,a,b,c);
427 b1ec8cee 2023-02-25 thomas ROUND256(c,d,e,f,g,h,a,b);
428 b1ec8cee 2023-02-25 thomas ROUND256(b,c,d,e,f,g,h,a);
429 b1ec8cee 2023-02-25 thomas } while (j < 64);
431 b1ec8cee 2023-02-25 thomas /* Compute the current intermediate hash value */
432 b1ec8cee 2023-02-25 thomas state[0] += a;
433 b1ec8cee 2023-02-25 thomas state[1] += b;
434 b1ec8cee 2023-02-25 thomas state[2] += c;
435 b1ec8cee 2023-02-25 thomas state[3] += d;
436 b1ec8cee 2023-02-25 thomas state[4] += e;
437 b1ec8cee 2023-02-25 thomas state[5] += f;
438 b1ec8cee 2023-02-25 thomas state[6] += g;
439 b1ec8cee 2023-02-25 thomas state[7] += h;
441 b1ec8cee 2023-02-25 thomas /* Clean up */
442 b1ec8cee 2023-02-25 thomas a = b = c = d = e = f = g = h = T1 = 0;
445 b1ec8cee 2023-02-25 thomas #else /* SHA2_UNROLL_TRANSFORM */
448 b1ec8cee 2023-02-25 thomas SHA256Transform(u_int32_t state[8], const u_int8_t data[SHA256_BLOCK_LENGTH])
450 b1ec8cee 2023-02-25 thomas u_int32_t a, b, c, d, e, f, g, h, s0, s1;
451 b1ec8cee 2023-02-25 thomas u_int32_t T1, T2, W256[16];
454 b1ec8cee 2023-02-25 thomas /* Initialize registers with the prev. intermediate value */
455 b1ec8cee 2023-02-25 thomas a = state[0];
456 b1ec8cee 2023-02-25 thomas b = state[1];
457 b1ec8cee 2023-02-25 thomas c = state[2];
458 b1ec8cee 2023-02-25 thomas d = state[3];
459 b1ec8cee 2023-02-25 thomas e = state[4];
460 b1ec8cee 2023-02-25 thomas f = state[5];
461 b1ec8cee 2023-02-25 thomas g = state[6];
462 b1ec8cee 2023-02-25 thomas h = state[7];
466 b1ec8cee 2023-02-25 thomas BE_8_TO_32(W256[j], data);
467 b1ec8cee 2023-02-25 thomas data += 4;
468 b1ec8cee 2023-02-25 thomas /* Apply the SHA-256 compression function to update a..h */
469 b1ec8cee 2023-02-25 thomas T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + W256[j];
470 b1ec8cee 2023-02-25 thomas T2 = Sigma0_256(a) + Maj(a, b, c);
474 b1ec8cee 2023-02-25 thomas e = d + T1;
478 b1ec8cee 2023-02-25 thomas a = T1 + T2;
481 b1ec8cee 2023-02-25 thomas } while (j < 16);
484 b1ec8cee 2023-02-25 thomas /* Part of the message block expansion: */
485 b1ec8cee 2023-02-25 thomas s0 = W256[(j+1)&0x0f];
486 b1ec8cee 2023-02-25 thomas s0 = sigma0_256(s0);
487 b1ec8cee 2023-02-25 thomas s1 = W256[(j+14)&0x0f];
488 b1ec8cee 2023-02-25 thomas s1 = sigma1_256(s1);
490 b1ec8cee 2023-02-25 thomas /* Apply the SHA-256 compression function to update a..h */
491 b1ec8cee 2023-02-25 thomas T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] +
492 b1ec8cee 2023-02-25 thomas (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0);
493 b1ec8cee 2023-02-25 thomas T2 = Sigma0_256(a) + Maj(a, b, c);
497 b1ec8cee 2023-02-25 thomas e = d + T1;
501 b1ec8cee 2023-02-25 thomas a = T1 + T2;
504 b1ec8cee 2023-02-25 thomas } while (j < 64);
506 b1ec8cee 2023-02-25 thomas /* Compute the current intermediate hash value */
507 b1ec8cee 2023-02-25 thomas state[0] += a;
508 b1ec8cee 2023-02-25 thomas state[1] += b;
509 b1ec8cee 2023-02-25 thomas state[2] += c;
510 b1ec8cee 2023-02-25 thomas state[3] += d;
511 b1ec8cee 2023-02-25 thomas state[4] += e;
512 b1ec8cee 2023-02-25 thomas state[5] += f;
513 b1ec8cee 2023-02-25 thomas state[6] += g;
514 b1ec8cee 2023-02-25 thomas state[7] += h;
516 b1ec8cee 2023-02-25 thomas /* Clean up */
517 b1ec8cee 2023-02-25 thomas a = b = c = d = e = f = g = h = T1 = T2 = 0;
520 b1ec8cee 2023-02-25 thomas #endif /* SHA2_UNROLL_TRANSFORM */
521 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA256Transform);
524 b1ec8cee 2023-02-25 thomas SHA256Update(SHA2_CTX *context, const u_int8_t *data, size_t len)
526 b1ec8cee 2023-02-25 thomas u_int64_t freespace, usedspace;
528 b1ec8cee 2023-02-25 thomas /* Calling with no data is valid (we do nothing) */
529 b1ec8cee 2023-02-25 thomas if (len == 0)
532 b1ec8cee 2023-02-25 thomas usedspace = (context->bitcount[0] >> 3) % SHA256_BLOCK_LENGTH;
533 b1ec8cee 2023-02-25 thomas if (usedspace > 0) {
534 b1ec8cee 2023-02-25 thomas /* Calculate how much free space is available in the buffer */
535 b1ec8cee 2023-02-25 thomas freespace = SHA256_BLOCK_LENGTH - usedspace;
537 b1ec8cee 2023-02-25 thomas if (len >= freespace) {
538 b1ec8cee 2023-02-25 thomas /* Fill the buffer completely and process it */
539 b1ec8cee 2023-02-25 thomas memcpy(&context->buffer[usedspace], data, freespace);
540 b1ec8cee 2023-02-25 thomas context->bitcount[0] += freespace << 3;
541 b1ec8cee 2023-02-25 thomas len -= freespace;
542 b1ec8cee 2023-02-25 thomas data += freespace;
543 b1ec8cee 2023-02-25 thomas SHA256Transform(context->state.st32, context->buffer);
545 b1ec8cee 2023-02-25 thomas /* The buffer is not yet full */
546 b1ec8cee 2023-02-25 thomas memcpy(&context->buffer[usedspace], data, len);
547 b1ec8cee 2023-02-25 thomas context->bitcount[0] += (u_int64_t)len << 3;
548 b1ec8cee 2023-02-25 thomas /* Clean up: */
549 b1ec8cee 2023-02-25 thomas usedspace = freespace = 0;
553 b1ec8cee 2023-02-25 thomas while (len >= SHA256_BLOCK_LENGTH) {
554 b1ec8cee 2023-02-25 thomas /* Process as many complete blocks as we can */
555 b1ec8cee 2023-02-25 thomas SHA256Transform(context->state.st32, data);
556 b1ec8cee 2023-02-25 thomas context->bitcount[0] += SHA256_BLOCK_LENGTH << 3;
557 b1ec8cee 2023-02-25 thomas len -= SHA256_BLOCK_LENGTH;
558 b1ec8cee 2023-02-25 thomas data += SHA256_BLOCK_LENGTH;
560 b1ec8cee 2023-02-25 thomas if (len > 0) {
561 b1ec8cee 2023-02-25 thomas /* There's left-overs, so save 'em */
562 b1ec8cee 2023-02-25 thomas memcpy(context->buffer, data, len);
563 b1ec8cee 2023-02-25 thomas context->bitcount[0] += len << 3;
565 b1ec8cee 2023-02-25 thomas /* Clean up: */
566 b1ec8cee 2023-02-25 thomas usedspace = freespace = 0;
568 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA256Update);
571 b1ec8cee 2023-02-25 thomas SHA256Pad(SHA2_CTX *context)
573 b1ec8cee 2023-02-25 thomas unsigned int usedspace;
575 b1ec8cee 2023-02-25 thomas usedspace = (context->bitcount[0] >> 3) % SHA256_BLOCK_LENGTH;
576 b1ec8cee 2023-02-25 thomas if (usedspace > 0) {
577 b1ec8cee 2023-02-25 thomas /* Begin padding with a 1 bit: */
578 b1ec8cee 2023-02-25 thomas context->buffer[usedspace++] = 0x80;
580 b1ec8cee 2023-02-25 thomas if (usedspace <= SHA256_SHORT_BLOCK_LENGTH) {
581 b1ec8cee 2023-02-25 thomas /* Set-up for the last transform: */
582 b1ec8cee 2023-02-25 thomas memset(&context->buffer[usedspace], 0,
583 b1ec8cee 2023-02-25 thomas SHA256_SHORT_BLOCK_LENGTH - usedspace);
585 b1ec8cee 2023-02-25 thomas if (usedspace < SHA256_BLOCK_LENGTH) {
586 b1ec8cee 2023-02-25 thomas memset(&context->buffer[usedspace], 0,
587 b1ec8cee 2023-02-25 thomas SHA256_BLOCK_LENGTH - usedspace);
589 b1ec8cee 2023-02-25 thomas /* Do second-to-last transform: */
590 b1ec8cee 2023-02-25 thomas SHA256Transform(context->state.st32, context->buffer);
592 b1ec8cee 2023-02-25 thomas /* Prepare for last transform: */
593 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, SHA256_SHORT_BLOCK_LENGTH);
596 b1ec8cee 2023-02-25 thomas /* Set-up for the last transform: */
597 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, SHA256_SHORT_BLOCK_LENGTH);
599 b1ec8cee 2023-02-25 thomas /* Begin padding with a 1 bit: */
600 b1ec8cee 2023-02-25 thomas *context->buffer = 0x80;
602 b1ec8cee 2023-02-25 thomas /* Store the length of input data (in bits) in big endian format: */
603 b1ec8cee 2023-02-25 thomas BE_64_TO_8(&context->buffer[SHA256_SHORT_BLOCK_LENGTH],
604 b1ec8cee 2023-02-25 thomas context->bitcount[0]);
606 b1ec8cee 2023-02-25 thomas /* Final transform: */
607 b1ec8cee 2023-02-25 thomas SHA256Transform(context->state.st32, context->buffer);
609 b1ec8cee 2023-02-25 thomas /* Clean up: */
610 b1ec8cee 2023-02-25 thomas usedspace = 0;
612 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA256Pad);
615 b1ec8cee 2023-02-25 thomas SHA256Final(u_int8_t digest[SHA256_DIGEST_LENGTH], SHA2_CTX *context)
617 b1ec8cee 2023-02-25 thomas SHA256Pad(context);
619 b1ec8cee 2023-02-25 thomas #if BYTE_ORDER == LITTLE_ENDIAN
622 b1ec8cee 2023-02-25 thomas /* Convert TO host byte order */
623 b1ec8cee 2023-02-25 thomas for (i = 0; i < 8; i++)
624 b1ec8cee 2023-02-25 thomas BE_32_TO_8(digest + i * 4, context->state.st32[i]);
626 b1ec8cee 2023-02-25 thomas memcpy(digest, context->state.st32, SHA256_DIGEST_LENGTH);
628 b1ec8cee 2023-02-25 thomas explicit_bzero(context, sizeof(*context));
630 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA256Final);
633 b1ec8cee 2023-02-25 thomas /*** SHA-512: *********************************************************/
635 b1ec8cee 2023-02-25 thomas SHA512Init(SHA2_CTX *context)
637 b1ec8cee 2023-02-25 thomas memcpy(context->state.st64, sha512_initial_hash_value,
638 b1ec8cee 2023-02-25 thomas sizeof(sha512_initial_hash_value));
639 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, sizeof(context->buffer));
640 b1ec8cee 2023-02-25 thomas context->bitcount[0] = context->bitcount[1] = 0;
642 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512Init);
644 b1ec8cee 2023-02-25 thomas #ifdef SHA2_UNROLL_TRANSFORM
646 b1ec8cee 2023-02-25 thomas /* Unrolled SHA-512 round macros: */
648 b1ec8cee 2023-02-25 thomas #define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) do { \
649 b1ec8cee 2023-02-25 thomas BE_8_TO_64(W512[j], data); \
650 b1ec8cee 2023-02-25 thomas data += 8; \
651 b1ec8cee 2023-02-25 thomas T1 = (h) + Sigma1_512((e)) + Ch((e), (f), (g)) + K512[j] + W512[j]; \
652 b1ec8cee 2023-02-25 thomas (d) += T1; \
653 b1ec8cee 2023-02-25 thomas (h) = T1 + Sigma0_512((a)) + Maj((a), (b), (c)); \
655 b1ec8cee 2023-02-25 thomas } while(0)
658 b1ec8cee 2023-02-25 thomas #define ROUND512(a,b,c,d,e,f,g,h) do { \
659 b1ec8cee 2023-02-25 thomas s0 = W512[(j+1)&0x0f]; \
660 b1ec8cee 2023-02-25 thomas s0 = sigma0_512(s0); \
661 b1ec8cee 2023-02-25 thomas s1 = W512[(j+14)&0x0f]; \
662 b1ec8cee 2023-02-25 thomas s1 = sigma1_512(s1); \
663 b1ec8cee 2023-02-25 thomas T1 = (h) + Sigma1_512((e)) + Ch((e), (f), (g)) + K512[j] + \
664 b1ec8cee 2023-02-25 thomas (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0); \
665 b1ec8cee 2023-02-25 thomas (d) += T1; \
666 b1ec8cee 2023-02-25 thomas (h) = T1 + Sigma0_512((a)) + Maj((a), (b), (c)); \
668 b1ec8cee 2023-02-25 thomas } while(0)
671 b1ec8cee 2023-02-25 thomas SHA512Transform(u_int64_t state[8], const u_int8_t data[SHA512_BLOCK_LENGTH])
673 b1ec8cee 2023-02-25 thomas u_int64_t a, b, c, d, e, f, g, h, s0, s1;
674 b1ec8cee 2023-02-25 thomas u_int64_t T1, W512[16];
677 b1ec8cee 2023-02-25 thomas /* Initialize registers with the prev. intermediate value */
678 b1ec8cee 2023-02-25 thomas a = state[0];
679 b1ec8cee 2023-02-25 thomas b = state[1];
680 b1ec8cee 2023-02-25 thomas c = state[2];
681 b1ec8cee 2023-02-25 thomas d = state[3];
682 b1ec8cee 2023-02-25 thomas e = state[4];
683 b1ec8cee 2023-02-25 thomas f = state[5];
684 b1ec8cee 2023-02-25 thomas g = state[6];
685 b1ec8cee 2023-02-25 thomas h = state[7];
689 b1ec8cee 2023-02-25 thomas /* Rounds 0 to 15 (unrolled): */
690 b1ec8cee 2023-02-25 thomas ROUND512_0_TO_15(a,b,c,d,e,f,g,h);
691 b1ec8cee 2023-02-25 thomas ROUND512_0_TO_15(h,a,b,c,d,e,f,g);
692 b1ec8cee 2023-02-25 thomas ROUND512_0_TO_15(g,h,a,b,c,d,e,f);
693 b1ec8cee 2023-02-25 thomas ROUND512_0_TO_15(f,g,h,a,b,c,d,e);
694 b1ec8cee 2023-02-25 thomas ROUND512_0_TO_15(e,f,g,h,a,b,c,d);
695 b1ec8cee 2023-02-25 thomas ROUND512_0_TO_15(d,e,f,g,h,a,b,c);
696 b1ec8cee 2023-02-25 thomas ROUND512_0_TO_15(c,d,e,f,g,h,a,b);
697 b1ec8cee 2023-02-25 thomas ROUND512_0_TO_15(b,c,d,e,f,g,h,a);
698 b1ec8cee 2023-02-25 thomas } while (j < 16);
700 b1ec8cee 2023-02-25 thomas /* Now for the remaining rounds up to 79: */
702 b1ec8cee 2023-02-25 thomas ROUND512(a,b,c,d,e,f,g,h);
703 b1ec8cee 2023-02-25 thomas ROUND512(h,a,b,c,d,e,f,g);
704 b1ec8cee 2023-02-25 thomas ROUND512(g,h,a,b,c,d,e,f);
705 b1ec8cee 2023-02-25 thomas ROUND512(f,g,h,a,b,c,d,e);
706 b1ec8cee 2023-02-25 thomas ROUND512(e,f,g,h,a,b,c,d);
707 b1ec8cee 2023-02-25 thomas ROUND512(d,e,f,g,h,a,b,c);
708 b1ec8cee 2023-02-25 thomas ROUND512(c,d,e,f,g,h,a,b);
709 b1ec8cee 2023-02-25 thomas ROUND512(b,c,d,e,f,g,h,a);
710 b1ec8cee 2023-02-25 thomas } while (j < 80);
712 b1ec8cee 2023-02-25 thomas /* Compute the current intermediate hash value */
713 b1ec8cee 2023-02-25 thomas state[0] += a;
714 b1ec8cee 2023-02-25 thomas state[1] += b;
715 b1ec8cee 2023-02-25 thomas state[2] += c;
716 b1ec8cee 2023-02-25 thomas state[3] += d;
717 b1ec8cee 2023-02-25 thomas state[4] += e;
718 b1ec8cee 2023-02-25 thomas state[5] += f;
719 b1ec8cee 2023-02-25 thomas state[6] += g;
720 b1ec8cee 2023-02-25 thomas state[7] += h;
722 b1ec8cee 2023-02-25 thomas /* Clean up */
723 b1ec8cee 2023-02-25 thomas a = b = c = d = e = f = g = h = T1 = 0;
726 b1ec8cee 2023-02-25 thomas #else /* SHA2_UNROLL_TRANSFORM */
729 b1ec8cee 2023-02-25 thomas SHA512Transform(u_int64_t state[8], const u_int8_t data[SHA512_BLOCK_LENGTH])
731 b1ec8cee 2023-02-25 thomas u_int64_t a, b, c, d, e, f, g, h, s0, s1;
732 b1ec8cee 2023-02-25 thomas u_int64_t T1, T2, W512[16];
735 b1ec8cee 2023-02-25 thomas /* Initialize registers with the prev. intermediate value */
736 b1ec8cee 2023-02-25 thomas a = state[0];
737 b1ec8cee 2023-02-25 thomas b = state[1];
738 b1ec8cee 2023-02-25 thomas c = state[2];
739 b1ec8cee 2023-02-25 thomas d = state[3];
740 b1ec8cee 2023-02-25 thomas e = state[4];
741 b1ec8cee 2023-02-25 thomas f = state[5];
742 b1ec8cee 2023-02-25 thomas g = state[6];
743 b1ec8cee 2023-02-25 thomas h = state[7];
747 b1ec8cee 2023-02-25 thomas BE_8_TO_64(W512[j], data);
748 b1ec8cee 2023-02-25 thomas data += 8;
749 b1ec8cee 2023-02-25 thomas /* Apply the SHA-512 compression function to update a..h */
750 b1ec8cee 2023-02-25 thomas T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + W512[j];
751 b1ec8cee 2023-02-25 thomas T2 = Sigma0_512(a) + Maj(a, b, c);
755 b1ec8cee 2023-02-25 thomas e = d + T1;
759 b1ec8cee 2023-02-25 thomas a = T1 + T2;
762 b1ec8cee 2023-02-25 thomas } while (j < 16);
765 b1ec8cee 2023-02-25 thomas /* Part of the message block expansion: */
766 b1ec8cee 2023-02-25 thomas s0 = W512[(j+1)&0x0f];
767 b1ec8cee 2023-02-25 thomas s0 = sigma0_512(s0);
768 b1ec8cee 2023-02-25 thomas s1 = W512[(j+14)&0x0f];
769 b1ec8cee 2023-02-25 thomas s1 = sigma1_512(s1);
771 b1ec8cee 2023-02-25 thomas /* Apply the SHA-512 compression function to update a..h */
772 b1ec8cee 2023-02-25 thomas T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] +
773 b1ec8cee 2023-02-25 thomas (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0);
774 b1ec8cee 2023-02-25 thomas T2 = Sigma0_512(a) + Maj(a, b, c);
778 b1ec8cee 2023-02-25 thomas e = d + T1;
782 b1ec8cee 2023-02-25 thomas a = T1 + T2;
785 b1ec8cee 2023-02-25 thomas } while (j < 80);
787 b1ec8cee 2023-02-25 thomas /* Compute the current intermediate hash value */
788 b1ec8cee 2023-02-25 thomas state[0] += a;
789 b1ec8cee 2023-02-25 thomas state[1] += b;
790 b1ec8cee 2023-02-25 thomas state[2] += c;
791 b1ec8cee 2023-02-25 thomas state[3] += d;
792 b1ec8cee 2023-02-25 thomas state[4] += e;
793 b1ec8cee 2023-02-25 thomas state[5] += f;
794 b1ec8cee 2023-02-25 thomas state[6] += g;
795 b1ec8cee 2023-02-25 thomas state[7] += h;
797 b1ec8cee 2023-02-25 thomas /* Clean up */
798 b1ec8cee 2023-02-25 thomas a = b = c = d = e = f = g = h = T1 = T2 = 0;
801 b1ec8cee 2023-02-25 thomas #endif /* SHA2_UNROLL_TRANSFORM */
802 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512Transform);
805 b1ec8cee 2023-02-25 thomas SHA512Update(SHA2_CTX *context, const u_int8_t *data, size_t len)
807 b1ec8cee 2023-02-25 thomas size_t freespace, usedspace;
809 b1ec8cee 2023-02-25 thomas /* Calling with no data is valid (we do nothing) */
810 b1ec8cee 2023-02-25 thomas if (len == 0)
813 b1ec8cee 2023-02-25 thomas usedspace = (context->bitcount[0] >> 3) % SHA512_BLOCK_LENGTH;
814 b1ec8cee 2023-02-25 thomas if (usedspace > 0) {
815 b1ec8cee 2023-02-25 thomas /* Calculate how much free space is available in the buffer */
816 b1ec8cee 2023-02-25 thomas freespace = SHA512_BLOCK_LENGTH - usedspace;
818 b1ec8cee 2023-02-25 thomas if (len >= freespace) {
819 b1ec8cee 2023-02-25 thomas /* Fill the buffer completely and process it */
820 b1ec8cee 2023-02-25 thomas memcpy(&context->buffer[usedspace], data, freespace);
821 b1ec8cee 2023-02-25 thomas ADDINC128(context->bitcount, freespace << 3);
822 b1ec8cee 2023-02-25 thomas len -= freespace;
823 b1ec8cee 2023-02-25 thomas data += freespace;
824 b1ec8cee 2023-02-25 thomas SHA512Transform(context->state.st64, context->buffer);
826 b1ec8cee 2023-02-25 thomas /* The buffer is not yet full */
827 b1ec8cee 2023-02-25 thomas memcpy(&context->buffer[usedspace], data, len);
828 b1ec8cee 2023-02-25 thomas ADDINC128(context->bitcount, len << 3);
829 b1ec8cee 2023-02-25 thomas /* Clean up: */
830 b1ec8cee 2023-02-25 thomas usedspace = freespace = 0;
834 b1ec8cee 2023-02-25 thomas while (len >= SHA512_BLOCK_LENGTH) {
835 b1ec8cee 2023-02-25 thomas /* Process as many complete blocks as we can */
836 b1ec8cee 2023-02-25 thomas SHA512Transform(context->state.st64, data);
837 b1ec8cee 2023-02-25 thomas ADDINC128(context->bitcount, SHA512_BLOCK_LENGTH << 3);
838 b1ec8cee 2023-02-25 thomas len -= SHA512_BLOCK_LENGTH;
839 b1ec8cee 2023-02-25 thomas data += SHA512_BLOCK_LENGTH;
841 b1ec8cee 2023-02-25 thomas if (len > 0) {
842 b1ec8cee 2023-02-25 thomas /* There's left-overs, so save 'em */
843 b1ec8cee 2023-02-25 thomas memcpy(context->buffer, data, len);
844 b1ec8cee 2023-02-25 thomas ADDINC128(context->bitcount, len << 3);
846 b1ec8cee 2023-02-25 thomas /* Clean up: */
847 b1ec8cee 2023-02-25 thomas usedspace = freespace = 0;
849 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512Update);
852 b1ec8cee 2023-02-25 thomas SHA512Pad(SHA2_CTX *context)
854 b1ec8cee 2023-02-25 thomas unsigned int usedspace;
856 b1ec8cee 2023-02-25 thomas usedspace = (context->bitcount[0] >> 3) % SHA512_BLOCK_LENGTH;
857 b1ec8cee 2023-02-25 thomas if (usedspace > 0) {
858 b1ec8cee 2023-02-25 thomas /* Begin padding with a 1 bit: */
859 b1ec8cee 2023-02-25 thomas context->buffer[usedspace++] = 0x80;
861 b1ec8cee 2023-02-25 thomas if (usedspace <= SHA512_SHORT_BLOCK_LENGTH) {
862 b1ec8cee 2023-02-25 thomas /* Set-up for the last transform: */
863 b1ec8cee 2023-02-25 thomas memset(&context->buffer[usedspace], 0, SHA512_SHORT_BLOCK_LENGTH - usedspace);
865 b1ec8cee 2023-02-25 thomas if (usedspace < SHA512_BLOCK_LENGTH) {
866 b1ec8cee 2023-02-25 thomas memset(&context->buffer[usedspace], 0, SHA512_BLOCK_LENGTH - usedspace);
868 b1ec8cee 2023-02-25 thomas /* Do second-to-last transform: */
869 b1ec8cee 2023-02-25 thomas SHA512Transform(context->state.st64, context->buffer);
871 b1ec8cee 2023-02-25 thomas /* And set-up for the last transform: */
872 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, SHA512_BLOCK_LENGTH - 2);
875 b1ec8cee 2023-02-25 thomas /* Prepare for final transform: */
876 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, SHA512_SHORT_BLOCK_LENGTH);
878 b1ec8cee 2023-02-25 thomas /* Begin padding with a 1 bit: */
879 b1ec8cee 2023-02-25 thomas *context->buffer = 0x80;
881 b1ec8cee 2023-02-25 thomas /* Store the length of input data (in bits) in big endian format: */
882 b1ec8cee 2023-02-25 thomas BE_64_TO_8(&context->buffer[SHA512_SHORT_BLOCK_LENGTH],
883 b1ec8cee 2023-02-25 thomas context->bitcount[1]);
884 b1ec8cee 2023-02-25 thomas BE_64_TO_8(&context->buffer[SHA512_SHORT_BLOCK_LENGTH + 8],
885 b1ec8cee 2023-02-25 thomas context->bitcount[0]);
887 b1ec8cee 2023-02-25 thomas /* Final transform: */
888 b1ec8cee 2023-02-25 thomas SHA512Transform(context->state.st64, context->buffer);
890 b1ec8cee 2023-02-25 thomas /* Clean up: */
891 b1ec8cee 2023-02-25 thomas usedspace = 0;
893 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512Pad);
896 b1ec8cee 2023-02-25 thomas SHA512Final(u_int8_t digest[SHA512_DIGEST_LENGTH], SHA2_CTX *context)
898 b1ec8cee 2023-02-25 thomas SHA512Pad(context);
900 b1ec8cee 2023-02-25 thomas #if BYTE_ORDER == LITTLE_ENDIAN
903 b1ec8cee 2023-02-25 thomas /* Convert TO host byte order */
904 b1ec8cee 2023-02-25 thomas for (i = 0; i < 8; i++)
905 b1ec8cee 2023-02-25 thomas BE_64_TO_8(digest + i * 8, context->state.st64[i]);
907 b1ec8cee 2023-02-25 thomas memcpy(digest, context->state.st64, SHA512_DIGEST_LENGTH);
909 b1ec8cee 2023-02-25 thomas explicit_bzero(context, sizeof(*context));
911 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512Final);
913 b1ec8cee 2023-02-25 thomas #if !defined(SHA2_SMALL)
915 b1ec8cee 2023-02-25 thomas /*** SHA-384: *********************************************************/
917 b1ec8cee 2023-02-25 thomas SHA384Init(SHA2_CTX *context)
919 b1ec8cee 2023-02-25 thomas memcpy(context->state.st64, sha384_initial_hash_value,
920 b1ec8cee 2023-02-25 thomas sizeof(sha384_initial_hash_value));
921 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, sizeof(context->buffer));
922 b1ec8cee 2023-02-25 thomas context->bitcount[0] = context->bitcount[1] = 0;
924 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA384Init);
926 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA384Transform, SHA512Transform);
927 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA384Update, SHA512Update);
928 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA384Pad, SHA512Pad);
929 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA384Transform);
930 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA384Update);
931 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA384Pad);
933 b1ec8cee 2023-02-25 thomas /* Equivalent of MAKE_CLONE (which is a no-op) for SHA384 funcs */
935 b1ec8cee 2023-02-25 thomas SHA384Transform(u_int64_t state[8], const u_int8_t data[SHA512_BLOCK_LENGTH])
937 b1ec8cee 2023-02-25 thomas SHA512Transform(state, data);
941 b1ec8cee 2023-02-25 thomas SHA384Update(SHA2_CTX *context, const u_int8_t *data, size_t len)
943 b1ec8cee 2023-02-25 thomas SHA512Update(context, data, len);
947 b1ec8cee 2023-02-25 thomas SHA384Pad(SHA2_CTX *context)
949 b1ec8cee 2023-02-25 thomas SHA512Pad(context);
953 b1ec8cee 2023-02-25 thomas SHA384Final(u_int8_t digest[SHA384_DIGEST_LENGTH], SHA2_CTX *context)
955 b1ec8cee 2023-02-25 thomas SHA384Pad(context);
957 b1ec8cee 2023-02-25 thomas #if BYTE_ORDER == LITTLE_ENDIAN
960 b1ec8cee 2023-02-25 thomas /* Convert TO host byte order */
961 b1ec8cee 2023-02-25 thomas for (i = 0; i < 6; i++)
962 b1ec8cee 2023-02-25 thomas BE_64_TO_8(digest + i * 8, context->state.st64[i]);
964 b1ec8cee 2023-02-25 thomas memcpy(digest, context->state.st64, SHA384_DIGEST_LENGTH);
966 b1ec8cee 2023-02-25 thomas /* Zero out state data */
967 b1ec8cee 2023-02-25 thomas explicit_bzero(context, sizeof(*context));
969 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA384Final);
972 b1ec8cee 2023-02-25 thomas /*** SHA-512/256: *********************************************************/
974 b1ec8cee 2023-02-25 thomas SHA512_256Init(SHA2_CTX *context)
976 b1ec8cee 2023-02-25 thomas memcpy(context->state.st64, sha512_256_initial_hash_value,
977 b1ec8cee 2023-02-25 thomas sizeof(sha512_256_initial_hash_value));
978 b1ec8cee 2023-02-25 thomas memset(context->buffer, 0, sizeof(context->buffer));
979 b1ec8cee 2023-02-25 thomas context->bitcount[0] = context->bitcount[1] = 0;
981 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512_256Init);
983 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA512_256Transform, SHA512Transform);
984 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA512_256Update, SHA512Update);
985 b1ec8cee 2023-02-25 thomas MAKE_CLONE(SHA512_256Pad, SHA512Pad);
986 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512_256Transform);
987 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512_256Update);
988 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512_256Pad);
991 b1ec8cee 2023-02-25 thomas SHA512_256Final(u_int8_t digest[SHA512_256_DIGEST_LENGTH], SHA2_CTX *context)
993 b1ec8cee 2023-02-25 thomas SHA512_256Pad(context);
995 b1ec8cee 2023-02-25 thomas #if BYTE_ORDER == LITTLE_ENDIAN
998 b1ec8cee 2023-02-25 thomas /* Convert TO host byte order */
999 b1ec8cee 2023-02-25 thomas for (i = 0; i < 4; i++)
1000 b1ec8cee 2023-02-25 thomas BE_64_TO_8(digest + i * 8, context->state.st64[i]);
1002 b1ec8cee 2023-02-25 thomas memcpy(digest, context->state.st64, SHA512_256_DIGEST_LENGTH);
1004 b1ec8cee 2023-02-25 thomas /* Zero out state data */
1005 b1ec8cee 2023-02-25 thomas explicit_bzero(context, sizeof(*context));
1007 b1ec8cee 2023-02-25 thomas DEF_WEAK(SHA512_256Final);
1008 b1ec8cee 2023-02-25 thomas #endif /* !defined(SHA2_SMALL) */
1009 b1ec8cee 2023-02-25 thomas #endif /* 0 */
1011 b1ec8cee 2023-02-25 thomas #endif /* HAVE_SHA{256,384,512}UPDATE */
