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