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