2
* Copyright (c) 2006 Kungliga Tekniska Högskolan
3
* (Royal Institute of Technology, Stockholm, Sweden).
6
* Redistribution and use in source and binary forms, with or without
7
* modification, are permitted provided that the following conditions
10
* 1. Redistributions of source code must retain the above copyright
11
* notice, this list of conditions and the following disclaimer.
13
* 2. Redistributions in binary form must reproduce the above copyright
14
* notice, this list of conditions and the following disclaimer in the
15
* documentation and/or other materials provided with the distribution.
17
* 3. Neither the name of the Institute nor the names of its contributors
18
* may be used to endorse or promote products derived from this software
19
* without specific prior written permission.
21
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
43
#define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
44
#define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
46
#define ROTR(x,n) (((x)>>(n)) | ((x) << (32 - (n))))
48
#define Sigma0(x) (ROTR(x,2) ^ ROTR(x,13) ^ ROTR(x,22))
49
#define Sigma1(x) (ROTR(x,6) ^ ROTR(x,11) ^ ROTR(x,25))
50
#define sigma0(x) (ROTR(x,7) ^ ROTR(x,18) ^ ((x)>>3))
51
#define sigma1(x) (ROTR(x,17) ^ ROTR(x,19) ^ ((x)>>10))
53
#define A m->counter[0]
54
#define B m->counter[1]
55
#define C m->counter[2]
56
#define D m->counter[3]
57
#define E m->counter[4]
58
#define F m->counter[5]
59
#define G m->counter[6]
60
#define H m->counter[7]
62
static const uint32_t constant_256[64] = {
63
0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
64
0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
65
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
66
0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
67
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
68
0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
69
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
70
0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
71
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
72
0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
73
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
74
0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
75
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
76
0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
77
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
78
0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
82
SHA256_Init (SHA256_CTX *m)
97
calc (SHA256_CTX *m, uint32_t *in)
99
uint32_t AA, BB, CC, DD, EE, FF, GG, HH;
112
for (i = 0; i < 16; ++i)
114
for (i = 16; i < 64; ++i)
115
data[i] = sigma1(data[i-2]) + data[i-7] +
116
sigma0(data[i-15]) + data[i - 16];
118
for (i = 0; i < 64; i++) {
121
T1 = HH + Sigma1(EE) + Ch(EE, FF, GG) + constant_256[i] + data[i];
122
T2 = Sigma0(AA) + Maj(AA,BB,CC);
145
* From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
148
#if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
149
static inline uint32_t
150
swap_uint32_t (uint32_t t)
152
#define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
153
uint32_t temp1, temp2;
155
temp1 = cshift(t, 16);
160
return temp1 | temp2;
170
SHA256_Update (SHA256_CTX *m, const void *v, size_t len)
172
const unsigned char *p = v;
173
size_t old_sz = m->sz[0];
177
if (m->sz[0] < old_sz)
179
offset = (old_sz / 8) % 64;
181
size_t l = min(len, 64 - offset);
182
memcpy(m->save + offset, p, l);
187
#if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
189
uint32_t current[16];
190
struct x32 *u = (struct x32*)m->save;
191
for(i = 0; i < 8; i++){
192
current[2*i+0] = swap_uint32_t(u[i].a);
193
current[2*i+1] = swap_uint32_t(u[i].b);
197
calc(m, (uint32_t*)m->save);
205
SHA256_Final (void *res, SHA256_CTX *m)
207
unsigned char zeros[72];
208
unsigned offset = (m->sz[0] / 8) % 64;
209
unsigned int dstart = (120 - offset - 1) % 64 + 1;
212
memset (zeros + 1, 0, sizeof(zeros) - 1);
213
zeros[dstart+7] = (m->sz[0] >> 0) & 0xff;
214
zeros[dstart+6] = (m->sz[0] >> 8) & 0xff;
215
zeros[dstart+5] = (m->sz[0] >> 16) & 0xff;
216
zeros[dstart+4] = (m->sz[0] >> 24) & 0xff;
217
zeros[dstart+3] = (m->sz[1] >> 0) & 0xff;
218
zeros[dstart+2] = (m->sz[1] >> 8) & 0xff;
219
zeros[dstart+1] = (m->sz[1] >> 16) & 0xff;
220
zeros[dstart+0] = (m->sz[1] >> 24) & 0xff;
221
SHA256_Update (m, zeros, dstart + 8);
224
unsigned char *r = (unsigned char*)res;
226
for (i = 0; i < 8; ++i) {
227
r[4*i+3] = m->counter[i] & 0xFF;
228
r[4*i+2] = (m->counter[i] >> 8) & 0xFF;
229
r[4*i+1] = (m->counter[i] >> 16) & 0xFF;
230
r[4*i] = (m->counter[i] >> 24) & 0xFF;