Loading...
1// SPDX-License-Identifier: GPL-2.0-or-later
2/* SHA-512 code by Jean-Luc Cooke <jlcooke@certainkey.com>
3 *
4 * Copyright (c) Jean-Luc Cooke <jlcooke@certainkey.com>
5 * Copyright (c) Andrew McDonald <andrew@mcdonald.org.uk>
6 * Copyright (c) 2003 Kyle McMartin <kyle@debian.org>
7 */
8#include <crypto/internal/hash.h>
9#include <linux/kernel.h>
10#include <linux/module.h>
11#include <linux/mm.h>
12#include <linux/init.h>
13#include <linux/crypto.h>
14#include <linux/types.h>
15#include <crypto/sha2.h>
16#include <crypto/sha512_base.h>
17#include <linux/percpu.h>
18#include <asm/byteorder.h>
19#include <asm/unaligned.h>
20
21const u8 sha384_zero_message_hash[SHA384_DIGEST_SIZE] = {
22 0x38, 0xb0, 0x60, 0xa7, 0x51, 0xac, 0x96, 0x38,
23 0x4c, 0xd9, 0x32, 0x7e, 0xb1, 0xb1, 0xe3, 0x6a,
24 0x21, 0xfd, 0xb7, 0x11, 0x14, 0xbe, 0x07, 0x43,
25 0x4c, 0x0c, 0xc7, 0xbf, 0x63, 0xf6, 0xe1, 0xda,
26 0x27, 0x4e, 0xde, 0xbf, 0xe7, 0x6f, 0x65, 0xfb,
27 0xd5, 0x1a, 0xd2, 0xf1, 0x48, 0x98, 0xb9, 0x5b
28};
29EXPORT_SYMBOL_GPL(sha384_zero_message_hash);
30
31const u8 sha512_zero_message_hash[SHA512_DIGEST_SIZE] = {
32 0xcf, 0x83, 0xe1, 0x35, 0x7e, 0xef, 0xb8, 0xbd,
33 0xf1, 0x54, 0x28, 0x50, 0xd6, 0x6d, 0x80, 0x07,
34 0xd6, 0x20, 0xe4, 0x05, 0x0b, 0x57, 0x15, 0xdc,
35 0x83, 0xf4, 0xa9, 0x21, 0xd3, 0x6c, 0xe9, 0xce,
36 0x47, 0xd0, 0xd1, 0x3c, 0x5d, 0x85, 0xf2, 0xb0,
37 0xff, 0x83, 0x18, 0xd2, 0x87, 0x7e, 0xec, 0x2f,
38 0x63, 0xb9, 0x31, 0xbd, 0x47, 0x41, 0x7a, 0x81,
39 0xa5, 0x38, 0x32, 0x7a, 0xf9, 0x27, 0xda, 0x3e
40};
41EXPORT_SYMBOL_GPL(sha512_zero_message_hash);
42
43static inline u64 Ch(u64 x, u64 y, u64 z)
44{
45 return z ^ (x & (y ^ z));
46}
47
48static inline u64 Maj(u64 x, u64 y, u64 z)
49{
50 return (x & y) | (z & (x | y));
51}
52
53static 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
83#define e0(x) (ror64(x,28) ^ ror64(x,34) ^ ror64(x,39))
84#define e1(x) (ror64(x,14) ^ ror64(x,18) ^ ror64(x,41))
85#define s0(x) (ror64(x, 1) ^ ror64(x, 8) ^ (x >> 7))
86#define s1(x) (ror64(x,19) ^ ror64(x,61) ^ (x >> 6))
87
88static inline void LOAD_OP(int I, u64 *W, const u8 *input)
89{
90 W[I] = get_unaligned_be64((__u64 *)input + I);
91}
92
93static inline void BLEND_OP(int I, u64 *W)
94{
95 W[I & 15] += s1(W[(I-2) & 15]) + W[(I-7) & 15] + s0(W[(I-15) & 15]);
96}
97
98static void
99sha512_transform(u64 *state, const u8 *input)
100{
101 u64 a, b, c, d, e, f, g, h, t1, t2;
102
103 int i;
104 u64 W[16];
105
106 /* load the state into our registers */
107 a=state[0]; b=state[1]; c=state[2]; d=state[3];
108 e=state[4]; f=state[5]; g=state[6]; h=state[7];
109
110 /* now iterate */
111 for (i=0; i<80; i+=8) {
112 if (!(i & 8)) {
113 int j;
114
115 if (i < 16) {
116 /* load the input */
117 for (j = 0; j < 16; j++)
118 LOAD_OP(i + j, W, input);
119 } else {
120 for (j = 0; j < 16; j++) {
121 BLEND_OP(i + j, W);
122 }
123 }
124 }
125
126 t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[(i & 15)];
127 t2 = e0(a) + Maj(a,b,c); d+=t1; h=t1+t2;
128 t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[(i & 15) + 1];
129 t2 = e0(h) + Maj(h,a,b); c+=t1; g=t1+t2;
130 t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[(i & 15) + 2];
131 t2 = e0(g) + Maj(g,h,a); b+=t1; f=t1+t2;
132 t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[(i & 15) + 3];
133 t2 = e0(f) + Maj(f,g,h); a+=t1; e=t1+t2;
134 t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[(i & 15) + 4];
135 t2 = e0(e) + Maj(e,f,g); h+=t1; d=t1+t2;
136 t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[(i & 15) + 5];
137 t2 = e0(d) + Maj(d,e,f); g+=t1; c=t1+t2;
138 t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[(i & 15) + 6];
139 t2 = e0(c) + Maj(c,d,e); f+=t1; b=t1+t2;
140 t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[(i & 15) + 7];
141 t2 = e0(b) + Maj(b,c,d); e+=t1; a=t1+t2;
142 }
143
144 state[0] += a; state[1] += b; state[2] += c; state[3] += d;
145 state[4] += e; state[5] += f; state[6] += g; state[7] += h;
146}
147
148static void sha512_generic_block_fn(struct sha512_state *sst, u8 const *src,
149 int blocks)
150{
151 while (blocks--) {
152 sha512_transform(sst->state, src);
153 src += SHA512_BLOCK_SIZE;
154 }
155}
156
157int crypto_sha512_update(struct shash_desc *desc, const u8 *data,
158 unsigned int len)
159{
160 return sha512_base_do_update(desc, data, len, sha512_generic_block_fn);
161}
162EXPORT_SYMBOL(crypto_sha512_update);
163
164static int sha512_final(struct shash_desc *desc, u8 *hash)
165{
166 sha512_base_do_finalize(desc, sha512_generic_block_fn);
167 return sha512_base_finish(desc, hash);
168}
169
170int crypto_sha512_finup(struct shash_desc *desc, const u8 *data,
171 unsigned int len, u8 *hash)
172{
173 sha512_base_do_update(desc, data, len, sha512_generic_block_fn);
174 return sha512_final(desc, hash);
175}
176EXPORT_SYMBOL(crypto_sha512_finup);
177
178static struct shash_alg sha512_algs[2] = { {
179 .digestsize = SHA512_DIGEST_SIZE,
180 .init = sha512_base_init,
181 .update = crypto_sha512_update,
182 .final = sha512_final,
183 .finup = crypto_sha512_finup,
184 .descsize = sizeof(struct sha512_state),
185 .base = {
186 .cra_name = "sha512",
187 .cra_driver_name = "sha512-generic",
188 .cra_priority = 100,
189 .cra_blocksize = SHA512_BLOCK_SIZE,
190 .cra_module = THIS_MODULE,
191 }
192}, {
193 .digestsize = SHA384_DIGEST_SIZE,
194 .init = sha384_base_init,
195 .update = crypto_sha512_update,
196 .final = sha512_final,
197 .finup = crypto_sha512_finup,
198 .descsize = sizeof(struct sha512_state),
199 .base = {
200 .cra_name = "sha384",
201 .cra_driver_name = "sha384-generic",
202 .cra_priority = 100,
203 .cra_blocksize = SHA384_BLOCK_SIZE,
204 .cra_module = THIS_MODULE,
205 }
206} };
207
208static int __init sha512_generic_mod_init(void)
209{
210 return crypto_register_shashes(sha512_algs, ARRAY_SIZE(sha512_algs));
211}
212
213static void __exit sha512_generic_mod_fini(void)
214{
215 crypto_unregister_shashes(sha512_algs, ARRAY_SIZE(sha512_algs));
216}
217
218subsys_initcall(sha512_generic_mod_init);
219module_exit(sha512_generic_mod_fini);
220
221MODULE_LICENSE("GPL");
222MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms");
223
224MODULE_ALIAS_CRYPTO("sha384");
225MODULE_ALIAS_CRYPTO("sha384-generic");
226MODULE_ALIAS_CRYPTO("sha512");
227MODULE_ALIAS_CRYPTO("sha512-generic");
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
24static DEFINE_PER_CPU(u64[80], msg_schedule);
25
26static inline u64 Ch(u64 x, u64 y, u64 z)
27{
28 return z ^ (x & (y ^ z));
29}
30
31static inline u64 Maj(u64 x, u64 y, u64 z)
32{
33 return (x & y) | (z & (x | y));
34}
35
36static inline u64 RORu64(u64 x, u64 y)
37{
38 return (x >> y) | (x << (64 - y));
39}
40
41static 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
71#define e0(x) (RORu64(x,28) ^ RORu64(x,34) ^ RORu64(x,39))
72#define e1(x) (RORu64(x,14) ^ RORu64(x,18) ^ RORu64(x,41))
73#define s0(x) (RORu64(x, 1) ^ RORu64(x, 8) ^ (x >> 7))
74#define s1(x) (RORu64(x,19) ^ RORu64(x,61) ^ (x >> 6))
75
76static inline void LOAD_OP(int I, u64 *W, const u8 *input)
77{
78 W[I] = __be64_to_cpu( ((__be64*)(input))[I] );
79}
80
81static inline void BLEND_OP(int I, u64 *W)
82{
83 W[I] = s1(W[I-2]) + W[I-7] + s0(W[I-15]) + W[I-16];
84}
85
86static void
87sha512_transform(u64 *state, const u8 *input)
88{
89 u64 a, b, c, d, e, f, g, h, t1, t2;
90
91 int i;
92 u64 *W = get_cpu_var(msg_schedule);
93
94 /* load the input */
95 for (i = 0; i < 16; i++)
96 LOAD_OP(i, W, input);
97
98 for (i = 16; i < 80; i++) {
99 BLEND_OP(i, W);
100 }
101
102 /* load the state into our registers */
103 a=state[0]; b=state[1]; c=state[2]; d=state[3];
104 e=state[4]; f=state[5]; g=state[6]; h=state[7];
105
106 /* now iterate */
107 for (i=0; i<80; i+=8) {
108 t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i ] + W[i ];
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+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+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+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+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+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+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+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 memset(W, 0, sizeof(__get_cpu_var(msg_schedule)));
132 put_cpu_var(msg_schedule);
133}
134
135static int
136sha512_init(struct shash_desc *desc)
137{
138 struct sha512_state *sctx = shash_desc_ctx(desc);
139 sctx->state[0] = SHA512_H0;
140 sctx->state[1] = SHA512_H1;
141 sctx->state[2] = SHA512_H2;
142 sctx->state[3] = SHA512_H3;
143 sctx->state[4] = SHA512_H4;
144 sctx->state[5] = SHA512_H5;
145 sctx->state[6] = SHA512_H6;
146 sctx->state[7] = SHA512_H7;
147 sctx->count[0] = sctx->count[1] = 0;
148
149 return 0;
150}
151
152static int
153sha384_init(struct shash_desc *desc)
154{
155 struct sha512_state *sctx = shash_desc_ctx(desc);
156 sctx->state[0] = SHA384_H0;
157 sctx->state[1] = SHA384_H1;
158 sctx->state[2] = SHA384_H2;
159 sctx->state[3] = SHA384_H3;
160 sctx->state[4] = SHA384_H4;
161 sctx->state[5] = SHA384_H5;
162 sctx->state[6] = SHA384_H6;
163 sctx->state[7] = SHA384_H7;
164 sctx->count[0] = sctx->count[1] = 0;
165
166 return 0;
167}
168
169static int
170sha512_update(struct shash_desc *desc, const u8 *data, unsigned int len)
171{
172 struct sha512_state *sctx = shash_desc_ctx(desc);
173
174 unsigned int i, index, part_len;
175
176 /* Compute number of bytes mod 128 */
177 index = sctx->count[0] & 0x7f;
178
179 /* Update number of bytes */
180 if (!(sctx->count[0] += len))
181 sctx->count[1]++;
182
183 part_len = 128 - index;
184
185 /* Transform as many times as possible. */
186 if (len >= part_len) {
187 memcpy(&sctx->buf[index], data, part_len);
188 sha512_transform(sctx->state, sctx->buf);
189
190 for (i = part_len; i + 127 < len; i+=128)
191 sha512_transform(sctx->state, &data[i]);
192
193 index = 0;
194 } else {
195 i = 0;
196 }
197
198 /* Buffer remaining input */
199 memcpy(&sctx->buf[index], &data[i], len - i);
200
201 return 0;
202}
203
204static int
205sha512_final(struct shash_desc *desc, u8 *hash)
206{
207 struct sha512_state *sctx = shash_desc_ctx(desc);
208 static u8 padding[128] = { 0x80, };
209 __be64 *dst = (__be64 *)hash;
210 __be64 bits[2];
211 unsigned int index, pad_len;
212 int i;
213
214 /* Save number of bits */
215 bits[1] = cpu_to_be64(sctx->count[0] << 3);
216 bits[0] = cpu_to_be64(sctx->count[1] << 3 | sctx->count[0] >> 61);
217
218 /* Pad out to 112 mod 128. */
219 index = sctx->count[0] & 0x7f;
220 pad_len = (index < 112) ? (112 - index) : ((128+112) - index);
221 sha512_update(desc, padding, pad_len);
222
223 /* Append length (before padding) */
224 sha512_update(desc, (const u8 *)bits, sizeof(bits));
225
226 /* Store state in digest */
227 for (i = 0; i < 8; i++)
228 dst[i] = cpu_to_be64(sctx->state[i]);
229
230 /* Zeroize sensitive information. */
231 memset(sctx, 0, sizeof(struct sha512_state));
232
233 return 0;
234}
235
236static int sha384_final(struct shash_desc *desc, u8 *hash)
237{
238 u8 D[64];
239
240 sha512_final(desc, D);
241
242 memcpy(hash, D, 48);
243 memset(D, 0, 64);
244
245 return 0;
246}
247
248static struct shash_alg sha512 = {
249 .digestsize = SHA512_DIGEST_SIZE,
250 .init = sha512_init,
251 .update = sha512_update,
252 .final = sha512_final,
253 .descsize = sizeof(struct sha512_state),
254 .base = {
255 .cra_name = "sha512",
256 .cra_flags = CRYPTO_ALG_TYPE_SHASH,
257 .cra_blocksize = SHA512_BLOCK_SIZE,
258 .cra_module = THIS_MODULE,
259 }
260};
261
262static struct shash_alg sha384 = {
263 .digestsize = SHA384_DIGEST_SIZE,
264 .init = sha384_init,
265 .update = sha512_update,
266 .final = sha384_final,
267 .descsize = sizeof(struct sha512_state),
268 .base = {
269 .cra_name = "sha384",
270 .cra_flags = CRYPTO_ALG_TYPE_SHASH,
271 .cra_blocksize = SHA384_BLOCK_SIZE,
272 .cra_module = THIS_MODULE,
273 }
274};
275
276static int __init sha512_generic_mod_init(void)
277{
278 int ret = 0;
279
280 if ((ret = crypto_register_shash(&sha384)) < 0)
281 goto out;
282 if ((ret = crypto_register_shash(&sha512)) < 0)
283 crypto_unregister_shash(&sha384);
284out:
285 return ret;
286}
287
288static void __exit sha512_generic_mod_fini(void)
289{
290 crypto_unregister_shash(&sha384);
291 crypto_unregister_shash(&sha512);
292}
293
294module_init(sha512_generic_mod_init);
295module_exit(sha512_generic_mod_fini);
296
297MODULE_LICENSE("GPL");
298MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms");
299
300MODULE_ALIAS("sha384");
301MODULE_ALIAS("sha512");