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