1 /* SHA-512 code by Jean-Luc Cooke <jlcooke@certainkey.com> 2 * 3 * Copyright (c) Jean-Luc Cooke <jlcooke@certainkey.com> 4 * Copyright (c) Andrew McDonald <andrew@mcdonald.org.uk> 5 * Copyright (c) 2003 Kyle McMartin <kyle@debian.org> 6 * 7 * This program is free software; you can redistribute it and/or modify it 8 * under the terms of the GNU General Public License as published by the 9 * Free Software Foundation; either version 2, or (at your option) any 10 * later version. 11 * 12 */ 13 #include <crypto/internal/hash.h> 14 #include <linux/kernel.h> 15 #include <linux/module.h> 16 #include <linux/mm.h> 17 #include <linux/init.h> 18 #include <linux/crypto.h> 19 #include <linux/types.h> 20 #include <crypto/sha.h> 21 #include <linux/percpu.h> 22 #include <asm/byteorder.h> 23 24 static DEFINE_PER_CPU(u64[80], msg_schedule); 25 26 static inline u64 Ch(u64 x, u64 y, u64 z) 27 { 28 return z ^ (x & (y ^ z)); 29 } 30 31 static inline u64 Maj(u64 x, u64 y, u64 z) 32 { 33 return (x & y) | (z & (x | y)); 34 } 35 36 static const u64 sha512_K[80] = { 37 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL, 38 0xe9b5dba58189dbbcULL, 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL, 39 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL, 0xd807aa98a3030242ULL, 40 0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL, 41 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL, 42 0xc19bf174cf692694ULL, 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL, 43 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL, 0x2de92c6f592b0275ULL, 44 0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL, 45 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL, 46 0xbf597fc7beef0ee4ULL, 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL, 47 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL, 0x27b70a8546d22ffcULL, 48 0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL, 49 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL, 50 0x92722c851482353bULL, 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL, 51 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL, 0xd192e819d6ef5218ULL, 52 0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL, 53 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL, 54 0x34b0bcb5e19b48a8ULL, 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL, 55 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL, 0x748f82ee5defb2fcULL, 56 0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL, 57 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL, 58 0xc67178f2e372532bULL, 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL, 59 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL, 0x06f067aa72176fbaULL, 60 0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL, 61 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL, 62 0x431d67c49c100d4cULL, 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL, 63 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL, 64 }; 65 66 #define e0(x) (ror64(x,28) ^ ror64(x,34) ^ ror64(x,39)) 67 #define e1(x) (ror64(x,14) ^ ror64(x,18) ^ ror64(x,41)) 68 #define s0(x) (ror64(x, 1) ^ ror64(x, 8) ^ (x >> 7)) 69 #define s1(x) (ror64(x,19) ^ ror64(x,61) ^ (x >> 6)) 70 71 static inline void LOAD_OP(int I, u64 *W, const u8 *input) 72 { 73 W[I] = __be64_to_cpu( ((__be64*)(input))[I] ); 74 } 75 76 static inline void BLEND_OP(int I, u64 *W) 77 { 78 W[I] = s1(W[I-2]) + W[I-7] + s0(W[I-15]) + W[I-16]; 79 } 80 81 static void 82 sha512_transform(u64 *state, const u8 *input) 83 { 84 u64 a, b, c, d, e, f, g, h, t1, t2; 85 86 int i; 87 u64 *W = get_cpu_var(msg_schedule); 88 89 /* load the input */ 90 for (i = 0; i < 16; i++) 91 LOAD_OP(i, W, input); 92 93 for (i = 16; i < 80; i++) { 94 BLEND_OP(i, W); 95 } 96 97 /* load the state into our registers */ 98 a=state[0]; b=state[1]; c=state[2]; d=state[3]; 99 e=state[4]; f=state[5]; g=state[6]; h=state[7]; 100 101 /* now iterate */ 102 for (i=0; i<80; i+=8) { 103 t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[i ]; 104 t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2; 105 t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[i+1]; 106 t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2; 107 t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[i+2]; 108 t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2; 109 t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[i+3]; 110 t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2; 111 t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[i+4]; 112 t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2; 113 t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[i+5]; 114 t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2; 115 t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[i+6]; 116 t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2; 117 t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[i+7]; 118 t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2; 119 } 120 121 state[0] += a; state[1] += b; state[2] += c; state[3] += d; 122 state[4] += e; state[5] += f; state[6] += g; state[7] += h; 123 124 /* erase our data */ 125 a = b = c = d = e = f = g = h = t1 = t2 = 0; 126 memset(W, 0, sizeof(__get_cpu_var(msg_schedule))); 127 put_cpu_var(msg_schedule); 128 } 129 130 static int 131 sha512_init(struct shash_desc *desc) 132 { 133 struct sha512_state *sctx = shash_desc_ctx(desc); 134 sctx->state[0] = SHA512_H0; 135 sctx->state[1] = SHA512_H1; 136 sctx->state[2] = SHA512_H2; 137 sctx->state[3] = SHA512_H3; 138 sctx->state[4] = SHA512_H4; 139 sctx->state[5] = SHA512_H5; 140 sctx->state[6] = SHA512_H6; 141 sctx->state[7] = SHA512_H7; 142 sctx->count[0] = sctx->count[1] = 0; 143 144 return 0; 145 } 146 147 static int 148 sha384_init(struct shash_desc *desc) 149 { 150 struct sha512_state *sctx = shash_desc_ctx(desc); 151 sctx->state[0] = SHA384_H0; 152 sctx->state[1] = SHA384_H1; 153 sctx->state[2] = SHA384_H2; 154 sctx->state[3] = SHA384_H3; 155 sctx->state[4] = SHA384_H4; 156 sctx->state[5] = SHA384_H5; 157 sctx->state[6] = SHA384_H6; 158 sctx->state[7] = SHA384_H7; 159 sctx->count[0] = sctx->count[1] = 0; 160 161 return 0; 162 } 163 164 static int 165 sha512_update(struct shash_desc *desc, const u8 *data, unsigned int len) 166 { 167 struct sha512_state *sctx = shash_desc_ctx(desc); 168 169 unsigned int i, index, part_len; 170 171 /* Compute number of bytes mod 128 */ 172 index = sctx->count[0] & 0x7f; 173 174 /* Update number of bytes */ 175 if (!(sctx->count[0] += len)) 176 sctx->count[1]++; 177 178 part_len = 128 - index; 179 180 /* Transform as many times as possible. */ 181 if (len >= part_len) { 182 memcpy(&sctx->buf[index], data, part_len); 183 sha512_transform(sctx->state, sctx->buf); 184 185 for (i = part_len; i + 127 < len; i+=128) 186 sha512_transform(sctx->state, &data[i]); 187 188 index = 0; 189 } else { 190 i = 0; 191 } 192 193 /* Buffer remaining input */ 194 memcpy(&sctx->buf[index], &data[i], len - i); 195 196 return 0; 197 } 198 199 static int 200 sha512_final(struct shash_desc *desc, u8 *hash) 201 { 202 struct sha512_state *sctx = shash_desc_ctx(desc); 203 static u8 padding[128] = { 0x80, }; 204 __be64 *dst = (__be64 *)hash; 205 __be64 bits[2]; 206 unsigned int index, pad_len; 207 int i; 208 209 /* Save number of bits */ 210 bits[1] = cpu_to_be64(sctx->count[0] << 3); 211 bits[0] = cpu_to_be64(sctx->count[1] << 3 | sctx->count[0] >> 61); 212 213 /* Pad out to 112 mod 128. */ 214 index = sctx->count[0] & 0x7f; 215 pad_len = (index < 112) ? (112 - index) : ((128+112) - index); 216 sha512_update(desc, padding, pad_len); 217 218 /* Append length (before padding) */ 219 sha512_update(desc, (const u8 *)bits, sizeof(bits)); 220 221 /* Store state in digest */ 222 for (i = 0; i < 8; i++) 223 dst[i] = cpu_to_be64(sctx->state[i]); 224 225 /* Zeroize sensitive information. */ 226 memset(sctx, 0, sizeof(struct sha512_state)); 227 228 return 0; 229 } 230 231 static int sha384_final(struct shash_desc *desc, u8 *hash) 232 { 233 u8 D[64]; 234 235 sha512_final(desc, D); 236 237 memcpy(hash, D, 48); 238 memset(D, 0, 64); 239 240 return 0; 241 } 242 243 static struct shash_alg sha512 = { 244 .digestsize = SHA512_DIGEST_SIZE, 245 .init = sha512_init, 246 .update = sha512_update, 247 .final = sha512_final, 248 .descsize = sizeof(struct sha512_state), 249 .base = { 250 .cra_name = "sha512", 251 .cra_flags = CRYPTO_ALG_TYPE_SHASH, 252 .cra_blocksize = SHA512_BLOCK_SIZE, 253 .cra_module = THIS_MODULE, 254 } 255 }; 256 257 static struct shash_alg sha384 = { 258 .digestsize = SHA384_DIGEST_SIZE, 259 .init = sha384_init, 260 .update = sha512_update, 261 .final = sha384_final, 262 .descsize = sizeof(struct sha512_state), 263 .base = { 264 .cra_name = "sha384", 265 .cra_flags = CRYPTO_ALG_TYPE_SHASH, 266 .cra_blocksize = SHA384_BLOCK_SIZE, 267 .cra_module = THIS_MODULE, 268 } 269 }; 270 271 static int __init sha512_generic_mod_init(void) 272 { 273 int ret = 0; 274 275 if ((ret = crypto_register_shash(&sha384)) < 0) 276 goto out; 277 if ((ret = crypto_register_shash(&sha512)) < 0) 278 crypto_unregister_shash(&sha384); 279 out: 280 return ret; 281 } 282 283 static void __exit sha512_generic_mod_fini(void) 284 { 285 crypto_unregister_shash(&sha384); 286 crypto_unregister_shash(&sha512); 287 } 288 289 module_init(sha512_generic_mod_init); 290 module_exit(sha512_generic_mod_fini); 291 292 MODULE_LICENSE("GPL"); 293 MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms"); 294 295 MODULE_ALIAS("sha384"); 296 MODULE_ALIAS("sha512"); 297