Root/crypto/sha512_generic.c

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

Archive Download this file



interactive