1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
/*
* Keccak
* (C) 2010,2016 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include <botan/keccak.h>
#include <botan/sha3.h>
#include <botan/exceptn.h>
namespace Botan {
std::unique_ptr<HashFunction> Keccak_1600::copy_state() const
{
return std::unique_ptr<HashFunction>(new Keccak_1600(*this));
}
Keccak_1600::Keccak_1600(size_t output_bits) :
m_output_bits(output_bits),
m_bitrate(1600 - 2*output_bits),
m_S(25),
m_S_pos(0)
{
// We only support the parameters for the SHA-3 proposal
if(output_bits != 224 && output_bits != 256 &&
output_bits != 384 && output_bits != 512)
throw Invalid_Argument("Keccak_1600: Invalid output length " +
std::to_string(output_bits));
}
std::string Keccak_1600::name() const
{
return "Keccak-1600(" + std::to_string(m_output_bits) + ")";
}
HashFunction* Keccak_1600::clone() const
{
return new Keccak_1600(m_output_bits);
}
void Keccak_1600::clear()
{
zeroise(m_S);
m_S_pos = 0;
}
void Keccak_1600::add_data(const uint8_t input[], size_t length)
{
m_S_pos = SHA_3::absorb(m_bitrate, m_S, m_S_pos, input, length);
}
void Keccak_1600::final_result(uint8_t output[])
{
SHA_3::finish(m_bitrate, m_S, m_S_pos, 0x01, 0x80);
/*
* We never have to run the permutation again because we only support
* limited output lengths
*/
for(size_t i = 0; i != m_output_bits/8; ++i)
output[i] = get_byte(7 - (i % 8), m_S[i/8]);
clear();
}
}
|
