[linux.git] / crypto / sha512_generic.c

/* SHA-512 code by Jean-Luc Cooke <[email protected]>
 *
 * Copyright (c) Jean-Luc Cooke <[email protected]>
 * Copyright (c) Andrew McDonald <[email protected]>
 * Copyright (c) 2003 Kyle McMartin <[email protected]>
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the
 * Free Software Foundation; either version 2, or (at your option) any
 * later version.
 *
 */
#include <crypto/internal/hash.h>
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/mm.h>
#include <linux/init.h>
#include <linux/crypto.h>
#include <linux/types.h>
#include <crypto/sha.h>
#include <linux/percpu.h>
#include <asm/byteorder.h>

static DEFINE_PER_CPU(u64[80], msg_schedule);

static inline u64 Ch(u64 x, u64 y, u64 z)
{
        return z ^ (x & (y ^ z));
}

static inline u64 Maj(u64 x, u64 y, u64 z)
{
        return (x & y) | (z & (x | y));
}

static inline u64 RORu64(u64 x, u64 y)
{
        return (x >> y) | (x << (64 - y));
}

static const u64 sha512_K[80] = {
        0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL,
        0xe9b5dba58189dbbcULL, 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
        0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL, 0xd807aa98a3030242ULL,
        0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
        0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL,
        0xc19bf174cf692694ULL, 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
        0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL, 0x2de92c6f592b0275ULL,
        0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
        0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL,
        0xbf597fc7beef0ee4ULL, 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
        0x06ca6351e003826fULL, 0x142929670a0e6e70ULL, 0x27b70a8546d22ffcULL,
        0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
        0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL,
        0x92722c851482353bULL, 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
        0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL, 0xd192e819d6ef5218ULL,
        0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
        0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL,
        0x34b0bcb5e19b48a8ULL, 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
        0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL, 0x748f82ee5defb2fcULL,
        0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
        0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL,
        0xc67178f2e372532bULL, 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
        0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL, 0x06f067aa72176fbaULL,
        0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
        0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL,
        0x431d67c49c100d4cULL, 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
        0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL,
};

#define e0(x)       (RORu64(x,28) ^ RORu64(x,34) ^ RORu64(x,39))
#define e1(x)       (RORu64(x,14) ^ RORu64(x,18) ^ RORu64(x,41))
#define s0(x)       (RORu64(x, 1) ^ RORu64(x, 8) ^ (x >> 7))
#define s1(x)       (RORu64(x,19) ^ RORu64(x,61) ^ (x >> 6))

static inline void LOAD_OP(int I, u64 *W, const u8 *input)
{
	W[I] = __be64_to_cpu( ((__be64*)(input))[I] );
}

static inline void BLEND_OP(int I, u64 *W)
{
	W[I] = s1(W[I-2]) + W[I-7] + s0(W[I-15]) + W[I-16];
}

