You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
83 lines
3.2 KiB
83 lines
3.2 KiB
4 months ago
|
/*
|
||
|
|
Implementation by the Keccak, Keyak and Ketje Teams, namely, Guido Bertoni,
|
||
|
|
Joan Daemen, Michaël Peeters, Gilles Van Assche and Ronny Van Keer, hereby
|
||
|
|
denoted as "the implementer".
|
||
|
|
|
||
|
|
For more information, feedback or questions, please refer to our websites:
|
||
|
|
http://keccak.noekeon.org/
|
||
|
|
http://keyak.noekeon.org/
|
||
|
|
http://ketje.noekeon.org/
|
||
|
|
|
||
|
|
To the extent possible under law, the implementer has waived all copyright
|
||
|
|
and related or neighboring rights to the source code in this file.
|
||
|
|
http://creativecommons.org/publicdomain/zero/1.0/
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <string.h>
|
||
|
|
#include "KeccakHash.h"
|
||
|
|
|
||
|
|
/* ---------------------------------------------------------------- */
|
||
|
|
|
||
|
|
HashReturn Keccak_HashInitialize(Keccak_HashInstance *instance, unsigned int rate, unsigned int capacity, unsigned int hashbitlen, unsigned char delimitedSuffix)
|
||
|
|
{
|
||
|
|
HashReturn result;
|
||
|
|
|
||
|
|
if (delimitedSuffix == 0)
|
||
|
|
return FAIL;
|
||
|
|
result = (HashReturn)KeccakWidth1600_SpongeInitialize(&instance->sponge, rate, capacity);
|
||
|
|
if (result != SUCCESS)
|
||
|
|
return result;
|
||
|
|
instance->fixedOutputLength = hashbitlen;
|
||
|
|
instance->delimitedSuffix = delimitedSuffix;
|
||
|
|
return SUCCESS;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* ---------------------------------------------------------------- */
|
||
|
|
|
||
|
|
HashReturn Keccak_HashUpdate(Keccak_HashInstance *instance, const BitSequence *data, DataLength databitlen)
|
||
|
|
{
|
||
|
|
if ((databitlen % 8) == 0)
|
||
|
|
return (HashReturn)KeccakWidth1600_SpongeAbsorb(&instance->sponge, data, databitlen/8);
|
||
|
|
else {
|
||
|
|
HashReturn ret = (HashReturn)KeccakWidth1600_SpongeAbsorb(&instance->sponge, data, databitlen/8);
|
||
|
|
if (ret == SUCCESS) {
|
||
|
|
/* The last partial byte is assumed to be aligned on the least significant bits */
|
||
|
|
|
||
|
|
unsigned char lastByte = data[databitlen/8];
|
||
|
|
/* Concatenate the last few bits provided here with those of the suffix */
|
||
|
|
|
||
|
|
unsigned short delimitedLastBytes = (unsigned short)((unsigned short)lastByte | ((unsigned short)instance->delimitedSuffix << (databitlen % 8)));
|
||
|
|
if ((delimitedLastBytes & 0xFF00) == 0x0000) {
|
||
|
|
instance->delimitedSuffix = delimitedLastBytes & 0xFF;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
unsigned char oneByte[1];
|
||
|
|
oneByte[0] = delimitedLastBytes & 0xFF;
|
||
|
|
ret = (HashReturn)KeccakWidth1600_SpongeAbsorb(&instance->sponge, oneByte, 1);
|
||
|
|
instance->delimitedSuffix = (delimitedLastBytes >> 8) & 0xFF;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* ---------------------------------------------------------------- */
|
||
|
|
|
||
|
|
HashReturn Keccak_HashFinal(Keccak_HashInstance *instance, BitSequence *hashval)
|
||
|
|
{
|
||
|
|
HashReturn ret = (HashReturn)KeccakWidth1600_SpongeAbsorbLastFewBits(&instance->sponge, instance->delimitedSuffix);
|
||
|
|
if (ret == SUCCESS)
|
||
|
|
return (HashReturn)KeccakWidth1600_SpongeSqueeze(&instance->sponge, hashval, instance->fixedOutputLength/8);
|
||
|
|
else
|
||
|
|
return ret;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* ---------------------------------------------------------------- */
|
||
|
|
|
||
|
|
HashReturn Keccak_HashSqueeze(Keccak_HashInstance *instance, BitSequence *data, DataLength databitlen)
|
||
|
|
{
|
||
|
|
if ((databitlen % 8) != 0)
|
||
|
|
return FAIL;
|
||
|
|
return (HashReturn)KeccakWidth1600_SpongeSqueeze(&instance->sponge, data, databitlen/8);
|
||
|
|
}
|