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