sha512_generic.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236
  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. const u8 sha384_zero_message_hash[SHA384_DIGEST_SIZE] = {
  26. 0x38, 0xb0, 0x60, 0xa7, 0x51, 0xac, 0x96, 0x38,
  27. 0x4c, 0xd9, 0x32, 0x7e, 0xb1, 0xb1, 0xe3, 0x6a,
  28. 0x21, 0xfd, 0xb7, 0x11, 0x14, 0xbe, 0x07, 0x43,
  29. 0x4c, 0x0c, 0xc7, 0xbf, 0x63, 0xf6, 0xe1, 0xda,
  30. 0x27, 0x4e, 0xde, 0xbf, 0xe7, 0x6f, 0x65, 0xfb,
  31. 0xd5, 0x1a, 0xd2, 0xf1, 0x48, 0x98, 0xb9, 0x5b
  32. };
  33. EXPORT_SYMBOL_GPL(sha384_zero_message_hash);
  34. const u8 sha512_zero_message_hash[SHA512_DIGEST_SIZE] = {
  35. 0xcf, 0x83, 0xe1, 0x35, 0x7e, 0xef, 0xb8, 0xbd,
  36. 0xf1, 0x54, 0x28, 0x50, 0xd6, 0x6d, 0x80, 0x07,
  37. 0xd6, 0x20, 0xe4, 0x05, 0x0b, 0x57, 0x15, 0xdc,
  38. 0x83, 0xf4, 0xa9, 0x21, 0xd3, 0x6c, 0xe9, 0xce,
  39. 0x47, 0xd0, 0xd1, 0x3c, 0x5d, 0x85, 0xf2, 0xb0,
  40. 0xff, 0x83, 0x18, 0xd2, 0x87, 0x7e, 0xec, 0x2f,
  41. 0x63, 0xb9, 0x31, 0xbd, 0x47, 0x41, 0x7a, 0x81,
  42. 0xa5, 0x38, 0x32, 0x7a, 0xf9, 0x27, 0xda, 0x3e
  43. };
  44. EXPORT_SYMBOL_GPL(sha512_zero_message_hash);
  45. static inline u64 Ch(u64 x, u64 y, u64 z)
  46. {
  47. return z ^ (x & (y ^ z));
  48. }
  49. static inline u64 Maj(u64 x, u64 y, u64 z)
  50. {
  51. return (x & y) | (z & (x | y));
  52. }
  53. static const u64 sha512_K[80] = {
  54. 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL,
  55. 0xe9b5dba58189dbbcULL, 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
  56. 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL, 0xd807aa98a3030242ULL,
  57. 0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
  58. 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL,
  59. 0xc19bf174cf692694ULL, 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
  60. 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL, 0x2de92c6f592b0275ULL,
  61. 0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
  62. 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL,
  63. 0xbf597fc7beef0ee4ULL, 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
  64. 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL, 0x27b70a8546d22ffcULL,
  65. 0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
  66. 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL,
  67. 0x92722c851482353bULL, 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
  68. 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL, 0xd192e819d6ef5218ULL,
  69. 0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
  70. 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL,
  71. 0x34b0bcb5e19b48a8ULL, 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
  72. 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL, 0x748f82ee5defb2fcULL,
  73. 0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
  74. 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL,
  75. 0xc67178f2e372532bULL, 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
  76. 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL, 0x06f067aa72176fbaULL,
  77. 0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
  78. 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL,
  79. 0x431d67c49c100d4cULL, 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
  80. 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL,
  81. };
  82. #define e0(x) (ror64(x,28) ^ ror64(x,34) ^ ror64(x,39))
  83. #define e1(x) (ror64(x,14) ^ ror64(x,18) ^ ror64(x,41))
  84. #define s0(x) (ror64(x, 1) ^ ror64(x, 8) ^ (x >> 7))
  85. #define s1(x) (ror64(x,19) ^ ror64(x,61) ^ (x >> 6))
  86. static inline void LOAD_OP(int I, u64 *W, const u8 *input)
  87. {
  88. W[I] = get_unaligned_be64((__u64 *)input + I);
  89. }
  90. static inline void BLEND_OP(int I, u64 *W)
  91. {
  92. W[I & 15] += s1(W[(I-2) & 15]) + W[(I-7) & 15] + s0(W[(I-15) & 15]);
  93. }
  94. static void
  95. sha512_transform(u64 *state, const u8 *input)
  96. {
  97. u64 a, b, c, d, e, f, g, h, t1, t2;
  98. int i;
  99. u64 W[16];
  100. /* load the state into our registers */
  101. a=state[0]; b=state[1]; c=state[2]; d=state[3];
  102. e=state[4]; f=state[5]; g=state[6]; h=state[7];
  103. /* now iterate */
  104. for (i=0; i<80; i+=8) {
  105. if (!(i & 8)) {
  106. int j;
  107. if (i < 16) {
  108. /* load the input */
  109. for (j = 0; j < 16; j++)
  110. LOAD_OP(i + j, W, input);
  111. } else {
  112. for (j = 0; j < 16; j++) {
  113. BLEND_OP(i + j, W);
  114. }
  115. }
  116. }
  117. t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[(i & 15)];
  118. t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
  119. t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[(i & 15) + 1];
  120. t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
  121. t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[(i & 15) + 2];
  122. t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
  123. t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[(i & 15) + 3];
  124. t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
  125. t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[(i & 15) + 4];
  126. t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
  127. t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[(i & 15) + 5];
  128. t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
  129. t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[(i & 15) + 6];
  130. t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
  131. t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[(i & 15) + 7];
  132. t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
  133. }
  134. state[0] += a; state[1] += b; state[2] += c; state[3] += d;
  135. state[4] += e; state[5] += f; state[6] += g; state[7] += h;
  136. /* erase our data */
  137. a = b = c = d = e = f = g = h = t1 = t2 = 0;
  138. }
  139. static void sha512_generic_block_fn(struct sha512_state *sst, u8 const *src,
  140. int blocks)
  141. {
  142. while (blocks--) {
  143. sha512_transform(sst->state, src);
  144. src += SHA512_BLOCK_SIZE;
  145. }
  146. }
  147. int crypto_sha512_update(struct shash_desc *desc, const u8 *data,
  148. unsigned int len)
  149. {
  150. return sha512_base_do_update(desc, data, len, sha512_generic_block_fn);
  151. }
  152. EXPORT_SYMBOL(crypto_sha512_update);
  153. static int sha512_final(struct shash_desc *desc, u8 *hash)
  154. {
  155. sha512_base_do_finalize(desc, sha512_generic_block_fn);
  156. return sha512_base_finish(desc, hash);
  157. }
  158. int crypto_sha512_finup(struct shash_desc *desc, const u8 *data,
  159. unsigned int len, u8 *hash)
  160. {
  161. sha512_base_do_update(desc, data, len, sha512_generic_block_fn);
  162. return sha512_final(desc, hash);
  163. }
  164. EXPORT_SYMBOL(crypto_sha512_finup);
  165. static struct shash_alg sha512_algs[2] = { {
  166. .digestsize = SHA512_DIGEST_SIZE,
  167. .init = sha512_base_init,
  168. .update = crypto_sha512_update,
  169. .final = sha512_final,
  170. .finup = crypto_sha512_finup,
  171. .descsize = sizeof(struct sha512_state),
  172. .base = {
  173. .cra_name = "sha512",
  174. .cra_driver_name = "sha512-generic",
  175. .cra_priority = 100,
  176. .cra_blocksize = SHA512_BLOCK_SIZE,
  177. .cra_module = THIS_MODULE,
  178. }
  179. }, {
  180. .digestsize = SHA384_DIGEST_SIZE,
  181. .init = sha384_base_init,
  182. .update = crypto_sha512_update,
  183. .final = sha512_final,
  184. .finup = crypto_sha512_finup,
  185. .descsize = sizeof(struct sha512_state),
  186. .base = {
  187. .cra_name = "sha384",
  188. .cra_driver_name = "sha384-generic",
  189. .cra_priority = 100,
  190. .cra_blocksize = SHA384_BLOCK_SIZE,
  191. .cra_module = THIS_MODULE,
  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. static void __exit sha512_generic_mod_fini(void)
  199. {
  200. crypto_unregister_shashes(sha512_algs, ARRAY_SIZE(sha512_algs));
  201. }
  202. module_init(sha512_generic_mod_init);
  203. module_exit(sha512_generic_mod_fini);
  204. MODULE_LICENSE("GPL");
  205. MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms");
  206. MODULE_ALIAS_CRYPTO("sha384");
  207. MODULE_ALIAS_CRYPTO("sha384-generic");
  208. MODULE_ALIAS_CRYPTO("sha512");
  209. MODULE_ALIAS_CRYPTO("sha512-generic");