blob: e736596ca5741a86adf19f44129b0a4399eecdd6 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/* 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
14#include <linux/kernel.h>
15#include <linux/module.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070016#include <linux/mm.h>
17#include <linux/init.h>
18#include <linux/crypto.h>
Herbert Xu06ace7a2005-10-30 21:25:15 +110019#include <linux/types.h>
Jan Glauber5265eeb2007-10-09 22:43:13 +080020#include <crypto/sha.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021
22#include <asm/scatterlist.h>
23#include <asm/byteorder.h>
24
Linus Torvalds1da177e2005-04-16 15:20:36 -070025struct sha512_ctx {
26 u64 state[8];
27 u32 count[4];
28 u8 buf[128];
29 u64 W[80];
30};
31
32static inline u64 Ch(u64 x, u64 y, u64 z)
33{
34 return z ^ (x & (y ^ z));
35}
36
37static inline u64 Maj(u64 x, u64 y, u64 z)
38{
39 return (x & y) | (z & (x | y));
40}
41
42static inline u64 RORu64(u64 x, u64 y)
43{
44 return (x >> y) | (x << (64 - y));
45}
46
47static const u64 sha512_K[80] = {
48 0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL,
49 0xe9b5dba58189dbbcULL, 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
50 0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL, 0xd807aa98a3030242ULL,
51 0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
52 0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL,
53 0xc19bf174cf692694ULL, 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
54 0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL, 0x2de92c6f592b0275ULL,
55 0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
56 0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL,
57 0xbf597fc7beef0ee4ULL, 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
58 0x06ca6351e003826fULL, 0x142929670a0e6e70ULL, 0x27b70a8546d22ffcULL,
59 0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
60 0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL,
61 0x92722c851482353bULL, 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
62 0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL, 0xd192e819d6ef5218ULL,
63 0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
64 0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL,
65 0x34b0bcb5e19b48a8ULL, 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
66 0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL, 0x748f82ee5defb2fcULL,
67 0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
68 0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL,
69 0xc67178f2e372532bULL, 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
70 0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL, 0x06f067aa72176fbaULL,
71 0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
72 0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL,
73 0x431d67c49c100d4cULL, 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
74 0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL,
75};
76
77#define e0(x) (RORu64(x,28) ^ RORu64(x,34) ^ RORu64(x,39))
78#define e1(x) (RORu64(x,14) ^ RORu64(x,18) ^ RORu64(x,41))
79#define s0(x) (RORu64(x, 1) ^ RORu64(x, 8) ^ (x >> 7))
80#define s1(x) (RORu64(x,19) ^ RORu64(x,61) ^ (x >> 6))
81
Linus Torvalds1da177e2005-04-16 15:20:36 -070082static inline void LOAD_OP(int I, u64 *W, const u8 *input)
83{
84 W[I] = __be64_to_cpu( ((__be64*)(input))[I] );
85}
86
87static inline void BLEND_OP(int I, u64 *W)
88{
89 W[I] = s1(W[I-2]) + W[I-7] + s0(W[I-15]) + W[I-16];
90}
91
92static void
93sha512_transform(u64 *state, u64 *W, const u8 *input)
94{
95 u64 a, b, c, d, e, f, g, h, t1, t2;
96
97 int i;
98
99 /* load the input */
100 for (i = 0; i < 16; i++)
101 LOAD_OP(i, W, input);
102
103 for (i = 16; i < 80; i++) {
104 BLEND_OP(i, W);
105 }
106
107 /* load the state into our registers */
108 a=state[0]; b=state[1]; c=state[2]; d=state[3];
109 e=state[4]; f=state[5]; g=state[6]; h=state[7];
110
111 /* now iterate */
112 for (i=0; i<80; i+=8) {
113 t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[i ];
114 t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
115 t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[i+1];
116 t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
117 t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[i+2];
118 t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
119 t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[i+3];
120 t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
121 t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[i+4];
122 t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
123 t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[i+5];
124 t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
125 t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[i+6];
126 t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
127 t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[i+7];
128 t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
129 }
130
131 state[0] += a; state[1] += b; state[2] += c; state[3] += d;
132 state[4] += e; state[5] += f; state[6] += g; state[7] += h;
133
134 /* erase our data */
135 a = b = c = d = e = f = g = h = t1 = t2 = 0;
136}
137
138static void
Herbert Xu6c2bb982006-05-16 22:09:29 +1000139sha512_init(struct crypto_tfm *tfm)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140{
Herbert Xu6c2bb982006-05-16 22:09:29 +1000141 struct sha512_ctx *sctx = crypto_tfm_ctx(tfm);
Jan Glauber5265eeb2007-10-09 22:43:13 +0800142 sctx->state[0] = SHA512_H0;
143 sctx->state[1] = SHA512_H1;
144 sctx->state[2] = SHA512_H2;
145 sctx->state[3] = SHA512_H3;
146 sctx->state[4] = SHA512_H4;
147 sctx->state[5] = SHA512_H5;
148 sctx->state[6] = SHA512_H6;
149 sctx->state[7] = SHA512_H7;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700150 sctx->count[0] = sctx->count[1] = sctx->count[2] = sctx->count[3] = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151}
152
153static void
Herbert Xu6c2bb982006-05-16 22:09:29 +1000154sha384_init(struct crypto_tfm *tfm)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155{
Herbert Xu6c2bb982006-05-16 22:09:29 +1000156 struct sha512_ctx *sctx = crypto_tfm_ctx(tfm);
Jan Glauber5265eeb2007-10-09 22:43:13 +0800157 sctx->state[0] = SHA384_H0;
158 sctx->state[1] = SHA384_H1;
159 sctx->state[2] = SHA384_H2;
160 sctx->state[3] = SHA384_H3;
161 sctx->state[4] = SHA384_H4;
162 sctx->state[5] = SHA384_H5;
163 sctx->state[6] = SHA384_H6;
164 sctx->state[7] = SHA384_H7;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700165 sctx->count[0] = sctx->count[1] = sctx->count[2] = sctx->count[3] = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166}
167
168static void
Herbert Xu6c2bb982006-05-16 22:09:29 +1000169sha512_update(struct crypto_tfm *tfm, const u8 *data, unsigned int len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170{
Herbert Xu6c2bb982006-05-16 22:09:29 +1000171 struct sha512_ctx *sctx = crypto_tfm_ctx(tfm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700172
173 unsigned int i, index, part_len;
174
175 /* Compute number of bytes mod 128 */
176 index = (unsigned int)((sctx->count[0] >> 3) & 0x7F);
177
178 /* Update number of bits */
179 if ((sctx->count[0] += (len << 3)) < (len << 3)) {
180 if ((sctx->count[1] += 1) < 1)
181 if ((sctx->count[2] += 1) < 1)
182 sctx->count[3]++;
183 sctx->count[1] += (len >> 29);
184 }
185
186 part_len = 128 - index;
187
188 /* Transform as many times as possible. */
189 if (len >= part_len) {
190 memcpy(&sctx->buf[index], data, part_len);
191 sha512_transform(sctx->state, sctx->W, sctx->buf);
192
193 for (i = part_len; i + 127 < len; i+=128)
194 sha512_transform(sctx->state, sctx->W, &data[i]);
195
196 index = 0;
197 } else {
198 i = 0;
199 }
200
201 /* Buffer remaining input */
202 memcpy(&sctx->buf[index], &data[i], len - i);
203
204 /* erase our data */
205 memset(sctx->W, 0, sizeof(sctx->W));
206}
207
208static void
Herbert Xu6c2bb982006-05-16 22:09:29 +1000209sha512_final(struct crypto_tfm *tfm, u8 *hash)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700210{
Herbert Xu6c2bb982006-05-16 22:09:29 +1000211 struct sha512_ctx *sctx = crypto_tfm_ctx(tfm);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212 static u8 padding[128] = { 0x80, };
Herbert Xu06ace7a2005-10-30 21:25:15 +1100213 __be64 *dst = (__be64 *)hash;
214 __be32 bits[4];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215 unsigned int index, pad_len;
Herbert Xu06ace7a2005-10-30 21:25:15 +1100216 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217
218 /* Save number of bits */
Herbert Xu06ace7a2005-10-30 21:25:15 +1100219 bits[3] = cpu_to_be32(sctx->count[0]);
220 bits[2] = cpu_to_be32(sctx->count[1]);
221 bits[1] = cpu_to_be32(sctx->count[2]);
222 bits[0] = cpu_to_be32(sctx->count[3]);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700223
224 /* Pad out to 112 mod 128. */
225 index = (sctx->count[0] >> 3) & 0x7f;
226 pad_len = (index < 112) ? (112 - index) : ((128+112) - index);
Herbert Xu6c2bb982006-05-16 22:09:29 +1000227 sha512_update(tfm, padding, pad_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228
229 /* Append length (before padding) */
Herbert Xu6c2bb982006-05-16 22:09:29 +1000230 sha512_update(tfm, (const u8 *)bits, sizeof(bits));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700231
232 /* Store state in digest */
Herbert Xu06ace7a2005-10-30 21:25:15 +1100233 for (i = 0; i < 8; i++)
234 dst[i] = cpu_to_be64(sctx->state[i]);
235
Linus Torvalds1da177e2005-04-16 15:20:36 -0700236 /* Zeroize sensitive information. */
237 memset(sctx, 0, sizeof(struct sha512_ctx));
238}
239
Herbert Xu6c2bb982006-05-16 22:09:29 +1000240static void sha384_final(struct crypto_tfm *tfm, u8 *hash)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242 u8 D[64];
243
Herbert Xu6c2bb982006-05-16 22:09:29 +1000244 sha512_final(tfm, D);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245
246 memcpy(hash, D, 48);
247 memset(D, 0, 64);
248}
249
250static struct crypto_alg sha512 = {
251 .cra_name = "sha512",
252 .cra_flags = CRYPTO_ALG_TYPE_DIGEST,
Jan Glauber5265eeb2007-10-09 22:43:13 +0800253 .cra_blocksize = SHA512_BLOCK_SIZE,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254 .cra_ctxsize = sizeof(struct sha512_ctx),
255 .cra_module = THIS_MODULE,
Atsushi Nemotoe1147d82006-04-10 08:42:35 +1000256 .cra_alignmask = 3,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 .cra_list = LIST_HEAD_INIT(sha512.cra_list),
258 .cra_u = { .digest = {
259 .dia_digestsize = SHA512_DIGEST_SIZE,
260 .dia_init = sha512_init,
261 .dia_update = sha512_update,
262 .dia_final = sha512_final }
263 }
264};
265
266static struct crypto_alg sha384 = {
267 .cra_name = "sha384",
268 .cra_flags = CRYPTO_ALG_TYPE_DIGEST,
Jan Glauber5265eeb2007-10-09 22:43:13 +0800269 .cra_blocksize = SHA384_BLOCK_SIZE,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700270 .cra_ctxsize = sizeof(struct sha512_ctx),
Atsushi Nemotoe1147d82006-04-10 08:42:35 +1000271 .cra_alignmask = 3,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 .cra_module = THIS_MODULE,
273 .cra_list = LIST_HEAD_INIT(sha384.cra_list),
274 .cra_u = { .digest = {
275 .dia_digestsize = SHA384_DIGEST_SIZE,
276 .dia_init = sha384_init,
277 .dia_update = sha512_update,
278 .dia_final = sha384_final }
279 }
280};
281
282MODULE_ALIAS("sha384");
283
284static int __init init(void)
285{
286 int ret = 0;
287
288 if ((ret = crypto_register_alg(&sha384)) < 0)
289 goto out;
290 if ((ret = crypto_register_alg(&sha512)) < 0)
291 crypto_unregister_alg(&sha384);
292out:
293 return ret;
294}
295
296static void __exit fini(void)
297{
298 crypto_unregister_alg(&sha384);
299 crypto_unregister_alg(&sha512);
300}
301
302module_init(init);
303module_exit(fini);
304
305MODULE_LICENSE("GPL");
306MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms");