blob: 18cc8f800c9b66f51f28cb233eaf727bd0c299e6 [file] [log] [blame]
Ericc3fa0072021-05-19 17:45:38 +02001/*
2 * SHA-256 hash implementation and interface functions
3 * Copyright (c) 2003-2011, Jouni Malinen <j@w1.fi>
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2 as
7 * published by the Free Software Foundation.
8 *
9 * Alternatively, this software may be distributed under the terms of BSD
10 * license.
11 *
12 * See README and COPYING for more details.
13 */
14
15
16#include "common.h"
17#include "sha256.h"
18#include "sha256_i.h"
19#include "crypto.h"
20
21
22/**
23 * sha256_vector - SHA256 hash for data vector
24 * @num_elem: Number of elements in the data vector
25 * @addr: Pointers to the data areas
26 * @len: Lengths of the data blocks
27 * @mac: Buffer for the hash
28 * Returns: 0 on success, -1 of failure
29 */
30int sha256_vector(size_t num_elem, const u8 *addr[], const size_t *len,
31 u8 *mac)
32{
33 struct sha256_state ctx;
34 size_t i;
35
36 sha256_init(&ctx);
37 for (i = 0; i < num_elem; i++)
38 if (sha256_process(&ctx, addr[i], len[i]))
39 return -1;
40 if (sha256_done(&ctx, mac))
41 return -1;
42 return 0;
43}
44
45
46/* ===== start - public domain SHA256 implementation ===== */
47
48/* This is based on SHA256 implementation in LibTomCrypt that was released into
49 * public domain by Tom St Denis. */
50
51/* the K array */
52static const unsigned long K[64] = {
53 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL, 0x3956c25bUL,
54 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL, 0xd807aa98UL, 0x12835b01UL,
55 0x243185beUL, 0x550c7dc3UL, 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL,
56 0xc19bf174UL, 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL,
57 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL, 0x983e5152UL,
58 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL, 0xc6e00bf3UL, 0xd5a79147UL,
59 0x06ca6351UL, 0x14292967UL, 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL,
60 0x53380d13UL, 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL,
61 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL, 0xd192e819UL,
62 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL, 0x19a4c116UL, 0x1e376c08UL,
63 0x2748774cUL, 0x34b0bcb5UL, 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL,
64 0x682e6ff3UL, 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL,
65 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL
66};
67
68
69/* Various logical functions */
70#define RORc(x, y) \
71( ((((unsigned long) (x) & 0xFFFFFFFFUL) >> (unsigned long) ((y) & 31)) | \
72 ((unsigned long) (x) << (unsigned long) (32 - ((y) & 31)))) & 0xFFFFFFFFUL)
73#define Ch(x,y,z) (z ^ (x & (y ^ z)))
74#define Maj(x,y,z) (((x | y) & z) | (x & y))
75#define S(x, n) RORc((x), (n))
76#define R(x, n) (((x)&0xFFFFFFFFUL)>>(n))
77#define Sigma0(x) (S(x, 2) ^ S(x, 13) ^ S(x, 22))
78#define Sigma1(x) (S(x, 6) ^ S(x, 11) ^ S(x, 25))
79#define Gamma0(x) (S(x, 7) ^ S(x, 18) ^ R(x, 3))
80#define Gamma1(x) (S(x, 17) ^ S(x, 19) ^ R(x, 10))
81#ifndef MIN
82#define MIN(x, y) (((x) < (y)) ? (x) : (y))
83#endif
84
85/* compress 512-bits */
86static int sha256_compress(struct sha256_state *md, unsigned char *buf)
87{
88 u32 S[8], W[64], t0, t1;
89 u32 t;
90 int i;
91
92 /* copy state into S */
93 for (i = 0; i < 8; i++) {
94 S[i] = md->state[i];
95 }
96
97 /* copy the state into 512-bits into W[0..15] */
98 for (i = 0; i < 16; i++)
99 W[i] = WPA_GET_BE32(buf + (4 * i));
100
101 /* fill W[16..63] */
102 for (i = 16; i < 64; i++) {
103 W[i] = Gamma1(W[i - 2]) + W[i - 7] + Gamma0(W[i - 15]) +
104 W[i - 16];
105 }
106
107 /* Compress */
108#define RND(a,b,c,d,e,f,g,h,i) \
109 t0 = h + Sigma1(e) + Ch(e, f, g) + K[i] + W[i]; \
110 t1 = Sigma0(a) + Maj(a, b, c); \
111 d += t0; \
112 h = t0 + t1;
113
114 for (i = 0; i < 64; ++i) {
115 RND(S[0], S[1], S[2], S[3], S[4], S[5], S[6], S[7], i);
116 t = S[7]; S[7] = S[6]; S[6] = S[5]; S[5] = S[4];
117 S[4] = S[3]; S[3] = S[2]; S[2] = S[1]; S[1] = S[0]; S[0] = t;
118 }
119
120 /* feedback */
121 for (i = 0; i < 8; i++) {
122 md->state[i] = md->state[i] + S[i];
123 }
124 return 0;
125}
126
127
128/* Initialize the hash state */
129void sha256_init(struct sha256_state *md)
130{
131 md->curlen = 0;
132 md->length = 0;
133 md->state[0] = 0x6A09E667UL;
134 md->state[1] = 0xBB67AE85UL;
135 md->state[2] = 0x3C6EF372UL;
136 md->state[3] = 0xA54FF53AUL;
137 md->state[4] = 0x510E527FUL;
138 md->state[5] = 0x9B05688CUL;
139 md->state[6] = 0x1F83D9ABUL;
140 md->state[7] = 0x5BE0CD19UL;
141}
142
143/**
144 Process a block of memory though the hash
145 @param md The hash state
146 @param in The data to hash
147 @param inlen The length of the data (octets)
148 @return CRYPT_OK if successful
149*/
150int sha256_process(struct sha256_state *md, const unsigned char *in,
151 unsigned long inlen)
152{
153 unsigned long n;
154
155 if (md->curlen >= sizeof(md->buf))
156 return -1;
157
158 while (inlen > 0) {
159 if (md->curlen == 0 && inlen >= SHA256_BLOCK_SIZE) {
160 if (sha256_compress(md, (unsigned char *) in) < 0)
161 return -1;
162 md->length += SHA256_BLOCK_SIZE * 8;
163 in += SHA256_BLOCK_SIZE;
164 inlen -= SHA256_BLOCK_SIZE;
165 } else {
166 n = MIN(inlen, (SHA256_BLOCK_SIZE - md->curlen));
167 os_memcpy(md->buf + md->curlen, in, n);
168 md->curlen += n;
169 in += n;
170 inlen -= n;
171 if (md->curlen == SHA256_BLOCK_SIZE) {
172 if (sha256_compress(md, md->buf) < 0)
173 return -1;
174 md->length += 8 * SHA256_BLOCK_SIZE;
175 md->curlen = 0;
176 }
177 }
178 }
179
180 return 0;
181}
182
183
184/**
185 Terminate the hash to get the digest
186 @param md The hash state
187 @param out [out] The destination of the hash (32 bytes)
188 @return CRYPT_OK if successful
189*/
190int sha256_done(struct sha256_state *md, unsigned char *out)
191{
192 int i;
193
194 if (md->curlen >= sizeof(md->buf))
195 return -1;
196
197 /* increase the length of the message */
198 md->length += md->curlen * 8;
199
200 /* append the '1' bit */
201 md->buf[md->curlen++] = (unsigned char) 0x80;
202
203 /* if the length is currently above 56 bytes we append zeros
204 * then compress. Then we can fall back to padding zeros and length
205 * encoding like normal.
206 */
207 if (md->curlen > 56) {
208 while (md->curlen < SHA256_BLOCK_SIZE) {
209 md->buf[md->curlen++] = (unsigned char) 0;
210 }
211 sha256_compress(md, md->buf);
212 md->curlen = 0;
213 }
214
215 /* pad up to 56 bytes of zeroes */
216 while (md->curlen < 56) {
217 md->buf[md->curlen++] = (unsigned char) 0;
218 }
219
220 /* store length */
221 WPA_PUT_BE64(md->buf + 56, md->length);
222 sha256_compress(md, md->buf);
223
224 /* copy output */
225 for (i = 0; i < 8; i++)
226 WPA_PUT_BE32(out + (4 * i), md->state[i]);
227
228 return 0;
229}
230
231/* ===== end - public domain SHA256 implementation ===== */