[mirror_ubuntu-artful-kernel.git] / crypto / sha512_generic.c

/* SHA-512 code by Jean-Luc Cooke <jlcooke@certainkey.com>
 *
 * Copyright (c) Jean-Luc Cooke <jlcooke@certainkey.com>
 * Copyright (c) Andrew McDonald <andrew@mcdonald.org.uk>
 * Copyright (c) 2003 Kyle McMartin <kyle@debian.org>
 *
 * 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>
#include <asm/unaligned.h>

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 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)       (ror64(x,28) ^ ror64(x,34) ^ ror64(x,39))
#define e1(x)       (ror64(x,14) ^ ror64(x,18) ^ ror64(x,41))
#define s0(x)       (ror64(x, 1) ^ ror64(x, 8) ^ (x >> 7))
#define s1(x)       (ror64(x,19) ^ ror64(x,61) ^ (x >> 6))

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

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

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

	int i;
	u64 W[16];

	/* 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) {
		if (!(i & 8)) {
			int j;

			if (i < 16) {
				/* load the input */
				for (j = 0; j < 16; j++)
					LOAD_OP(i + j, W, input);
			} else {
				for (j = 0; j < 16; j++) {
					BLEND_OP(i + j, W);
				}
			}
		}

		t1 = h + e1(e) + Ch(e,f,g) + sha512_K[i  ] + W[(i & 15)];
		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 & 15) + 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 & 15) + 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 & 15) + 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 & 15) + 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 & 15) + 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 & 15) + 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 & 15) + 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;
}

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;
}

int crypto_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) < 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;
}
EXPORT_SYMBOL(crypto_sha512_update);

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);
	crypto_sha512_update(desc, padding, pad_len);

	/* Append length (before padding) */
	crypto_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);
	memzero_explicit(D, 64);

	return 0;
}

static struct shash_alg sha512_algs[2] = { {
	.digestsize	=	SHA512_DIGEST_SIZE,
	.init		=	sha512_init,
	.update		=	crypto_sha512_update,
	.final		=	sha512_final,
	.descsize	=	sizeof(struct sha512_state),
	.base		=	{
		.cra_name	=	"sha512",
		.cra_driver_name =	"sha512-generic",
		.cra_flags	=	CRYPTO_ALG_TYPE_SHASH,
		.cra_blocksize	=	SHA512_BLOCK_SIZE,
		.cra_module	=	THIS_MODULE,
	}
}, {
	.digestsize	=	SHA384_DIGEST_SIZE,
	.init		=	sha384_init,
	.update		=	crypto_sha512_update,
	.final		=	sha384_final,
	.descsize	=	sizeof(struct sha512_state),
	.base		=	{
		.cra_name	=	"sha384",
		.cra_driver_name =	"sha384-generic",
		.cra_flags	=	CRYPTO_ALG_TYPE_SHASH,
		.cra_blocksize	=	SHA384_BLOCK_SIZE,
		.cra_module	=	THIS_MODULE,
	}
} };

static int __init sha512_generic_mod_init(void)
{
	return crypto_register_shashes(sha512_algs, ARRAY_SIZE(sha512_algs));
}

static void __exit sha512_generic_mod_fini(void)
{
	crypto_unregister_shashes(sha512_algs, ARRAY_SIZE(sha512_algs));
}

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_CRYPTO("sha384");
MODULE_ALIAS_CRYPTO("sha384-generic");
MODULE_ALIAS_CRYPTO("sha512");
MODULE_ALIAS_CRYPTO("sha512-generic");
Commit	Line	Data
1da177e4 LT	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	*/
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	22	#include <asm/byteorder.h>
be34c4ef	23	#include <asm/unaligned.h>
1da177e4	24
1da177e4 LT	25	static inline u64 Ch(u64 x, u64 y, u64 z)
	26	{
	27	return z ^ (x & (y ^ z));
	28	}
	29
	30	static inline u64 Maj(u64 x, u64 y, u64 z)
	31	{
	32	return (x & y) \| (z & (x \| y));
	33	}
	34
