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 <crypto/sha512_base.h> 22 #include <linux/percpu.h> 23 #include <asm/byteorder.h> 24 #include <asm/unaligned.h> 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] = get_unaligned_be64((__u64 *)input + I); 74 } 75 76 static inline void BLEND_OP(int I, u64 *W) 77 { 78 W[I & 15] += s1(W[(I-2) & 15]) + W[(I-7) & 15] + s0(W[(I-15) & 15]); 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[16]; 88 89 /* load the state into our registers */ 90 a=state[0]; b=state[1]; c=state[2]; d=state[3]; 91 e=state[4]; f=state[5]; g=state[6]; h=state[7]; 92 93 /* now iterate */ 94 for (i=0; i<80; i+=8) { 95 if (!(i & 8)) { 96 int j; 97 98 if (i < 16) { 99 /* load the input */ 100 for (j = 0; j < 16; j++) 101 LOAD_OP(i + j, W, input); 102 } else { 103 for (j = 0; j < 16; j++) { 104 BLEND_OP(i + j, W); 105 } 106 } 107 } 108 109 t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[(i & 15)]; 110 t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2; 111 t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[(i & 15) + 1]; 112 t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2; 113 t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[(i & 15) + 2]; 114 t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2; 115 t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[(i & 15) + 3]; 116 t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2; 117 t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[(i & 15) + 4]; 118 t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2; 119 t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[(i & 15) + 5]; 120 t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2; 121 t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[(i & 15) + 6]; 122 t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2; 123 t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[(i & 15) + 7]; 124 t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2; 125 } 126 127 state[0] += a; state[1] += b; state[2] += c; state[3] += d; 128 state[4] += e; state[5] += f; state[6] += g; state[7] += h; 129 130 /* erase our data */ 131 a = b = c = d = e = f = g = h = t1 = t2 = 0; 132 } 133 134 static void sha512_generic_block_fn(struct sha512_state *sst, u8 const *src, 135 int blocks) 136 { 137 while (blocks--) { 138 sha512_transform(sst->state, src); 139 src += SHA512_BLOCK_SIZE; 140 } 141 } 142 143 int crypto_sha512_update(struct shash_desc *desc, const u8 *data, 144 unsigned int len) 145 { 146 return sha512_base_do_update(desc, data, len, sha512_generic_block_fn); 147 } 148 EXPORT_SYMBOL(crypto_sha512_update); 149 150 static int sha512_final(struct shash_desc *desc, u8 *hash) 151 { 152 sha512_base_do_finalize(desc, sha512_generic_block_fn); 153 return sha512_base_finish(desc, hash); 154 } 155 156 int crypto_sha512_finup(struct shash_desc *desc, const u8 *data, 157 unsigned int len, u8 *hash) 158 { 159 sha512_base_do_update(desc, data, len, sha512_generic_block_fn); 160 return sha512_final(desc, hash); 161 } 162 EXPORT_SYMBOL(crypto_sha512_finup); 163 164 static struct shash_alg sha512_algs[2] = { { 165 .digestsize = SHA512_DIGEST_SIZE, 166 .init = sha512_base_init, 167 .update = crypto_sha512_update, 168 .final = sha512_final, 169 .finup = crypto_sha512_finup, 170 .descsize = sizeof(struct sha512_state), 171 .base = { 172 .cra_name = "sha512", 173 .cra_driver_name = "sha512-generic", 174 .cra_flags = CRYPTO_ALG_TYPE_SHASH, 175 .cra_blocksize = SHA512_BLOCK_SIZE, 176 .cra_module = THIS_MODULE, 177 } 178 }, { 179 .digestsize = SHA384_DIGEST_SIZE, 180 .init = sha384_base_init, 181 .update = crypto_sha512_update, 182 .final = sha512_final, 183 .finup = crypto_sha512_finup, 184 .descsize = sizeof(struct sha512_state), 185 .base = { 186 .cra_name = "sha384", 187 .cra_driver_name = "sha384-generic", 188 .cra_flags = CRYPTO_ALG_TYPE_SHASH, 189 .cra_blocksize = SHA384_BLOCK_SIZE, 190 .cra_module = THIS_MODULE, 191 } 192 } }; 193 194 static int __init sha512_generic_mod_init(void) 195 { 196 return crypto_register_shashes(sha512_algs, ARRAY_SIZE(sha512_algs)); 197 } 198 199 static void __exit sha512_generic_mod_fini(void) 200 { 201 crypto_unregister_shashes(sha512_algs, ARRAY_SIZE(sha512_algs)); 202 } 203 204 module_init(sha512_generic_mod_init); 205 module_exit(sha512_generic_mod_fini); 206 207 MODULE_LICENSE("GPL"); 208 MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms"); 209 210 MODULE_ALIAS_CRYPTO("sha384"); 211 MODULE_ALIAS_CRYPTO("sha384-generic"); 212 MODULE_ALIAS_CRYPTO("sha512"); 213 MODULE_ALIAS_CRYPTO("sha512-generic"); 214