static void
sha512_transform(u64 *state, const u8 *input)
{
	u64 a, b, c, d, e, f, g, h, t1, t2;

	int i;
	u64 *W = get_cpu_var(msg_schedule);

	/* load the input */
        for (i = 0; i < 16; i++)
                LOAD_OP(i, W, input);

        for (i = 16; i < 80; i++) {
                BLEND_OP(i, W);
        }

	/* load the state into our registers */
	a=state[0];   b=state[1];   c=state[2];   d=state[3];
	e=state[4];   f=state[5];   g=state[6];   h=state[7];

	/* now iterate */
	for (i=0; i<80; i+=8) {
		t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i  ] + W[i  ];
		t2 = e0(a) + Maj(a,b,c);    d+=t1;    h=t1+t2;
		t1 = g + e1(d) + Ch(d,e,f) + sha512_K[i+1] + W[i+1];
		t2 = e0(h) + Maj(h,a,b);    c+=t1;    g=t1+t2;
		t1 = f + e1(c) + Ch(c,d,e) + sha512_K[i+2] + W[i+2];
		t2 = e0(g) + Maj(g,h,a);    b+=t1;    f=t1+t2;
		t1 = e + e1(b) + Ch(b,c,d) + sha512_K[i+3] + W[i+3];
		t2 = e0(f) + Maj(f,g,h);    a+=t1;    e=t1+t2;
		t1 = d + e1(a) + Ch(a,b,c) + sha512_K[i+4] + W[i+4];
		t2 = e0(e) + Maj(e,f,g);    h+=t1;    d=t1+t2;
		t1 = c + e1(h) + Ch(h,a,b) + sha512_K[i+5] + W[i+5];
		t2 = e0(d) + Maj(d,e,f);    g+=t1;    c=t1+t2;
		t1 = b + e1(g) + Ch(g,h,a) + sha512_K[i+6] + W[i+6];
		t2 = e0(c) + Maj(c,d,e);    f+=t1;    b=t1+t2;
		t1 = a + e1(f) + Ch(f,g,h) + sha512_K[i+7] + W[i+7];
		t2 = e0(b) + Maj(b,c,d);    e+=t1;    a=t1+t2;
	}

	state[0] += a; state[1] += b; state[2] += c; state[3] += d;
	state[4] += e; state[5] += f; state[6] += g; state[7] += h;

	/* erase our data */
	a = b = c = d = e = f = g = h = t1 = t2 = 0;
	memset(W, 0, sizeof(__get_cpu_var(msg_schedule)));
	put_cpu_var(msg_schedule);
}

static int
sha512_init(struct shash_desc *desc)
{
	struct sha512_state *sctx = shash_desc_ctx(desc);
	sctx->state[0] = SHA512_H0;
	sctx->state[1] = SHA512_H1;
	sctx->state[2] = SHA512_H2;
	sctx->state[3] = SHA512_H3;
	sctx->state[4] = SHA512_H4;
	sctx->state[5] = SHA512_H5;
	sctx->state[6] = SHA512_H6;
	sctx->state[7] = SHA512_H7;
	sctx->count[0] = sctx->count[1] = 0;

	return 0;
}

static int
sha384_init(struct shash_desc *desc)
{
	struct sha512_state *sctx = shash_desc_ctx(desc);
	sctx->state[0] = SHA384_H0;
	sctx->state[1] = SHA384_H1;
	sctx->state[2] = SHA384_H2;
	sctx->state[3] = SHA384_H3;
	sctx->state[4] = SHA384_H4;
	sctx->state[5] = SHA384_H5;
	sctx->state[6] = SHA384_H6;
	sctx->state[7] = SHA384_H7;
	sctx->count[0] = sctx->count[1] = 0;

	return 0;
}

static int
sha512_update(struct shash_desc *desc, const u8 *data, unsigned int len)
{
	struct sha512_state *sctx = shash_desc_ctx(desc);

	unsigned int i, index, part_len;

	/* Compute number of bytes mod 128 */
	index = sctx->count[0] & 0x7f;

	/* Update number of bytes */
	if (!(sctx->count[0] += len))
		sctx->count[1]++;

        part_len = 128 - index;

	/* Transform as many times as possible. */
	if (len >= part_len) {
		memcpy(&sctx->buf[index], data, part_len);
		sha512_transform(sctx->state, sctx->buf);

		for (i = part_len; i + 127 < len; i+=128)
			sha512_transform(sctx->state, &data[i]);

		index = 0;
	} else {
		i = 0;
	}

	/* Buffer remaining input */
	memcpy(&sctx->buf[index], &data[i], len - i);

	return 0;
}