1da177e4 LT	35	static 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
f2ea0f5f AD	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))
1da177e4	69
1da177e4 LT	70	static inline void LOAD_OP(int I, u64 W, const u8 input)
1da177e4 LT	71	{
be34c4ef	72	W[I] = get_unaligned_be64((__u64 *)input + I);
1da177e4 LT	73	}
	74
	75	static inline void BLEND_OP(int I, u64 *W)
	76	{
58d7d18b	77	W[I & 15] += s1(W[(I-2) & 15]) + W[(I-7) & 15] + s0(W[(I-15) & 15]);
1da177e4 LT	78	}
	79
	80	static void
f9e2bca6	81	sha512_transform(u64 state, const u8 input)
1da177e4 LT	82	{
	83	u64 a, b, c, d, e, f, g, h, t1, t2;
	84
	85	int i;
51fc6dc8	86	u64 W[16];
1da177e4	87
1da177e4	88	/* load the state into our registers */
78f8b3a2 JG	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
3a92d687 HX	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;
1da177e4	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;
	131	}
	132
bd9d20db AKR	133	static int
bd9d20db AKR	134	sha512_init(struct shash_desc *desc)
1da177e4	135	{
1f38ad83	136	struct sha512_state *sctx = shash_desc_ctx(desc);
5265eeb2 JG	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;
13887ed6	145	sctx->count[0] = sctx->count[1] = 0;
bd9d20db AKR	146
bd9d20db AKR	147	return 0;
1da177e4 LT	148	}
1da177e4 LT	149
bd9d20db AKR	150	static int
bd9d20db AKR	151	sha384_init(struct shash_desc *desc)
1da177e4	152	{
1f38ad83	153	struct sha512_state *sctx = shash_desc_ctx(desc);
5265eeb2 JG	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;
13887ed6	162	sctx->count[0] = sctx->count[1] = 0;
bd9d20db AKR	163
bd9d20db AKR	164	return 0;
1da177e4 LT	165	}
1da177e4 LT	166
bf70fa9d TC	167	int crypto_sha512_update(struct shash_desc desc, const u8 data,
bf70fa9d TC	168	unsigned int len)
1da177e4	169	{
1f38ad83	170	struct sha512_state *sctx = shash_desc_ctx(desc);
1da177e4 LT	171
	172	unsigned int i, index, part_len;
	173
	174	/* Compute number of bytes mod 128 */
13887ed6 HX	175	index = sctx->count[0] & 0x7f;
	176
	177	/* Update number of bytes */
25c3d30c	178	if ((sctx->count[0] += len) < len)
13887ed6	179	sctx->count[1]++;
78f8b3a2	180
1da177e4	181	part_len = 128 - index;
78f8b3a2	182
1da177e4 LT	183	/* Transform as many times as possible. */
	184	if (len >= part_len) {
	185	memcpy(&sctx->buf[index], data, part_len);
f9e2bca6	186	sha512_transform(sctx->state, sctx->buf);
1da177e4 LT	187
1da177e4 LT	188	for (i = part_len; i + 127 < len; i+=128)
f9e2bca6	189	sha512_transform(sctx->state, &data[i]);
1da177e4 LT	190
	191	index = 0;
	192	} else {
	193	i = 0;
	194	}
	195
	196	/* Buffer remaining input */
	197	memcpy(&sctx->buf[index], &data[i], len - i);
bd9d20db AKR	198
bd9d20db AKR	199	return 0;
1da177e4	200	}
bf70fa9d	201	EXPORT_SYMBOL(crypto_sha512_update);
1da177e4	202
bd9d20db AKR	203	static int
bd9d20db AKR	204	sha512_final(struct shash_desc desc, u8 hash)
1da177e4	205	{
1f38ad83	206	struct sha512_state *sctx = shash_desc_ctx(desc);
1da177e4	207	static u8 padding[128] = { 0x80, };
06ace7a9	208	__be64 dst = (__be64 )hash;
13887ed6	209	__be64 bits[2];
1da177e4	210	unsigned int index, pad_len;
06ace7a9	211	int i;
1da177e4 LT	212
1da177e4 LT	213	/* Save number of bits */
13887ed6 HX	214	bits[1] = cpu_to_be64(sctx->count[0] << 3);
13887ed6 HX	215	bits[0] = cpu_to_be64(sctx->count[1] << 3 \| sctx->count[0] >> 61);
1da177e4 LT	216
1da177e4 LT	217	/* Pad out to 112 mod 128. */
13887ed6	218	index = sctx->count[0] & 0x7f;
1da177e4	219	pad_len = (index < 112) ? (112 - index) : ((128+112) - index);
bf70fa9d	220	crypto_sha512_update(desc, padding, pad_len);
1da177e4 LT	221
1da177e4 LT	222	/* Append length (before padding) */
bf70fa9d	223	crypto_sha512_update(desc, (const u8 *)bits, sizeof(bits));
1da177e4 LT	224
1da177e4 LT	225	/* Store state in digest */
06ace7a9 HX	226	for (i = 0; i < 8; i++)
	227	dst[i] = cpu_to_be64(sctx->state[i]);
	228
1da177e4	229	/* Zeroize sensitive information. */
1f38ad83	230	memset(sctx, 0, sizeof(struct sha512_state));
bd9d20db AKR	231
bd9d20db AKR	232	return 0;
1da177e4 LT	233	}
1da177e4 LT	234
bd9d20db	235	static int sha384_final(struct shash_desc desc, u8 hash)
1da177e4	236	{
bd9d20db	237	u8 D[64];
1da177e4	238
bd9d20db	239	sha512_final(desc, D);
1da177e4	240
bd9d20db	241	memcpy(hash, D, 48);
7185ad26	242	memzero_explicit(D, 64);
bd9d20db AKR	243
bd9d20db AKR	244	return 0;
1da177e4 LT	245	}
1da177e4 LT	246
648b2a10	247	static struct shash_alg sha512_algs[2] = { {
bd9d20db AKR	248	.digestsize = SHA512_DIGEST_SIZE,
bd9d20db AKR	249	.init = sha512_init,
bf70fa9d	250	.update = crypto_sha512_update,
bd9d20db	251	.final = sha512_final,
1f38ad83	252	.descsize = sizeof(struct sha512_state),
bd9d20db AKR	253	.base = {
bd9d20db AKR	254	.cra_name = "sha512",
d3295814	255	.cra_driver_name = "sha512-generic",
bd9d20db AKR	256	.cra_flags = CRYPTO_ALG_TYPE_SHASH,
	257	.cra_blocksize = SHA512_BLOCK_SIZE,
	258	.cra_module = THIS_MODULE,
	259	}
648b2a10	260	}, {
bd9d20db AKR	261	.digestsize = SHA384_DIGEST_SIZE,
bd9d20db AKR	262	.init = sha384_init,
bf70fa9d	263	.update = crypto_sha512_update,
bd9d20db	264	.final = sha384_final,
1f38ad83	265	.descsize = sizeof(struct sha512_state),
bd9d20db AKR	266	.base = {
bd9d20db AKR	267	.cra_name = "sha384",
d3295814	268	.cra_driver_name = "sha384-generic",
bd9d20db AKR	269	.cra_flags = CRYPTO_ALG_TYPE_SHASH,
	270	.cra_blocksize = SHA384_BLOCK_SIZE,
	271	.cra_module = THIS_MODULE,
	272	}
648b2a10	273	} };
1da177e4	274
3af5b90b	275	static int __init sha512_generic_mod_init(void)
1da177e4	276	{
648b2a10	277	return crypto_register_shashes(sha512_algs, ARRAY_SIZE(sha512_algs));
1da177e4 LT	278	}
1da177e4 LT	279
3af5b90b	280	static void __exit sha512_generic_mod_fini(void)
1da177e4	281	{
648b2a10	282	crypto_unregister_shashes(sha512_algs, ARRAY_SIZE(sha512_algs));
1da177e4 LT	283	}
1da177e4 LT	284
3af5b90b KB	285	module_init(sha512_generic_mod_init);
3af5b90b KB	286	module_exit(sha512_generic_mod_fini);
1da177e4 LT	287
	288	MODULE_LICENSE("GPL");
	289	MODULE_DESCRIPTION("SHA-512 and SHA-384 Secure Hash Algorithms");
78f8b3a2	290
5d26a105	291	MODULE_ALIAS_CRYPTO("sha384");
3e14dcf7	292	MODULE_ALIAS_CRYPTO("sha384-generic");
5d26a105	293	MODULE_ALIAS_CRYPTO("sha512");
3e14dcf7	294	MODULE_ALIAS_CRYPTO("sha512-generic");