2023-06-07 05:58:01 +00:00
|
|
|
/* LibTomCrypt, modular cryptographic library -- Tom St Denis */
|
|
|
|
/* SPDX-License-Identifier: Unlicense */
|
|
|
|
#include "tomcrypt_private.h"
|
2018-09-24 18:07:34 +00:00
|
|
|
|
2023-06-07 05:58:01 +00:00
|
|
|
#ifdef LTC_HASH_HELPERS
|
2018-09-24 18:07:34 +00:00
|
|
|
/**
|
|
|
|
@file hash_memory.c
|
|
|
|
Hash memory helper, Tom St Denis
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
Hash a block of memory and store the digest.
|
|
|
|
@param hash The index of the hash you wish to use
|
|
|
|
@param in The data you wish to hash
|
|
|
|
@param inlen The length of the data to hash (octets)
|
|
|
|
@param out [out] Where to store the digest
|
|
|
|
@param outlen [in/out] Max size and resulting size of the digest
|
|
|
|
@return CRYPT_OK if successful
|
|
|
|
*/
|
|
|
|
int hash_memory(int hash, const unsigned char *in, unsigned long inlen, unsigned char *out, unsigned long *outlen)
|
|
|
|
{
|
|
|
|
hash_state *md;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
LTC_ARGCHK(in != NULL);
|
|
|
|
LTC_ARGCHK(out != NULL);
|
|
|
|
LTC_ARGCHK(outlen != NULL);
|
|
|
|
|
|
|
|
if ((err = hash_is_valid(hash)) != CRYPT_OK) {
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (*outlen < hash_descriptor[hash].hashsize) {
|
|
|
|
*outlen = hash_descriptor[hash].hashsize;
|
|
|
|
return CRYPT_BUFFER_OVERFLOW;
|
|
|
|
}
|
|
|
|
|
|
|
|
md = XMALLOC(sizeof(hash_state));
|
|
|
|
if (md == NULL) {
|
|
|
|
return CRYPT_MEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((err = hash_descriptor[hash].init(md)) != CRYPT_OK) {
|
|
|
|
goto LBL_ERR;
|
|
|
|
}
|
|
|
|
if ((err = hash_descriptor[hash].process(md, in, inlen)) != CRYPT_OK) {
|
|
|
|
goto LBL_ERR;
|
|
|
|
}
|
|
|
|
err = hash_descriptor[hash].done(md, out);
|
|
|
|
*outlen = hash_descriptor[hash].hashsize;
|
|
|
|
LBL_ERR:
|
|
|
|
#ifdef LTC_CLEAN_STACK
|
|
|
|
zeromem(md, sizeof(hash_state));
|
|
|
|
#endif
|
|
|
|
XFREE(md);
|
|
|
|
|
|
|
|
return err;
|
|
|
|
}
|
2023-06-07 05:58:01 +00:00
|
|
|
#endif /* #ifdef LTC_HASH_HELPERS */
|