mirror of
https://github.com/VCMP-SqMod/SqMod.git
synced 2024-11-09 01:07:16 +01:00
35 lines
969 B
C
35 lines
969 B
C
|
/* whirlpool.h */
|
||
|
#ifndef WHIRLPOOL_H
|
||
|
#define WHIRLPOOL_H
|
||
|
#include "ustd.h"
|
||
|
|
||
|
#ifdef __cplusplus
|
||
|
extern "C" {
|
||
|
#endif
|
||
|
|
||
|
#define whirlpool_block_size 64
|
||
|
|
||
|
/* algorithm context */
|
||
|
typedef struct whirlpool_ctx
|
||
|
{
|
||
|
uint64_t hash[8]; /* 512-bit algorithm internal hashing state */
|
||
|
unsigned char message[whirlpool_block_size]; /* 512-bit buffer to hash */
|
||
|
|
||
|
/* Note: original algorith uses 256-bit counter, allowing to hash up to
|
||
|
2^256 bits sized message. For optimization we use here 64-bit counter,
|
||
|
thus reducing maximal message size to 2^64 bits = 2 Exbibytes = 2^21 TiB) */
|
||
|
uint64_t length; /* number of processed bytes */
|
||
|
} whirlpool_ctx;
|
||
|
|
||
|
/* hash functions */
|
||
|
|
||
|
void rhash_whirlpool_init(whirlpool_ctx* ctx);
|
||
|
void rhash_whirlpool_update(whirlpool_ctx* ctx, const unsigned char* msg, size_t size);
|
||
|
void rhash_whirlpool_final(whirlpool_ctx* ctx, unsigned char* result);
|
||
|
|
||
|
#ifdef __cplusplus
|
||
|
} /* extern "C" */
|
||
|
#endif /* __cplusplus */
|
||
|
|
||
|
#endif /* WHIRLPOOL_H */
|