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