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