2008-03-06 04:50:20 -07:00
|
|
|
/*
|
|
|
|
* Cryptographic API.
|
|
|
|
*
|
|
|
|
* s390 generic implementation of the SHA Secure Hash Algorithms.
|
|
|
|
*
|
|
|
|
* Copyright IBM Corp. 2007
|
|
|
|
* Author(s): Jan Glauber (jang@de.ibm.com)
|
|
|
|
*
|
|
|
|
* 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 of the License, or (at your option)
|
|
|
|
* any later version.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2009-01-18 02:33:33 -07:00
|
|
|
#include <crypto/internal/hash.h>
|
2008-03-06 04:50:20 -07:00
|
|
|
#include "sha.h"
|
|
|
|
#include "crypt_s390.h"
|
|
|
|
|
2009-01-18 02:33:33 -07:00
|
|
|
int s390_sha_update(struct shash_desc *desc, const u8 *data, unsigned int len)
|
2008-03-06 04:50:20 -07:00
|
|
|
{
|
2009-01-18 02:33:33 -07:00
|
|
|
struct s390_sha_ctx *ctx = shash_desc_ctx(desc);
|
|
|
|
unsigned int bsize = crypto_shash_blocksize(desc->tfm);
|
2008-03-06 04:50:20 -07:00
|
|
|
unsigned int index;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
/* how much is already in the buffer? */
|
|
|
|
index = ctx->count & (bsize - 1);
|
|
|
|
ctx->count += len;
|
|
|
|
|
|
|
|
if ((index + len) < bsize)
|
|
|
|
goto store;
|
|
|
|
|
|
|
|
/* process one stored block */
|
|
|
|
if (index) {
|
|
|
|
memcpy(ctx->buf + index, data, bsize - index);
|
|
|
|
ret = crypt_s390_kimd(ctx->func, ctx->state, ctx->buf, bsize);
|
|
|
|
BUG_ON(ret != bsize);
|
|
|
|
data += bsize - index;
|
|
|
|
len -= bsize - index;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* process as many blocks as possible */
|
|
|
|
if (len >= bsize) {
|
|
|
|
ret = crypt_s390_kimd(ctx->func, ctx->state, data,
|
|
|
|
len & ~(bsize - 1));
|
|
|
|
BUG_ON(ret != (len & ~(bsize - 1)));
|
|
|
|
data += ret;
|
|
|
|
len -= ret;
|
|
|
|
}
|
|
|
|
store:
|
|
|
|
if (len)
|
|
|
|
memcpy(ctx->buf + index , data, len);
|
2009-01-18 02:33:33 -07:00
|
|
|
|
|
|
|
return 0;
|
2008-03-06 04:50:20 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(s390_sha_update);
|
|
|
|
|
2009-01-18 02:33:33 -07:00
|
|
|
int s390_sha_final(struct shash_desc *desc, u8 *out)
|
2008-03-06 04:50:20 -07:00
|
|
|
{
|
2009-01-18 02:33:33 -07:00
|
|
|
struct s390_sha_ctx *ctx = shash_desc_ctx(desc);
|
|
|
|
unsigned int bsize = crypto_shash_blocksize(desc->tfm);
|
2008-03-06 04:50:20 -07:00
|
|
|
u64 bits;
|
2008-03-06 04:52:00 -07:00
|
|
|
unsigned int index, end, plen;
|
2008-03-06 04:50:20 -07:00
|
|
|
int ret;
|
|
|
|
|
2008-03-06 04:52:00 -07:00
|
|
|
/* SHA-512 uses 128 bit padding length */
|
|
|
|
plen = (bsize > SHA256_BLOCK_SIZE) ? 16 : 8;
|
|
|
|
|
2008-03-06 04:50:20 -07:00
|
|
|
/* must perform manual padding */
|
|
|
|
index = ctx->count & (bsize - 1);
|
2008-03-06 04:52:00 -07:00
|
|
|
end = (index < bsize - plen) ? bsize : (2 * bsize);
|
2008-03-06 04:50:20 -07:00
|
|
|
|
|
|
|
/* start pad with 1 */
|
|
|
|
ctx->buf[index] = 0x80;
|
|
|
|
index++;
|
|
|
|
|
|
|
|
/* pad with zeros */
|
|
|
|
memset(ctx->buf + index, 0x00, end - index - 8);
|
|
|
|
|
2008-03-06 04:52:00 -07:00
|
|
|
/*
|
2010-01-29 00:57:49 -07:00
|
|
|
* Append message length. Well, SHA-512 wants a 128 bit length value,
|
2008-03-06 04:52:00 -07:00
|
|
|
* nevertheless we use u64, should be enough for now...
|
|
|
|
*/
|
2008-03-06 04:50:20 -07:00
|
|
|
bits = ctx->count * 8;
|
|
|
|
memcpy(ctx->buf + end - 8, &bits, sizeof(bits));
|
|
|
|
|
|
|
|
ret = crypt_s390_kimd(ctx->func, ctx->state, ctx->buf, end);
|
|
|
|
BUG_ON(ret != end);
|
|
|
|
|
|
|
|
/* copy digest to out */
|
2009-01-18 02:33:33 -07:00
|
|
|
memcpy(out, ctx->state, crypto_shash_digestsize(desc->tfm));
|
2008-03-06 04:50:20 -07:00
|
|
|
/* wipe context */
|
|
|
|
memset(ctx, 0, sizeof *ctx);
|
2009-01-18 02:33:33 -07:00
|
|
|
|
|
|
|
return 0;
|
2008-03-06 04:50:20 -07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(s390_sha_final);
|
|
|
|
|
|
|
|
MODULE_LICENSE("GPL");
|
|
|
|
MODULE_DESCRIPTION("s390 SHA cipher common functions");
|