sha512_generic.c 9.1 KB

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