int Duplexing(duplexState *state, const unsigned char *in, unsigned int inBitLen, unsigned char *out, unsigned int outBitLen, unsigned int rounds)
{
KECCAK_ALIGN unsigned char block[KeccakPermutationSizeInBytes];
if (inBitLen > state->rho_max)
return 1;
if ((inBitLen % 8) != 0) {
unsigned char mask = ~((1 << (inBitLen % 8)) - 1);
if ((in[inBitLen/8] & mask) != 0)
return 1; // The bits of the last incomplete byte must be aligned on the LSB
}
if (outBitLen > state->rate)
return 1; // The output length must not be greater than the rate
memcpy(block, in, (inBitLen+7)/8);
memset(block+(inBitLen+7)/8, 0, ((state->rate+63)/64)*8 - (inBitLen+7)/8);
block[inBitLen/8] |= 1 << (inBitLen%8);
block[(state->rate-1)/8] |= 1 << ((state->rate-1) % 8);
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed (after padding)", block, (state->rate+7)/8);
#endif
KeccakAbsorb(state->state, block, (state->rate+63)/64, rounds);
KeccakExtract(state->state, block, (state->rate+63)/64);
memcpy(out, block, (outBitLen+7)/8);
if ((outBitLen % 8) != 0) {
unsigned char mask = (1 << (outBitLen % 8)) - 1;
out[outBitLen/8] &= mask;
}
return 0;
}
static void PadAndSwitchToSqueezingPhase(spongeState *state)
{
// Note: the bits are numbered from 0=LSB to 7=MSB
if (state->bitsInQueue + 1 == state->rate) {
state->dataQueue[state->bitsInQueue/8 ] |= 1 << (state->bitsInQueue % 8);
AbsorbQueue(state);
memset(state->dataQueue, 0, state->rate/8);
}
else {
memset(state->dataQueue + (state->bitsInQueue+7)/8, 0, state->rate/8 - (state->bitsInQueue+7)/8);
state->dataQueue[state->bitsInQueue/8 ] |= 1 << (state->bitsInQueue % 8);
}
state->dataQueue[(state->rate-1)/8] |= 1 << ((state->rate-1) % 8);
AbsorbQueue(state);
#ifdef KeccakReference
displayText(1, "--- Switching to squeezing phase ---");
#endif
#ifdef ProvideFast1024
if (state->rate == 1024) {
KeccakExtract1024bits(state->state, state->dataQueue);
state->bitsAvailableForSqueezing = 1024;
}
else
#endif
{
KeccakExtract(state->state, state->dataQueue, state->rate/64);
state->bitsAvailableForSqueezing = state->rate;
}
#ifdef KeccakReference
displayBytes(1, "Block available for squeezing", state->dataQueue, state->bitsAvailableForSqueezing/8);
#endif
state->squeezing = 1;
}
void displayDuplexIntermediateValuesOne(FILE *f, unsigned int rate, unsigned int capacity)
{
Keccak_DuplexInstance duplex;
unsigned char input[512];
unsigned int inBitLen;
unsigned char output[512];
unsigned int outBitLen;
unsigned int i, j;
const unsigned int M = 239*251;
unsigned int x = 33;
Keccak_DuplexInitialize(&duplex, rate, capacity);
displayStateAsBytes(1, "Initial state", duplex.state);
for(i=0; i<=rate+120; i+=123) {
inBitLen = i;
if (inBitLen > (rate-2)) inBitLen = rate-2;
memset(input, 0, 512);
for(j=0; j<inBitLen; j++) {
x = (x*x) % M;
if ((x % 2) != 0)
input[j/8] |= 1 << (j%8);
}
{
char text[100];
sprintf(text, "Input (%d bits)", inBitLen);
displayBytes(1, text, input, (inBitLen+7)/8);
}
outBitLen = rate;
if ((inBitLen%8) == 0)
Keccak_Duplexing(&duplex, input, inBitLen/8, output, (outBitLen+7)/8, 0x01);
else
Keccak_Duplexing(&duplex, input, inBitLen/8, output, (outBitLen+7)/8, input[inBitLen/8] | (1 << (inBitLen%8)));
{
char text[100];
sprintf(text, "Output (%d bits)", outBitLen);
displayBytes(1, text, output, (outBitLen+7)/8);
}
}
}
size_t SnP_FBWL_Absorb_Default(void *state, unsigned int laneCount, const unsigned char *data, size_t dataByteLen, unsigned char trailingBits)
{
size_t processed = 0;
while(dataByteLen >= laneCount*SnP_laneLengthInBytes) {
#ifdef KeccakReference
if (trailingBits == 0)
displayBytes(1, "Block to be absorbed", data, laneCount*SnP_laneLengthInBytes);
else {
displayBytes(1, "Block to be absorbed (part)", data, laneCount*SnP_laneLengthInBytes);
displayBytes(1, "Block to be absorbed (trailing bits)", &trailingBits, 1);
}
#endif
SnP_XORBytes(state, data, 0, laneCount*SnP_laneLengthInBytes);
SnP_XORBytes(state, &trailingBits, laneCount*SnP_laneLengthInBytes, 1);
SnP_Permute(state);
data += laneCount*SnP_laneLengthInBytes;
dataByteLen -= laneCount*SnP_laneLengthInBytes;
processed += laneCount*SnP_laneLengthInBytes;
}
return processed;
}
int Keccak_SpongeAbsorbLastFewBits(Keccak_SpongeInstance *instance, unsigned char delimitedData)
{
unsigned char delimitedData1[8]; // allocate 8 bytes (instead of 1) to make ASan happy
unsigned int rateInBytes = instance->rate/8;
if (delimitedData == 0)
return 1;
if (instance->squeezing)
return 1; // Too late for additional input
delimitedData1[0] = delimitedData;
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed (last few bits + first bit of padding)", delimitedData1, 1);
#endif
// Last few bits, whose delimiter coincides with first bit of padding
KeccakF1600_StateXORBytesInLane(instance->state, instance->byteIOIndex/KeccakF_laneInBytes,
delimitedData1, instance->byteIOIndex%KeccakF_laneInBytes, 1);
// If the first bit of padding is at position rate-1, we need a whole new block for the second bit of padding
if ((delimitedData >= 0x80) && (instance->byteIOIndex == (rateInBytes-1)))
KeccakF1600_StatePermute(instance->state);
// Second bit of padding
KeccakF1600_StateComplementBit(instance->state, rateInBytes*8-1);
#ifdef KeccakReference
{
unsigned char block[KeccakF_width/8];
memset(block, 0, KeccakF_width/8);
block[rateInBytes-1] = 0x80;
displayBytes(1, "Second bit of padding", block, rateInBytes);
}
#endif
KeccakF1600_StatePermute(instance->state);
instance->byteIOIndex = 0;
instance->squeezing = 1;
#ifdef KeccakReference
displayText(1, "--- Switching to squeezing phase ---");
#endif
return 0;
}
void displaySpongeIntermediateValuesOne(const unsigned char *message, unsigned int messageLength, unsigned int rate, unsigned int capacity)
{
Keccak_SpongeInstance sponge;
unsigned char output[512];
unsigned char *messageInternal;
messageInternal = malloc((messageLength+7)/8);
alignLastByteOnLSB(message, messageInternal, messageLength);
displayBytes(1, "Input message (last byte aligned on MSB)", message, (messageLength+7)/8);
displayBits(2, "Input message (in bits)", message, messageLength, 1);
displayBits(2, "Input message (in bits, after the formal bit reordering)", messageInternal, messageLength, 0);
displayBytes(2, "Input message (last byte aligned on LSB)", messageInternal, (messageLength+7)/8);
Keccak_SpongeInitialize(&sponge, rate, capacity);
displayStateAsBytes(1, "Initial state", sponge.state);
Keccak_SpongeAbsorb(&sponge, messageInternal, messageLength/8);
if ((messageLength % 8) != 0)
Keccak_SpongeAbsorbLastFewBits(&sponge, messageInternal[messageLength/8] | (1 << (messageLength % 8)));
Keccak_SpongeSqueeze(&sponge, output, sizeof(output));
free(messageInternal);
}
size_t SnP_FBWL_Squeeze_Default(void *state, unsigned int laneCount, unsigned char *data, size_t dataByteLen)
{
size_t processed = 0;
while(dataByteLen >= laneCount*SnP_laneLengthInBytes) {
SnP_Permute(state);
SnP_ExtractBytes(state, data, 0, laneCount*SnP_laneLengthInBytes);
#ifdef KeccakReference
displayBytes(1, "Squeezed block", data, laneCount*SnP_laneLengthInBytes);
#endif
data += laneCount*SnP_laneLengthInBytes;
dataByteLen -= laneCount*SnP_laneLengthInBytes;
processed += laneCount*SnP_laneLengthInBytes;
}
return processed;
}
void AbsorbQueue(hashState *state)
{
#ifdef KeccakReference
displayBytes(1, "Data to be absorbed", state->dataQueue, state->bitsInQueue/8);
#endif
// state->bitsInQueue is assumed to be equal a multiple of 8
memset(state->dataQueue+state->bitsInQueue/8, 0, state->rate/8-state->bitsInQueue/8);
#ifdef ProvideFast576
if (state->rate == 576)
KeccakAbsorb576bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast832
if (state->rate == 832)
KeccakAbsorb832bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast1024
if (state->rate == 1024)
KeccakAbsorb1024bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast1088
if (state->rate == 1088)
KeccakAbsorb1088bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast1152
if (state->rate == 1152)
KeccakAbsorb1152bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast1344
if (state->rate == 1344)
KeccakAbsorb1344bits(state->state, state->dataQueue);
else
#endif
KeccakAbsorb(state->state, state->dataQueue, state->rate/64);
state->bitsInQueue = 0;
}
static void AbsorbQueue(spongeState *state)
{
// state->bitsInQueue is assumed to be equal to state->rate
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed", state->dataQueue, state->rate/8);
#endif
#ifdef ProvideFast576
if (state->rate == 576)
KeccakAbsorb576bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast832
if (state->rate == 832)
KeccakAbsorb832bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast1024
if (state->rate == 1024)
KeccakAbsorb1024bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast1088
if (state->rate == 1088)
KeccakAbsorb1088bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast1152
if (state->rate == 1152)
KeccakAbsorb1152bits(state->state, state->dataQueue);
else
#endif
#ifdef ProvideFast1344
if (state->rate == 1344)
KeccakAbsorb1344bits(state->state, state->dataQueue);
else
#endif
KeccakAbsorb(state->state, state->dataQueue, state->rate/64);
state->bitsInQueue = 0;
}
static int Squeeze(spongeState *state, unsigned char *output, unsigned long long outputLength)
{
unsigned long long i;
unsigned int partialBlock;
if (!state->squeezing)
PadAndSwitchToSqueezingPhase(state);
if ((outputLength % 8) != 0)
return 1; // Only multiple of 8 bits are allowed, truncation can be done at user level
i = 0;
while(i < outputLength) {
if (state->bitsAvailableForSqueezing == 0) {
KeccakPermutation(state->state);
#ifdef ProvideFast1024
if (state->rate == 1024) {
KeccakExtract1024bits(state->state, state->dataQueue);
state->bitsAvailableForSqueezing = 1024;
}
else
#endif
{
KeccakExtract(state->state, state->dataQueue, state->rate/64);
state->bitsAvailableForSqueezing = state->rate;
}
#ifdef KeccakReference
displayBytes(1, "Block available for squeezing", state->dataQueue, state->bitsAvailableForSqueezing/8);
#endif
}
partialBlock = state->bitsAvailableForSqueezing;
if ((unsigned long long)partialBlock > outputLength - i)
partialBlock = (unsigned int)(outputLength - i);
memcpy(output+i/8, state->dataQueue+(state->rate-state->bitsAvailableForSqueezing)/8, partialBlock/8);
state->bitsAvailableForSqueezing -= partialBlock;
i += partialBlock;
}
return 0;
}
static int Absorb(spongeState *state, const unsigned char *data, unsigned long long databitlen)
{
unsigned long long i, j, wholeBlocks;
unsigned int partialBlock, partialByte;
const unsigned char *curData;
if ((state->bitsInQueue % 8) != 0)
return 1; // Only the last call may contain a partial byte
if (state->squeezing)
return 1; // Too late for additional input
i = 0;
while(i < databitlen) {
if ((state->bitsInQueue == 0) && (databitlen >= state->rate) && (i <= (databitlen-state->rate))) {
wholeBlocks = (databitlen-i)/state->rate;
curData = data+i/8;
#ifdef ProvideFast576
if (state->rate == 576) {
for(j=0; j<wholeBlocks; j++, curData+=576/8) {
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb576bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast832
if (state->rate == 832) {
for(j=0; j<wholeBlocks; j++, curData+=832/8) {
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb832bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast1024
if (state->rate == 1024) {
for(j=0; j<wholeBlocks; j++, curData+=1024/8) {
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb1024bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast1088
if (state->rate == 1088) {
for(j=0; j<wholeBlocks; j++, curData+=1088/8) {
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb1088bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast1152
if (state->rate == 1152) {
for(j=0; j<wholeBlocks; j++, curData+=1152/8) {
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb1152bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast1344
if (state->rate == 1344) {
for(j=0; j<wholeBlocks; j++, curData+=1344/8) {
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb1344bits(state->state, curData);
}
}
else
#endif
{
for(j=0; j<wholeBlocks; j++, curData+=state->rate/8) {
#ifdef KeccakReference
displayBytes(1, "Block to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb(state->state, curData, state->rate/64);
}
}
i += wholeBlocks*state->rate;
}
else {
partialBlock = (unsigned int)(databitlen - i);
if (partialBlock+state->bitsInQueue > state->rate)
partialBlock = state->rate-state->bitsInQueue;
partialByte = partialBlock % 8;
partialBlock -= partialByte;
memcpy(state->dataQueue+state->bitsInQueue/8, data+i/8, partialBlock/8);
state->bitsInQueue += partialBlock;
i += partialBlock;
if (state->bitsInQueue == state->rate)
AbsorbQueue(state);
if (partialByte > 0) {
unsigned char mask = (1 << partialByte)-1;
state->dataQueue[state->bitsInQueue/8] = data[i/8] & mask;
state->bitsInQueue += partialByte;
i += partialByte;
}
}
}
return 0;
}
int Keccak_SpongeSqueeze(Keccak_SpongeInstance *instance, unsigned char *data, unsigned long long dataByteLen)
{
unsigned long long i, j;
unsigned int partialBlock;
unsigned int rateInBytes = instance->rate/8;
unsigned char *curData;
if (!instance->squeezing)
Keccak_SpongeAbsorbLastFewBits(instance, 0x01);
i = 0;
curData = data;
while(i < dataByteLen) {
if ((instance->byteIOIndex == rateInBytes) && (dataByteLen >= (i + rateInBytes))) {
// fast lane: processing whole blocks first
for(j=dataByteLen-i; j>=rateInBytes; j-=rateInBytes) {
KeccakF1600_StateXORPermuteExtract(instance->state, 0, 0, curData, rateInBytes/KeccakF_laneInBytes);
if ((rateInBytes % KeccakF_laneInBytes) > 0)
KeccakF1600_StateExtractBytesInLane(instance->state, rateInBytes/KeccakF_laneInBytes,
curData+(rateInBytes/KeccakF_laneInBytes)*KeccakF_laneInBytes, 0,
rateInBytes%KeccakF_laneInBytes);
#ifdef KeccakReference
displayBytes(1, "Squeezed block", curData, rateInBytes);
#endif
curData+=rateInBytes;
}
i = dataByteLen - j;
}
else {
// normal lane: using the message queue
if (instance->byteIOIndex == rateInBytes) {
KeccakF1600_StatePermute(instance->state);
instance->byteIOIndex = 0;
}
partialBlock = (unsigned int)(dataByteLen - i);
if (partialBlock+instance->byteIOIndex > rateInBytes)
partialBlock = rateInBytes-instance->byteIOIndex;
i += partialBlock;
if ((instance->byteIOIndex == 0) && (partialBlock >= KeccakF_laneInBytes)) {
KeccakF1600_StateExtractLanes(instance->state, curData, partialBlock/KeccakF_laneInBytes);
#ifdef KeccakReference
displayBytes(1, "Squeezed block (part)", curData, (partialBlock/KeccakF_laneInBytes)*KeccakF_laneInBytes);
#endif
curData += (partialBlock/KeccakF_laneInBytes)*KeccakF_laneInBytes;
instance->byteIOIndex += (partialBlock/KeccakF_laneInBytes)*KeccakF_laneInBytes;
partialBlock -= (partialBlock/KeccakF_laneInBytes)*KeccakF_laneInBytes;
}
while(partialBlock > 0) {
unsigned int offsetInLane = instance->byteIOIndex % KeccakF_laneInBytes;
unsigned int bytesInLane = KeccakF_laneInBytes-offsetInLane;
if (bytesInLane > partialBlock)
bytesInLane = partialBlock;
KeccakF1600_StateExtractBytesInLane(instance->state, instance->byteIOIndex/KeccakF_laneInBytes, curData, offsetInLane, bytesInLane);
#ifdef KeccakReference
displayBytes(1, "Squeezed block (part)", curData, bytesInLane);
#endif
curData += bytesInLane;
instance->byteIOIndex += bytesInLane;
partialBlock -= bytesInLane;
}
}
}
return 0;
}
int Keccak_Duplexing(Keccak_DuplexInstance *instance, const unsigned char *sigmaBegin, unsigned int sigmaBeginByteLen, unsigned char *Z, unsigned int ZByteLen, unsigned char delimitedSigmaEnd)
{
unsigned char delimitedSigmaEnd1[1];
const unsigned int rho_max = instance->rate - 2;
if (delimitedSigmaEnd == 0)
return 1;
if ((instance->byteInputIndex+sigmaBeginByteLen)*8 > rho_max)
return 1;
if (rho_max - sigmaBeginByteLen*8 < 7) {
unsigned int maxBitsInDelimitedSigmaEnd = rho_max - sigmaBeginByteLen*8;
if (delimitedSigmaEnd >= (1 << (maxBitsInDelimitedSigmaEnd+1)))
return 1;
}
if (ZByteLen > (instance->rate+7)/8)
return 1; // The output length must not be greater than the rate (rounded up to a byte)
delimitedSigmaEnd1[0] = delimitedSigmaEnd;
// Last few bits, whose delimiter coincides with first bit of padding
KeccakF_StateXORBytesInLane(instance->state, (instance->byteInputIndex+sigmaBeginByteLen)/KeccakF_laneInBytes,
delimitedSigmaEnd1, (instance->byteInputIndex+sigmaBeginByteLen)%KeccakF_laneInBytes, 1);
// Second bit of padding
KeccakF_StateComplementBit(instance->state, instance->rate - 1);
if (instance->byteInputIndex > 0) {
int result = Keccak_DuplexingFeedPartialInput(instance, sigmaBegin, sigmaBeginByteLen);
if (result != 0)
return result;
KeccakF_StatePermute(instance->state);
KeccakF_StateExtractLanes(instance->state, Z, ZByteLen/KeccakF_laneInBytes);
}
else {
if ((sigmaBeginByteLen%KeccakF_laneInBytes) > 0) {
unsigned int offsetBeyondLane = (sigmaBeginByteLen/KeccakF_laneInBytes)*KeccakF_laneInBytes;
unsigned int beyondLaneBytes = sigmaBeginByteLen%KeccakF_laneInBytes;
KeccakF_StateXORBytesInLane(instance->state, sigmaBeginByteLen/KeccakF_laneInBytes,
sigmaBegin+offsetBeyondLane, 0, beyondLaneBytes);
}
#ifdef KeccakReference
{
unsigned char block[KeccakF_width/8];
memcpy(block, sigmaBegin, sigmaBeginByteLen);
block[sigmaBeginByteLen] = delimitedSigmaEnd;
memset(block+sigmaBeginByteLen+1, 0, ((instance->rate+63)/64)*8-sigmaBeginByteLen-1);
block[(instance->rate-1)/8] |= 1 << ((instance->rate-1) % 8);
displayBytes(1, "Block to be absorbed (after padding)", block, (instance->rate+7)/8);
}
#endif
KeccakF_StateXORPermuteExtract(instance->state, sigmaBegin, sigmaBeginByteLen/KeccakF_laneInBytes,
Z, ZByteLen/KeccakF_laneInBytes);
}
if ((ZByteLen%KeccakF_laneInBytes) > 0) {
unsigned int offsetBeyondLane = (ZByteLen/KeccakF_laneInBytes)*KeccakF_laneInBytes;
unsigned int beyondLaneBytes = ZByteLen%KeccakF_laneInBytes;
KeccakF_StateExtractBytesInLane(instance->state, ZByteLen/KeccakF_laneInBytes,
Z+offsetBeyondLane, 0, beyondLaneBytes);
}
if (ZByteLen*8 > instance->rate) {
unsigned char mask = (1 << (instance->rate % 8)) - 1;
Z[ZByteLen-1] &= mask;
}
instance->byteInputIndex = 0;
instance->byteOutputIndex = ZByteLen;
return 0;
}
HashReturn Update(hashState *state, const BitSequence *data, DataLength databitlen)
{
DataLength i, j;
DataLength partialBlock, partialByte, wholeBlocks;
BitSequence lastByte;
const BitSequence *curData;
if ((state->bitsInQueue % 8) != 0)
return FAIL; // Only the last call may contain a partial byte
if (state->squeezing)
return FAIL; // Too late for additional input
i = 0;
while(i < databitlen) {
if ((state->bitsInQueue == 0) && (databitlen >= state->rate) && (i <= (databitlen-state->rate))) {
wholeBlocks = (databitlen-i)/state->rate;
curData = data+i/8;
#ifdef ProvideFast576
if (state->rate == 576) {
for(j=0; j<wholeBlocks; j++, curData+=576/8) {
#ifdef KeccakReference
displayBytes(1, "Data to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb576bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast832
if (state->rate == 832) {
for(j=0; j<wholeBlocks; j++, curData+=832/8) {
#ifdef KeccakReference
displayBytes(1, "Data to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb832bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast1024
if (state->rate == 1024) {
for(j=0; j<wholeBlocks; j++, curData+=1024/8) {
#ifdef KeccakReference
displayBytes(1, "Data to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb1024bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast1088
if (state->rate == 1088) {
for(j=0; j<wholeBlocks; j++, curData+=1088/8) {
#ifdef KeccakReference
displayBytes(1, "Data to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb1088bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast1152
if (state->rate == 1152) {
for(j=0; j<wholeBlocks; j++, curData+=1152/8) {
#ifdef KeccakReference
displayBytes(1, "Data to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb1152bits(state->state, curData);
}
}
else
#endif
#ifdef ProvideFast1344
if (state->rate == 1344) {
for(j=0; j<wholeBlocks; j++, curData+=1344/8) {
#ifdef KeccakReference
displayBytes(1, "Data to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb1344bits(state->state, curData);
}
}
else
#endif
{
for(j=0; j<wholeBlocks; j++, curData+=state->rate/8) {
#ifdef KeccakReference
displayBytes(1, "Data to be absorbed", curData, state->rate/8);
#endif
KeccakAbsorb(state->state, curData, state->rate/64);
}
}
i += wholeBlocks*state->rate;
}
else {
partialBlock = databitlen - i;
if (partialBlock+state->bitsInQueue > state->rate)
partialBlock = state->rate-state->bitsInQueue;
partialByte = partialBlock % 8;
partialBlock -= partialByte;
memcpy(state->dataQueue+state->bitsInQueue/8, data+i/8, partialBlock/8);
state->bitsInQueue += partialBlock;
i += partialBlock;
if (state->bitsInQueue == state->rate)
AbsorbQueue(state);
if (partialByte > 0) {
// Align the last partial byte to the least significant bits
lastByte = data[i/8] >> (8-partialByte);
state->dataQueue[state->bitsInQueue/8] = lastByte;
state->bitsInQueue += partialByte;
i += partialByte;
}
}
}
