Botan 3.11.0
Crypto and TLS for C&
ml_kem_impl.cpp
Go to the documentation of this file.
1/*
2 * Module-Lattice Key Encapsulation Mechanism (ML-KEM), Initial Public Draft
3 *
4 * (C) 2024 Jack Lloyd
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/ml_kem_impl.h>
11
12#include <botan/internal/ct_utils.h>
13#include <botan/internal/kyber_constants.h>
14#include <botan/internal/kyber_types.h>
15
16namespace Botan {
17
18/**
19 * NIST FIPS 203, Algorithm 17 (ML-KEM.Encaps_internal), and 20 (ML-KEM.Encaps)
20 *
21 * Generation of the random value is inlined with its usage. The public matrix
22 * A^T as well as H(pk) are precomputed and readily available.
23 */
25 StrongSpan<KyberSharedSecret> out_shared_key,
27 const auto& sym = mode().symmetric_primitives();
28
30 auto scope = CT::scoped_poison(m);
31
32 const auto [K, r] = sym.G(m, m_public_key->H_public_key_bits_raw());
33 m_public_key->indcpa_encrypt(out_encapsulated_key, m, r, precomputed_matrix_At(), mode());
34
35 // TODO: avoid this copy by letting sym.G() directly write to the span.
36 copy_mem(out_shared_key, K);
37 CT::unpoison_all(out_shared_key, out_encapsulated_key);
38}
39
40/**
41 * NIST FIPS 203, Algorithm 18 (ML-KEM.Decaps_internal) and 21 (ML-KEM.Decaps)
42 *
43 * The public and private keys are readily available as member variables and
44 * don't need to be decoded. The checks stated in FIPS 203, Section 7.3 are
45 * performed before decoding the keys and the ciphertext.
46 */
49 auto scope = CT::scoped_poison(*m_private_key);
50
51 const auto& sym = mode().symmetric_primitives();
52
53 const auto& h = m_public_key->H_public_key_bits_raw();
54 const auto& z = m_private_key->z();
55
56 const auto m_prime = m_private_key->indcpa_decrypt(c);
57 const auto [K_prime, r_prime] = sym.G(m_prime, h);
58
59 const auto K_bar = sym.J(z, c);
60 const auto c_prime = m_public_key->indcpa_encrypt(m_prime, r_prime, precomputed_matrix_At(), mode());
61
62 BOTAN_ASSERT_NOMSG(c.size() == c_prime.size());
63 BOTAN_ASSERT_NOMSG(K_prime.size() == K_bar.size() && out_shared_key.size() == K_bar.size());
64 const auto reencrypt_success = CT::is_equal<uint8_t>(c, c_prime);
65 CT::conditional_copy_mem(reencrypt_success, out_shared_key.data(), K_prime.data(), K_bar.data(), K_prime.size());
66
67 CT::unpoison(out_shared_key);
68}
69} // namespace Botan
#define BOTAN_ASSERT_NOMSG(expr)
Definition assert.h:75
static constexpr size_t SEED_BYTES
Kyber_Symmetric_Primitives & symmetric_primitives() const
const KyberPolyMat & precomputed_matrix_At() const
const KyberConstants & mode() const
std::pair< KyberSeedRho, KyberSeedSigma > G(StrongSpan< const KyberSeedRandomness > seed, const KyberConstants &mode) const
void decapsulate(StrongSpan< KyberSharedSecret > out_shared_key, StrongSpan< const KyberCompressedCiphertext > encapsulated_key) override
void encapsulate(StrongSpan< KyberCompressedCiphertext > out_encapsulated_key, StrongSpan< KyberSharedSecret > out_shared_key, RandomNumberGenerator &rng) override
void random_vec(std::span< uint8_t > v)
Definition rng.h:204
decltype(auto) data() noexcept(noexcept(this->m_span.data()))
decltype(auto) size() const noexcept(noexcept(this->m_span.size()))
constexpr Mask< T > conditional_copy_mem(Mask< T > mask, T *dest, const T *if_set, const T *if_unset, size_t elems)
Definition ct_utils.h:732
constexpr auto scoped_poison(const Ts &... xs)
Definition ct_utils.h:222
constexpr void unpoison_all(const Ts &... ts)
Definition ct_utils.h:207
constexpr CT::Mask< T > is_equal(const T x[], const T y[], size_t len)
Definition ct_utils.h:798
constexpr void unpoison(const T *p, size_t n)
Definition ct_utils.h:67
constexpr void copy_mem(T *out, const T *in, size_t n)
Definition mem_ops.h:144
Strong< secure_vector< uint8_t >, struct KyberMessage_ > KyberMessage
Random message value to be encrypted by the CPA-secure Kyber encryption scheme.
Definition kyber_types.h:45