1/*
2 * Copyright (c) 2006, 2010 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * 1. Redistributions of source code must retain the above copyright
11 *    notice, this list of conditions and the following disclaimer.
12 *
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.
16 *
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.
20 *
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
31 * SUCH DAMAGE.
32 */
33
34#include "config.h"
35
36#include "hash.h"
37#include "sha.h"
38
39#define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
40#define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
41
42#define ROTR(x,n)   (((x)>>(n)) | ((x) << (64 - (n))))
43
44#define Sigma0(x)	(ROTR(x,28) ^ ROTR(x,34) ^ ROTR(x,39))
45#define Sigma1(x)	(ROTR(x,14) ^ ROTR(x,18) ^ ROTR(x,41))
46#define sigma0(x)	(ROTR(x,1)  ^ ROTR(x,8)  ^ ((x)>>7))
47#define sigma1(x)	(ROTR(x,19) ^ ROTR(x,61) ^ ((x)>>6))
48
49#define A m->counter[0]
50#define B m->counter[1]
51#define C m->counter[2]
52#define D m->counter[3]
53#define E m->counter[4]
54#define F m->counter[5]
55#define G m->counter[6]
56#define H m->counter[7]
57
58static const uint64_t constant_512[80] = {
59    0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL,
60    0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,
61    0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
62    0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,
63    0xd807aa98a3030242ULL, 0x12835b0145706fbeULL,
64    0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
65    0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL,
66    0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,
67    0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
68    0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,
69    0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL,
70    0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
71    0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL,
72    0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,
73    0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
74    0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,
75    0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL,
76    0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
77    0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL,
78    0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,
79    0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
80    0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,
81    0xd192e819d6ef5218ULL, 0xd69906245565a910ULL,
82    0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
83    0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL,
84    0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,
85    0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
86    0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,
87    0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL,
88    0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
89    0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL,
90    0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,
91    0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
92    0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,
93    0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL,
94    0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
95    0x28db77f523047d84ULL, 0x32caab7b40c72493ULL,
96    0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,
97    0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
98    0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL
99};
100
101void
102SHA512_Init (SHA512_CTX *m)
103{
104    m->sz[0] = 0;
105    m->sz[1] = 0;
106    A = 0x6a09e667f3bcc908ULL;
107    B = 0xbb67ae8584caa73bULL;
108    C = 0x3c6ef372fe94f82bULL;
109    D = 0xa54ff53a5f1d36f1ULL;
110    E = 0x510e527fade682d1ULL;
111    F = 0x9b05688c2b3e6c1fULL;
112    G = 0x1f83d9abfb41bd6bULL;
113    H = 0x5be0cd19137e2179ULL;
114}
115
116static void
117calc (SHA512_CTX *m, uint64_t *in)
118{
119    uint64_t AA, BB, CC, DD, EE, FF, GG, HH;
120    uint64_t data[80];
121    int i;
122
123    AA = A;
124    BB = B;
125    CC = C;
126    DD = D;
127    EE = E;
128    FF = F;
129    GG = G;
130    HH = H;
131
132    for (i = 0; i < 16; ++i)
133	data[i] = in[i];
134    for (i = 16; i < 80; ++i)
135	data[i] = sigma1(data[i-2]) + data[i-7] +
136	    sigma0(data[i-15]) + data[i - 16];
137
138    for (i = 0; i < 80; i++) {
139	uint64_t T1, T2;
140
141	T1 = HH + Sigma1(EE) + Ch(EE, FF, GG) + constant_512[i] + data[i];
142	T2 = Sigma0(AA) + Maj(AA,BB,CC);
143
144	HH = GG;
145	GG = FF;
146	FF = EE;
147	EE = DD + T1;
148	DD = CC;
149	CC = BB;
150	BB = AA;
151	AA = T1 + T2;
152    }
153
154    A += AA;
155    B += BB;
156    C += CC;
157    D += DD;
158    E += EE;
159    F += FF;
160    G += GG;
161    H += HH;
162}
163
164/*
165 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
166 */
167
168#if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
169static inline uint64_t
170swap_uint64_t (uint64_t t)
171{
172    uint64_t temp;
173
174    temp   = cshift64(t, 32);
175    temp = ((temp & 0xff00ff00ff00ff00ULL) >> 8) |
176           ((temp & 0x00ff00ff00ff00ffULL) << 8);
177    return ((temp & 0xffff0000ffff0000ULL) >> 16) |
178           ((temp & 0x0000ffff0000ffffULL) << 16);
179}
180
181struct x64{
182    uint64_t a;
183    uint64_t b;
184};
185#endif
186
187void
188SHA512_Update (SHA512_CTX *m, const void *v, size_t len)
189{
190    const unsigned char *p = v;
191    size_t old_sz = m->sz[0];
192    size_t offset;
193
194    m->sz[0] += len * 8;
195    if (m->sz[0] < old_sz)
196	++m->sz[1];
197    offset = (old_sz / 8) % 128;
198    while(len > 0){
199	size_t l = min(len, 128 - offset);
200	memcpy(m->save + offset, p, l);
201	offset += l;
202	p += l;
203	len -= l;
204	if(offset == 128){
205#if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
206	    int i;
207	    uint64_t current[16];
208	    struct x64 *us = (struct x64*)m->save;
209	    for(i = 0; i < 8; i++){
210		current[2*i+0] = swap_uint64_t(us[i].a);
211		current[2*i+1] = swap_uint64_t(us[i].b);
212	    }
213	    calc(m, current);
214#else
215	    calc(m, (uint64_t*)m->save);
216#endif
217	    offset = 0;
218	}
219    }
220}
221
222void
223SHA512_Final (void *res, SHA512_CTX *m)
224{
225    unsigned char zeros[128 + 16];
226    unsigned offset = (m->sz[0] / 8) % 128;
227    unsigned int dstart = (240 - offset - 1) % 128 + 1;
228
229    *zeros = 0x80;
230    memset (zeros + 1, 0, sizeof(zeros) - 1);
231    zeros[dstart+15] = (m->sz[0] >> 0) & 0xff;
232    zeros[dstart+14] = (m->sz[0] >> 8) & 0xff;
233    zeros[dstart+13] = (m->sz[0] >> 16) & 0xff;
234    zeros[dstart+12] = (m->sz[0] >> 24) & 0xff;
235    zeros[dstart+11] = (m->sz[0] >> 32) & 0xff;
236    zeros[dstart+10] = (m->sz[0] >> 40) & 0xff;
237    zeros[dstart+9]  = (m->sz[0] >> 48) & 0xff;
238    zeros[dstart+8]  = (m->sz[0] >> 56) & 0xff;
239
240    zeros[dstart+7] = (m->sz[1] >> 0) & 0xff;
241    zeros[dstart+6] = (m->sz[1] >> 8) & 0xff;
242    zeros[dstart+5] = (m->sz[1] >> 16) & 0xff;
243    zeros[dstart+4] = (m->sz[1] >> 24) & 0xff;
244    zeros[dstart+3] = (m->sz[1] >> 32) & 0xff;
245    zeros[dstart+2] = (m->sz[1] >> 40) & 0xff;
246    zeros[dstart+1] = (m->sz[1] >> 48) & 0xff;
247    zeros[dstart+0] = (m->sz[1] >> 56) & 0xff;
248    SHA512_Update (m, zeros, dstart + 16);
249    {
250	int i;
251	unsigned char *r = (unsigned char*)res;
252
253	for (i = 0; i < 8; ++i) {
254	    r[8*i+7] = m->counter[i] & 0xFF;
255	    r[8*i+6] = (m->counter[i] >> 8) & 0xFF;
256	    r[8*i+5] = (m->counter[i] >> 16) & 0xFF;
257	    r[8*i+4] = (m->counter[i] >> 24) & 0xFF;
258	    r[8*i+3] = (m->counter[i] >> 32) & 0XFF;
259	    r[8*i+2] = (m->counter[i] >> 40) & 0xFF;
260	    r[8*i+1] = (m->counter[i] >> 48) & 0xFF;
261	    r[8*i]   = (m->counter[i] >> 56) & 0xFF;
262	}
263    }
264}
265
266void
267SHA384_Init(SHA384_CTX *m)
268{
269    m->sz[0] = 0;
270    m->sz[1] = 0;
271    A = 0xcbbb9d5dc1059ed8ULL;
272    B = 0x629a292a367cd507ULL;
273    C = 0x9159015a3070dd17ULL;
274    D = 0x152fecd8f70e5939ULL;
275    E = 0x67332667ffc00b31ULL;
276    F = 0x8eb44a8768581511ULL;
277    G = 0xdb0c2e0d64f98fa7ULL;
278    H = 0x47b5481dbefa4fa4ULL;
279}
280
281void
282SHA384_Update (SHA384_CTX *m, const void *v, size_t len)
283{
284    SHA512_Update(m, v, len);
285}
286
287void
288SHA384_Final (void *res, SHA384_CTX *m)
289{
290    unsigned char data[SHA512_DIGEST_LENGTH];
291    SHA512_Final(data, m);
292    memcpy(res, data, SHA384_DIGEST_LENGTH);
293}
294
295