Botan 3.11.0
Crypto and TLS for C&
ghash.cpp
Go to the documentation of this file.
1/*
2* GCM GHASH
3* (C) 2013,2015,2017 Jack Lloyd
4* (C) 2016 Daniel Neus, Rohde & Schwarz Cybersecurity
5* (C) 2024 René Meusel, Rohde & Schwarz Cybersecurity
6*
7* Botan is released under the Simplified BSD License (see license.txt)
8*/
9
10#include <botan/internal/ghash.h>
11
12#include <botan/internal/ct_utils.h>
13#include <botan/internal/loadstor.h>
14
15#if defined(BOTAN_HAS_CPUID)
16 #include <botan/internal/cpuid.h>
17#endif
18
19namespace Botan {
20
21std::string GHASH::provider() const {
22#if defined(BOTAN_HAS_GHASH_AVX512_CLMUL)
24 return *feat;
25 }
26#endif
27
28#if defined(BOTAN_HAS_GHASH_CLMUL_CPU)
29 if(auto feat = CPUID::check(CPUID::Feature::HW_CLMUL)) {
30 return *feat;
31 }
32#endif
33
34#if defined(BOTAN_HAS_GHASH_CLMUL_VPERM)
36 return *feat;
37 }
38#endif
39
40 return "base";
41}
42
43void GHASH::ghash_multiply(std::span<uint8_t, GCM_BS> x, std::span<const uint8_t> input, size_t blocks) {
44 BOTAN_ASSERT_NOMSG(input.size() % GCM_BS == 0);
45
46#if defined(BOTAN_HAS_GHASH_AVX512_CLMUL)
48 BOTAN_ASSERT_NOMSG(!m_H_pow.empty());
49 return ghash_multiply_avx512_clmul(x.data(), m_H_pow.data(), input.data(), blocks);
50 }
51#endif
52
53#if defined(BOTAN_HAS_GHASH_CLMUL_CPU)
55 BOTAN_ASSERT_NOMSG(!m_H_pow.empty());
56 return ghash_multiply_cpu(x.data(), m_H_pow, input.data(), blocks);
57 }
58#endif
59
60#if defined(BOTAN_HAS_GHASH_CLMUL_VPERM)
62 return ghash_multiply_vperm(x.data(), m_HM.data(), input.data(), blocks);
63 }
64#endif
65
66 auto scope = CT::scoped_poison(x);
67
69
70 BufferSlicer in(input);
71 for(size_t b = 0; b != blocks; ++b) {
72 const auto I = load_be<std::array<uint64_t, 2>>(in.take<GCM_BS>());
73 X[0] ^= I[0];
74 X[1] ^= I[1];
75
76 std::array<uint64_t, 2> Z{};
77
78 for(size_t i = 0; i != 64; ++i) {
79 const auto X0MASK = CT::Mask<uint64_t>::expand_top_bit(X[0]);
80 const auto X1MASK = CT::Mask<uint64_t>::expand_top_bit(X[1]);
81
82 X[0] <<= 1;
83 X[1] <<= 1;
84
85 Z[0] = X0MASK.select(Z[0] ^ m_HM[4 * i], Z[0]);
86 Z[1] = X0MASK.select(Z[1] ^ m_HM[4 * i + 1], Z[1]);
87
88 Z[0] = X1MASK.select(Z[0] ^ m_HM[4 * i + 2], Z[0]);
89 Z[1] = X1MASK.select(Z[1] ^ m_HM[4 * i + 3], Z[1]);
90 }
91
92 X[0] = Z[0];
93 X[1] = Z[1];
94 }
95
96 store_be(x, X);
97}
98
100 return !m_HM.empty() || !m_H_pow.empty();
101}
102
103void GHASH::key_schedule(std::span<const uint8_t> key) {
104 m_H_ad = {0};
105 m_ad_len = 0;
106 m_text_len = 0;
107
108 BOTAN_ASSERT_NOMSG(key.size() == GCM_BS);
109 auto H = load_be<std::array<uint64_t, 2>>(key.first<GCM_BS>());
110
111#if defined(BOTAN_HAS_GHASH_AVX512_CLMUL)
113 zap(m_HM);
114 if(m_H_pow.size() != 32) {
115 m_H_pow.resize(32);
116 }
117 ghash_precompute_avx512_clmul(key.data(), m_H_pow.data());
118 // m_HM left empty
119 return;
120 }
121#endif
122
123#if defined(BOTAN_HAS_GHASH_CLMUL_CPU)
125 zap(m_HM);
126 ghash_precompute_cpu(key.data(), m_H_pow);
127 // m_HM left empty
128 return;
129 }
130#endif
131
132 const uint64_t R = 0xE100000000000000;
133
134 if(m_HM.size() != 256) {
135 m_HM.resize(256);
136 }
137
138 // precompute the multiples of H
139 for(size_t i = 0; i != 2; ++i) {
140 for(size_t j = 0; j != 64; ++j) {
141 /*
142 we interleave H^1, H^65, H^2, H^66, H3, H67, H4, H68
143 to make indexing nicer in the multiplication code
144 */
145 m_HM[4 * j + 2 * i] = H[0];
146 m_HM[4 * j + 2 * i + 1] = H[1];
147
148 // GCM's bit ops are reversed so we carry out of the bottom
149 const uint64_t carry = CT::Mask<uint64_t>::expand(H[1] & 1).if_set_return(R);
150 H[1] = (H[1] >> 1) | (H[0] << 63);
151 H[0] = (H[0] >> 1) ^ carry;
152 }
153 }
154}
155
156void GHASH::start(std::span<const uint8_t> nonce) {
157 BOTAN_ARG_CHECK(nonce.size() == 16, "GHASH requires a 128-bit nonce");
158 auto& n = m_nonce.emplace();
159 copy_mem(n, nonce);
160 copy_mem(m_ghash, m_H_ad);
161}
162
163void GHASH::set_associated_data(std::span<const uint8_t> input) {
164 BOTAN_STATE_CHECK(!m_nonce);
165
167 m_H_ad = {0};
168 ghash_update(m_H_ad, input);
169 ghash_zeropad(m_H_ad);
170 m_ad_len = input.size();
171}
172
174 // This should only be called in GMAC context
175 BOTAN_STATE_CHECK(m_text_len == 0);
177 m_H_ad = {0};
178 m_ad_len = 0;
179}
180
181void GHASH::update_associated_data(std::span<const uint8_t> ad) {
183 ghash_update(m_ghash, ad);
184 m_ad_len += ad.size();
185}
186
187void GHASH::update(std::span<const uint8_t> input) {
189 BOTAN_STATE_CHECK(m_nonce);
190 ghash_update(m_ghash, input);
191 m_text_len += input.size();
192}
193
194void GHASH::final(std::span<uint8_t> mac) {
195 BOTAN_ARG_CHECK(!mac.empty() && mac.size() <= GCM_BS, "GHASH output length");
196 BOTAN_STATE_CHECK(m_nonce);
198
199 ghash_zeropad(m_ghash);
200 ghash_final_block(m_ghash, m_ad_len, m_text_len);
201
202 xor_buf(mac, std::span{m_ghash}.first(mac.size()), std::span{*m_nonce}.first(mac.size()));
203
204 secure_scrub_memory(m_ghash);
205 m_text_len = 0;
206 m_nonce.reset();
207}
208
209void GHASH::nonce_hash(std::span<uint8_t, GCM_BS> y0, std::span<const uint8_t> nonce) {
211 BOTAN_STATE_CHECK(!m_nonce);
212
213 ghash_update(y0, nonce);
214 ghash_zeropad(y0);
215 ghash_final_block(y0, 0, nonce.size());
216}
217
219 zap(m_HM);
220 zap(m_H_pow);
221 this->reset_state();
222}
223
225 m_H_ad = {0};
226 secure_scrub_memory(m_ghash);
227 if(m_nonce) {
228 secure_scrub_memory(m_nonce.value());
229 m_nonce.reset();
230 }
231 m_buffer.clear();
232 m_text_len = m_ad_len = 0;
233}
234
235void GHASH::ghash_update(std::span<uint8_t, GCM_BS> x, std::span<const uint8_t> input) {
236 BufferSlicer in(input);
237 while(!in.empty()) {
238 if(const auto one_block = m_buffer.handle_unaligned_data(in)) {
239 ghash_multiply(x, one_block.value(), 1);
240 }
241
242 if(m_buffer.in_alignment()) {
243 const auto [aligned_data, full_blocks] = m_buffer.aligned_data_to_process(in);
244 if(full_blocks > 0) {
245 ghash_multiply(x, aligned_data, full_blocks);
246 }
247 }
248 }
249 BOTAN_ASSERT_NOMSG(in.empty());
250}
251
252void GHASH::ghash_zeropad(std::span<uint8_t, GCM_BS> x) {
253 if(!m_buffer.in_alignment()) {
254 m_buffer.fill_up_with_zeros();
255 ghash_multiply(x, m_buffer.consume(), 1);
256 }
257}
258
259void GHASH::ghash_final_block(std::span<uint8_t, GCM_BS> x, uint64_t ad_len, uint64_t text_len) {
260 BOTAN_STATE_CHECK(m_buffer.in_alignment());
261 const auto final_block = store_be(8 * ad_len, 8 * text_len);
262 ghash_multiply(x, final_block, 1);
263}
264
265} // namespace Botan
#define BOTAN_ASSERT_NOMSG(expr)
Definition assert.h:75
#define BOTAN_STATE_CHECK(expr)
Definition assert.h:49
#define BOTAN_ARG_CHECK(expr, msg)
Definition assert.h:33
std::tuple< std::span< const uint8_t >, size_t > aligned_data_to_process(BufferSlicer &slicer) const
std::optional< std::span< const T > > handle_unaligned_data(BufferSlicer &slicer)
static std::optional< std::string > check(CPUID::Feature feat)
Definition cpuid.h:67
static bool has(CPUID::Feature feat)
Definition cpuid.h:94
static constexpr Mask< T > expand(T v)
Definition ct_utils.h:392
static constexpr Mask< T > expand_top_bit(T v)
Definition ct_utils.h:415
void update_associated_data(std::span< const uint8_t > ad)
Incremental update of associated data used in the GMAC use-case.
Definition ghash.cpp:181
std::string provider() const
Definition ghash.cpp:21
void final(std::span< uint8_t > out)
Definition ghash.cpp:194
void nonce_hash(std::span< uint8_t, GCM_BS > y0, std::span< const uint8_t > nonce)
Hashing of non-default length nonce values for both GCM and GMAC use-cases.
Definition ghash.cpp:209
void reset_associated_data()
Reset the AAD state without resetting the key (used in GMAC::final_result).
Definition ghash.cpp:173
void reset_state()
Definition ghash.cpp:224
void clear() override
Definition ghash.cpp:218
void update(std::span< const uint8_t > in)
Definition ghash.cpp:187
void start(std::span< const uint8_t > nonce)
Definition ghash.cpp:156
bool has_keying_material() const override
Definition ghash.cpp:99
void set_associated_data(std::span< const uint8_t > ad)
Monolithic setting of associated data usid in the GCM use-case.
Definition ghash.cpp:163
void assert_key_material_set() const
Definition sym_algo.h:145
constexpr auto scoped_poison(const Ts &... xs)
Definition ct_utils.h:222
constexpr void copy_mem(T *out, const T *in, size_t n)
Definition mem_ops.h:144
void zap(std::vector< T, Alloc > &vec)
Definition secmem.h:133
void secure_scrub_memory(void *ptr, size_t n)
Definition mem_utils.cpp:25
void carry(int64_t &h0, int64_t &h1)
constexpr void xor_buf(ranges::contiguous_output_range< uint8_t > auto &&out, ranges::contiguous_range< uint8_t > auto &&in)
Definition mem_ops.h:341
constexpr auto store_be(ParamTs &&... params)
Definition loadstor.h:745
constexpr auto load_be(ParamTs &&... params)
Definition loadstor.h:504