static int
sha512_final(struct shash_desc *desc, u8 *hash)
{
	struct sha512_state *sctx = shash_desc_ctx(desc);
        static u8 padding[128] = { 0x80, };
	__be64 *dst = (__be64 *)hash;
	__be64 bits[2];
	unsigned int index, pad_len;
	int i;

	/* Save number of bits */
	bits[1] = cpu_to_be64(sctx->count[0] << 3);
	bits[0] = cpu_to_be64(sctx->count[1] << 3 | sctx->count[0] >> 61);

	/* Pad out to 112 mod 128. */
	index = sctx->count[0] & 0x7f;
	pad_len = (index < 112) ? (112 - index) : ((128+112) - index);
	sha512_update(desc, padding, pad_len);

	/* Append length (before padding) */
	sha512_update(desc, (const u8 *)bits, sizeof(bits));

	/* Store state in digest */
	for (i = 0; i < 8; i++)
		dst[i] = cpu_to_be64(sctx->state[i]);

	/* Zeroize sensitive information. */
	memset(sctx, 0, sizeof(struct sha512_state));

	return 0;
}

static int sha384_final(struct shash_desc *desc, u8 *hash)
{
	u8 D[64];

	sha512_final(desc, D);

	memcpy(hash, D, 48);
	memset(D, 0, 64);

	return 0;
}

static struct shash_alg sha512 = {
	.digestsize	=	SHA512_DIGEST_SIZE,
	.init		=	sha512_init,
	.update		=	sha512_update,
	.final		=	sha512_final,
	.descsize	=	sizeof(struct sha512_state),
	.base		=	{
		.cra_name	=	"sha512",
		.cra_flags	=	CRYPTO_ALG_TYPE_SHASH,
		.cra_blocksize	=	SHA512_BLOCK_SIZE,
		.cra_module	=	THIS_MODULE,
	}
};

static struct shash_alg sha384 = {
	.digestsize	=	SHA384_DIGEST_SIZE,
	.init		=	sha384_init,
	.update		=	sha512_update,
	.final		=	sha384_final,
	.descsize	=	sizeof(struct sha512_state),
	.base		=	{
		.cra_name	=	"sha384",
		.cra_flags	=	CRYPTO_ALG_TYPE_SHASH,
		.cra_blocksize	=	SHA384_BLOCK_SIZE,
		.cra_module	=	THIS_MODULE,
	}
};

static int __init sha512_generic_mod_init(void)
{
        int ret = 0;

        if ((ret = crypto_register_shash(&sha384)) < 0)
                goto out;
        if ((ret = crypto_register_shash(&sha512)) < 0)
                crypto_unregister_shash(&sha384);
out:
        return ret;
}

static void __exit sha512_generic_mod_fini(void)
{
        crypto_unregister_shash(&sha384);
        crypto_unregister_shash(&sha512);
}

module_init(sha512_generic_mod_init);
module_exit(sha512_generic_mod_fini);

MODULE_LICENSE("GPL");
MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms");

MODULE_ALIAS("sha384");
MODULE_ALIAS("sha512");
Commit	Line	Data
1da177e4 LT	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	*/
bd9d20db	13	#include <crypto/internal/hash.h>
1da177e4 LT	14	#include <linux/kernel.h>
1da177e4 LT	15	#include <linux/module.h>
1da177e4 LT	16	#include <linux/mm.h>
	17	#include <linux/init.h>
	18	#include <linux/crypto.h>
06ace7a9	19	#include <linux/types.h>
5265eeb2	20	#include <crypto/sha.h>
f9e2bca6	21	#include <linux/percpu.h>
1da177e4 LT	22	#include <asm/byteorder.h>
1da177e4 LT	23
f9e2bca6 AKR	24	static DEFINE_PER_CPU(u64[80], msg_schedule);
f9e2bca6 AKR	25
1da177e4 LT	26	static inline u64 Ch(u64 x, u64 y, u64 z)
	27	{
	28	return z ^ (x & (y ^ z));
	29	}
	30
	31	static inline u64 Maj(u64 x, u64 y, u64 z)
	32	{
	33	return (x & y) \| (z & (x \| y));
	34	}
	35
	36	static inline u64 RORu64(u64 x, u64 y)
	37	{
	38	return (x >> y) \| (x << (64 - y));
	39	}
	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
	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
