Coverage Report

Created: 2026-03-11 06:24

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/botan/src/lib/hash/keccak/keccak.cpp
Line
Count
Source
1
/*
2
* Keccak
3
* (C) 2010,2016 Jack Lloyd
4
*
5
* Botan is released under the Simplified BSD License (see license.txt)
6
*/
7
8
#include <botan/internal/keccak.h>
9
10
#include <botan/exceptn.h>
11
#include <botan/internal/fmt.h>
12
13
namespace Botan {
14
15
0
std::unique_ptr<HashFunction> Keccak_1600::copy_state() const {
16
0
   return std::make_unique<Keccak_1600>(*this);
17
0
}
18
19
Keccak_1600::Keccak_1600(size_t output_bits) :
20
0
      m_keccak({.capacity_bits = 2 * output_bits, .padding = KeccakPadding::keccak1600()}),
21
0
      m_output_length(output_bits / 8) {
22
   // We only support the parameters for the SHA-3 proposal
23
24
0
   if(output_bits != 224 && output_bits != 256 && output_bits != 384 && output_bits != 512) {
25
0
      throw Invalid_Argument(fmt("Keccak_1600: Invalid output length {}", output_bits));
26
0
   }
27
0
}
28
29
0
std::string Keccak_1600::name() const {
30
0
   return fmt("Keccak-1600({})", m_output_length * 8);
31
0
}
32
33
0
std::unique_ptr<HashFunction> Keccak_1600::new_object() const {
34
0
   return std::make_unique<Keccak_1600>(m_output_length * 8);
35
0
}
36
37
0
void Keccak_1600::clear() {
38
0
   m_keccak.clear();
39
0
}
40
41
0
std::string Keccak_1600::provider() const {
42
0
   return m_keccak.provider();
43
0
}
44
45
0
void Keccak_1600::add_data(std::span<const uint8_t> input) {
46
0
   m_keccak.absorb(input);
47
0
}
48
49
0
void Keccak_1600::final_result(std::span<uint8_t> output) {
50
0
   m_keccak.finish();
51
0
   m_keccak.squeeze(output);
52
0
   clear();
53
0
}
54
55
}  // namespace Botan