1da177e4 LT	76	static inline void LOAD_OP(int I, u64 W, const u8 input)
	77	{
	78	W[I] = __be64_to_cpu( ((__be64*)(input))[I] );
	79	}
	80
	81	static 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
	86	static void
f9e2bca6	87	sha512_transform(u64 state, const u8 input)
1da177e4 LT	88	{
	89	u64 a, b, c, d, e, f, g, h, t1, t2;
	90
	91	int i;
f9e2bca6	92	u64 *W = get_cpu_var(msg_schedule);
1da177e4 LT	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 */
78f8b3a2 JG	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
1da177e4 LT	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	}
78f8b3a2 JG	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;
1da177e4 LT	128
	129	/* erase our data */
	130	a = b = c = d = e = f = g = h = t1 = t2 = 0;
f9e2bca6 AKR	131	memset(W, 0, sizeof(__get_cpu_var(msg_schedule)));
f9e2bca6 AKR	132	put_cpu_var(msg_schedule);
1da177e4 LT	133	}
1da177e4 LT	134
bd9d20db AKR	135	static int
bd9d20db AKR	136	sha512_init(struct shash_desc *desc)
1da177e4	137	{
1f38ad83	138	struct sha512_state *sctx = shash_desc_ctx(desc);
5265eeb2 JG	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;
13887ed6	147	sctx->count[0] = sctx->count[1] = 0;
bd9d20db AKR	148
bd9d20db AKR	149	return 0;
1da177e4 LT	150	}
1da177e4 LT	151
bd9d20db AKR	152	static int
bd9d20db AKR	153	sha384_init(struct shash_desc *desc)
1da177e4	154	{
1f38ad83	155	struct sha512_state *sctx = shash_desc_ctx(desc);
5265eeb2 JG	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;
13887ed6	164	sctx->count[0] = sctx->count[1] = 0;
bd9d20db AKR	165
bd9d20db AKR	166	return 0;
1da177e4 LT	167	}
1da177e4 LT	168
bd9d20db AKR	169	static int
bd9d20db AKR	170	sha512_update(struct shash_desc desc, const u8 data, unsigned int len)
1da177e4	171	{
1f38ad83	172	struct sha512_state *sctx = shash_desc_ctx(desc);
1da177e4 LT	173
	174	unsigned int i, index, part_len;
	175
	176	/* Compute number of bytes mod 128 */
13887ed6 HX	177	index = sctx->count[0] & 0x7f;
	178
	179	/* Update number of bytes */
	180	if (!(sctx->count[0] += len))
	181	sctx->count[1]++;
78f8b3a2	182
1da177e4	183	part_len = 128 - index;
78f8b3a2	184
1da177e4 LT	185	/* Transform as many times as possible. */
	186	if (len >= part_len) {
	187	memcpy(&sctx->buf[index], data, part_len);
f9e2bca6	188	sha512_transform(sctx->state, sctx->buf);
1da177e4 LT	189
1da177e4 LT	190	for (i = part_len; i + 127 < len; i+=128)
f9e2bca6	191	sha512_transform(sctx->state, &data[i]);
1da177e4 LT	192
	193	index = 0;
	194	} else {
	195	i = 0;
	196	}
	197
	198	/* Buffer remaining input */
	199	memcpy(&sctx->buf[index], &data[i], len - i);
bd9d20db AKR	200
bd9d20db AKR	201	return 0;
1da177e4 LT	202	}
1da177e4 LT	203
bd9d20db AKR	204	static int
bd9d20db AKR	205	sha512_final(struct shash_desc desc, u8 hash)
1da177e4	206	{
1f38ad83	207	struct sha512_state *sctx = shash_desc_ctx(desc);
1da177e4	208	static u8 padding[128] = { 0x80, };
06ace7a9	209	__be64 dst = (__be64 )hash;
13887ed6	210	__be64 bits[2];
1da177e4	211	unsigned int index, pad_len;
06ace7a9	212	int i;
1da177e4 LT	213
1da177e4 LT	214	/* Save number of bits */
13887ed6 HX	215	bits[1] = cpu_to_be64(sctx->count[0] << 3);
13887ed6 HX	216	bits[0] = cpu_to_be64(sctx->count[1] << 3 \| sctx->count[0] >> 61);
1da177e4 LT	217
1da177e4 LT	218	/* Pad out to 112 mod 128. */
13887ed6	219	index = sctx->count[0] & 0x7f;
1da177e4	220	pad_len = (index < 112) ? (112 - index) : ((128+112) - index);
bd9d20db	221	sha512_update(desc, padding, pad_len);
1da177e4 LT	222
1da177e4 LT	223	/* Append length (before padding) */
bd9d20db	224	sha512_update(desc, (const u8 *)bits, sizeof(bits));
1da177e4 LT	225
1da177e4 LT	226	/* Store state in digest */
06ace7a9 HX	227	for (i = 0; i < 8; i++)
	228	dst[i] = cpu_to_be64(sctx->state[i]);
	229
1da177e4	230	/* Zeroize sensitive information. */
1f38ad83	231	memset(sctx, 0, sizeof(struct sha512_state));
bd9d20db AKR	232
bd9d20db AKR	233	return 0;
1da177e4 LT	234	}
1da177e4 LT	235
bd9d20db	236	static int sha384_final(struct shash_desc desc, u8 hash)
1da177e4	237	{
bd9d20db	238	u8 D[64];
1da177e4	239
bd9d20db	240	sha512_final(desc, D);
1da177e4	241
bd9d20db AKR	242	memcpy(hash, D, 48);
	243	memset(D, 0, 64);
	244
	245	return 0;
1da177e4 LT	246	}
1da177e4 LT	247
bd9d20db AKR	248	static struct shash_alg sha512 = {
	249	.digestsize = SHA512_DIGEST_SIZE,
	250	.init = sha512_init,
	251	.update = sha512_update,
	252	.final = sha512_final,
1f38ad83	253	.descsize = sizeof(struct sha512_state),
bd9d20db AKR	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	}
1da177e4 LT	260	};
1da177e4 LT	261
bd9d20db AKR	262	static struct shash_alg sha384 = {
	263	.digestsize = SHA384_DIGEST_SIZE,
	264	.init = sha384_init,
	265	.update = sha512_update,
	266	.final = sha384_final,
1f38ad83	267	.descsize = sizeof(struct sha512_state),
bd9d20db AKR	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	}
1da177e4 LT	274	};
1da177e4 LT	275
3af5b90b	276	static int __init sha512_generic_mod_init(void)
1da177e4 LT	277	{
	278	int ret = 0;
	279
bd9d20db	280	if ((ret = crypto_register_shash(&sha384)) < 0)
1da177e4	281	goto out;
bd9d20db AKR	282	if ((ret = crypto_register_shash(&sha512)) < 0)
bd9d20db AKR	283	crypto_unregister_shash(&sha384);
1da177e4 LT	284	out:
	285	return ret;
	286	}
	287
3af5b90b	288	static void __exit sha512_generic_mod_fini(void)
1da177e4	289	{
bd9d20db AKR	290	crypto_unregister_shash(&sha384);
bd9d20db AKR	291	crypto_unregister_shash(&sha512);
1da177e4 LT	292	}
1da177e4 LT	293
3af5b90b KB	294	module_init(sha512_generic_mod_init);
3af5b90b KB	295	module_exit(sha512_generic_mod_fini);
1da177e4 LT	296
	297	MODULE_LICENSE("GPL");
	298	MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms");
78f8b3a2 JG	299
	300	MODULE_ALIAS("sha384");
	301	MODULE_ALIAS("sha512");