9#include <botan/internal/pk_ops_impl.h>
10#include <botan/keypair.h>
11#include <botan/blinding.h>
12#include <botan/reducer.h>
13#include <botan/workfactor.h>
14#include <botan/der_enc.h>
15#include <botan/ber_dec.h>
16#include <botan/monty.h>
17#include <botan/divide.h>
18#include <botan/internal/monty_exp.h>
20#if defined(BOTAN_HAS_THREAD_UTILS)
21 #include <botan/internal/thread_pool.h>
26class RSA_Public_Data
final
29 RSA_Public_Data(BigInt&& n, BigInt&& e) :
32 m_monty_n(
std::make_shared<Montgomery_Params>(m_n)),
33 m_public_modulus_bits(m_n.bits()),
34 m_public_modulus_bytes(m_n.bytes())
37 BigInt public_op(
const BigInt& m)
const
39 const size_t powm_window = 1;
44 const BigInt& get_n()
const {
return m_n; }
45 const BigInt& get_e()
const {
return m_e; }
46 size_t public_modulus_bits()
const {
return m_public_modulus_bits; }
47 size_t public_modulus_bytes()
const {
return m_public_modulus_bytes; }
52 std::shared_ptr<const Montgomery_Params> m_monty_n;
53 size_t m_public_modulus_bits;
54 size_t m_public_modulus_bytes;
57class RSA_Private_Data
final
60 RSA_Private_Data(BigInt&& d, BigInt&& p, BigInt&& q,
61 BigInt&& d1, BigInt&& d2, BigInt&& c) :
70 m_monty_p(
std::make_shared<Montgomery_Params>(m_p, m_mod_p)),
71 m_monty_q(
std::make_shared<Montgomery_Params>(m_q, m_mod_q)),
76 const BigInt& get_d()
const {
return m_d; }
77 const BigInt& get_p()
const {
return m_p; }
78 const BigInt& get_q()
const {
return m_q; }
79 const BigInt& get_d1()
const {
return m_d1; }
80 const BigInt& get_d2()
const {
return m_d2; }
81 const BigInt& get_c()
const {
return m_c; }
91 Modular_Reducer m_mod_p;
92 Modular_Reducer m_mod_q;
93 std::shared_ptr<const Montgomery_Params> m_monty_p;
94 std::shared_ptr<const Montgomery_Params> m_monty_q;
109 if(n.is_negative() || n.is_even() || e.is_negative() || e.is_even())
111 m_public = std::make_shared<RSA_Public_Data>(std::move(n), std::move(e));
115 const std::vector<uint8_t>& key_bits)
124 init(std::move(n), std::move(e));
131 init(std::move(n), std::move(e));
136 return m_public->public_modulus_bits();
151 std::vector<uint8_t> output;
180 .
encode(
static_cast<size_t>(0))
203 m_private = std::make_shared<RSA_Private_Data>(
204 std::move(d), std::move(p), std::move(q), std::move(d1), std::move(d2), std::move(c));
210 BigInt n, e, d, p, q, d1, d2, c;
227 RSA_PrivateKey::init(std::move(d), std::move(p), std::move(q),
228 std::move(d1), std::move(d2), std::move(c));
247 const BigInt p_minus_1 = p - 1;
248 const BigInt q_minus_1 = q - 1;
252 const BigInt phi_n =
lcm(p_minus_1, q_minus_1);
262 RSA_PrivateKey::init(std::move(d), std::move(p), std::move(q),
263 std::move(d1), std::move(d2), std::move(c));
270 size_t bits,
size_t exp)
274 std::to_string(bits) +
" bits long");
275 if(exp < 3 || exp % 2 == 0)
278 BigInt n, e, d, p, q, d1, d2, c;
282 const size_t p_bits = (bits + 1) / 2;
283 const size_t q_bits = bits - p_bits;
295 }
while(n.
bits() != bits);
297 const BigInt p_minus_1 = p - 1;
298 const BigInt q_minus_1 = q - 1;
300 const BigInt phi_n =
lcm(p_minus_1, q_minus_1);
308 RSA_PrivateKey::init(std::move(d), std::move(p), std::move(q),
309 std::move(d1), std::move(d2), std::move(c));
336 const size_t prob = (strong) ? 128 : 12;
359class RSA_Private_Operation
362 size_t public_modulus_bits()
const {
return m_public->public_modulus_bits(); }
363 size_t public_modulus_bytes()
const {
return m_public->public_modulus_bytes(); }
365 explicit RSA_Private_Operation(
const RSA_PrivateKey& rsa, RandomNumberGenerator& rng) :
366 m_public(rsa.public_data()),
367 m_private(rsa.private_data()),
368 m_blinder(m_public->get_n(), rng,
369 [this](const BigInt& k) {
return m_public->public_op(k); },
370 [
this](
const BigInt& k) {
return inverse_mod(k, m_public->get_n()); }),
372 m_max_d1_bits(m_private->m_p_bits + m_blinding_bits),
373 m_max_d2_bits(m_private->m_q_bits + m_blinding_bits)
377 secure_vector<uint8_t> raw_op(
const uint8_t input[],
size_t input_len)
379 const BigInt input_bn(input, input_len);
380 if(input_bn >= m_public->get_n())
381 throw Invalid_Argument(
"RSA private op - input is too large");
386 const BigInt recovered = m_blinder.unblind(rsa_private_op(m_blinder.blind(input_bn)));
387 BOTAN_ASSERT(input_bn == m_public->public_op(recovered),
"RSA consistency check");
393 BigInt rsa_private_op(
const BigInt& m)
const
401 static constexpr size_t powm_window = 4;
404 const BigInt d1_mask(m_blinder.rng(), m_blinding_bits);
406#if defined(BOTAN_HAS_THREAD_UTILS) && !defined(BOTAN_HAS_VALGRIND)
407 #define BOTAN_RSA_USE_ASYNC
410#if defined(BOTAN_RSA_USE_ASYNC)
420 const BigInt masked_d1 = m_private->get_d1() + (d1_mask * (m_private->get_p() - 1));
421 auto powm_d1_p =
monty_precompute(m_private->m_monty_p, m_private->m_mod_p.reduce(m), powm_window);
422 BigInt j1 =
monty_execute(*powm_d1_p, masked_d1, m_max_d1_bits);
424#if defined(BOTAN_RSA_USE_ASYNC)
429 const BigInt d2_mask(m_blinder.rng(), m_blinding_bits);
430 const BigInt masked_d2 = m_private->get_d2() + (d2_mask * (m_private->get_q() - 1));
431 auto powm_d2_q =
monty_precompute(m_private->m_monty_q, m_private->m_mod_q.reduce(m), powm_window);
432 const BigInt j2 =
monty_execute(*powm_d2_q, masked_d2, m_max_d2_bits);
434#if defined(BOTAN_RSA_USE_ASYNC)
435 BigInt j1 = future_j1.get();
451 j1 = m_private->m_mod_p.multiply(m_private->m_mod_p.reduce((m_private->get_p() + j1) - j2), m_private->get_c());
452 return mul_add(j1, m_private->get_q(), j2);
455 std::shared_ptr<const RSA_Public_Data> m_public;
456 std::shared_ptr<const RSA_Private_Data> m_private;
460 const size_t m_blinding_bits;
461 const size_t m_max_d1_bits;
462 const size_t m_max_d2_bits;
465class RSA_Signature_Operation
final :
public PK_Ops::Signature_with_EMSA,
466 private RSA_Private_Operation
469 size_t max_input_bits()
const override {
return public_modulus_bits() - 1; }
471 size_t signature_length()
const override {
return public_modulus_bytes(); }
473 RSA_Signature_Operation(
const RSA_PrivateKey& rsa,
const std::string& emsa, RandomNumberGenerator& rng) :
474 PK_Ops::Signature_with_EMSA(emsa),
475 RSA_Private_Operation(rsa, rng)
479 secure_vector<uint8_t> raw_sign(
const uint8_t input[],
size_t input_len,
480 RandomNumberGenerator&)
override
482 return raw_op(input, input_len);
486class RSA_Decryption_Operation
final :
public PK_Ops::Decryption_with_EME,
487 private RSA_Private_Operation
491 RSA_Decryption_Operation(
const RSA_PrivateKey& rsa,
const std::string& eme, RandomNumberGenerator& rng) :
492 PK_Ops::Decryption_with_EME(eme),
493 RSA_Private_Operation(rsa, rng)
497 size_t plaintext_length(
size_t)
const override {
return public_modulus_bytes(); }
499 secure_vector<uint8_t> raw_decrypt(
const uint8_t input[],
size_t input_len)
override
501 return raw_op(input, input_len);
505class RSA_KEM_Decryption_Operation
final :
public PK_Ops::KEM_Decryption_with_KDF,
506 private RSA_Private_Operation
510 RSA_KEM_Decryption_Operation(
const RSA_PrivateKey& key,
511 const std::string& kdf,
512 RandomNumberGenerator& rng) :
513 PK_Ops::KEM_Decryption_with_KDF(kdf),
514 RSA_Private_Operation(key, rng)
517 secure_vector<uint8_t>
518 raw_kem_decrypt(
const uint8_t encap_key[],
size_t len)
override
520 return raw_op(encap_key, len);
527class RSA_Public_Operation
530 explicit RSA_Public_Operation(
const RSA_PublicKey& rsa) :
531 m_public(rsa.public_data())
534 size_t get_max_input_bits()
const
536 const size_t n_bits = m_public->public_modulus_bits();
548 BigInt public_op(
const BigInt& m)
const
550 if(m >= m_public->get_n())
551 throw Invalid_Argument(
"RSA public op - input is too large");
553 return m_public->public_op(m);
556 size_t public_modulus_bytes()
const {
return m_public->public_modulus_bytes(); }
558 const BigInt& get_n()
const {
return m_public->get_n(); }
560 std::shared_ptr<const RSA_Public_Data> m_public;
563class RSA_Encryption_Operation
final :
public PK_Ops::Encryption_with_EME,
564 private RSA_Public_Operation
568 RSA_Encryption_Operation(
const RSA_PublicKey& rsa,
const std::string& eme) :
569 PK_Ops::Encryption_with_EME(eme),
570 RSA_Public_Operation(rsa)
574 size_t ciphertext_length(
size_t)
const override {
return public_modulus_bytes(); }
576 size_t max_raw_input_bits()
const override {
return get_max_input_bits(); }
578 secure_vector<uint8_t> raw_encrypt(
const uint8_t input[],
size_t input_len,
579 RandomNumberGenerator&)
override
581 BigInt input_bn(input, input_len);
586class RSA_Verify_Operation
final :
public PK_Ops::Verification_with_EMSA,
587 private RSA_Public_Operation
591 size_t max_input_bits()
const override {
return get_max_input_bits(); }
593 RSA_Verify_Operation(
const RSA_PublicKey& rsa,
const std::string& emsa) :
594 PK_Ops::Verification_with_EMSA(emsa),
595 RSA_Public_Operation(rsa)
599 bool with_recovery()
const override {
return true; }
601 secure_vector<uint8_t> verify_mr(
const uint8_t input[],
size_t input_len)
override
603 BigInt input_bn(input, input_len);
608class RSA_KEM_Encryption_Operation
final :
public PK_Ops::KEM_Encryption_with_KDF,
609 private RSA_Public_Operation
613 RSA_KEM_Encryption_Operation(
const RSA_PublicKey& key,
614 const std::string& kdf) :
615 PK_Ops::KEM_Encryption_with_KDF(kdf),
616 RSA_Public_Operation(key) {}
619 void raw_kem_encrypt(secure_vector<uint8_t>& out_encapsulated_key,
620 secure_vector<uint8_t>& raw_shared_key,
624 const BigInt c = public_op(r);
633std::unique_ptr<PK_Ops::Encryption>
635 const std::string& params,
636 const std::string& provider)
const
638 if(provider ==
"base" || provider.empty())
639 return std::unique_ptr<PK_Ops::Encryption>(
new RSA_Encryption_Operation(*
this, params));
643std::unique_ptr<PK_Ops::KEM_Encryption>
645 const std::string& params,
646 const std::string& provider)
const
648 if(provider ==
"base" || provider.empty())
649 return std::unique_ptr<PK_Ops::KEM_Encryption>(
new RSA_KEM_Encryption_Operation(*
this, params));
653std::unique_ptr<PK_Ops::Verification>
655 const std::string& provider)
const
657 if(provider ==
"base" || provider.empty())
658 return std::unique_ptr<PK_Ops::Verification>(
new RSA_Verify_Operation(*
this, params));
663std::unique_ptr<PK_Ops::Decryption>
665 const std::string& params,
666 const std::string& provider)
const
668 if(provider ==
"base" || provider.empty())
669 return std::unique_ptr<PK_Ops::Decryption>(
new RSA_Decryption_Operation(*
this, params, rng));
674std::unique_ptr<PK_Ops::KEM_Decryption>
676 const std::string& params,
677 const std::string& provider)
const
679 if(provider ==
"base" || provider.empty())
680 return std::unique_ptr<PK_Ops::KEM_Decryption>(
new RSA_KEM_Decryption_Operation(*
this, params, rng));
685std::unique_ptr<PK_Ops::Signature>
687 const std::string& params,
688 const std::string& provider)
const
690 if(provider ==
"base" || provider.empty())
691 return std::unique_ptr<PK_Ops::Signature>(
new RSA_Signature_Operation(*
this, params, rng));
#define BOTAN_ASSERT_NOMSG(expr)
#define BOTAN_ASSERT(expr, assertion_made)
BER_Decoder start_cons(ASN1_Tag type_tag, ASN1_Tag class_tag=UNIVERSAL)
BER_Decoder & decode(bool &out)
BER_Decoder & decode_and_check(const T &expected, const std::string &error_msg)
static BigInt random_integer(RandomNumberGenerator &rng, const BigInt &min, const BigInt &max)
static secure_vector< uint8_t > encode_locked(const BigInt &n)
static secure_vector< uint8_t > encode_1363(const BigInt &n, size_t bytes)
secure_vector< uint8_t > get_contents()
DER_Encoder & start_cons(ASN1_Tag type_tag, ASN1_Tag class_tag=UNIVERSAL)
DER_Encoder & encode(bool b)
virtual OID get_oid() const
std::unique_ptr< PK_Ops::Decryption > create_decryption_op(RandomNumberGenerator &rng, const std::string ¶ms, const std::string &provider) const override
const BigInt & get_q() const
std::shared_ptr< const RSA_Private_Data > private_data() const
const BigInt & get_c() const
std::unique_ptr< PK_Ops::Signature > create_signature_op(RandomNumberGenerator &rng, const std::string ¶ms, const std::string &provider) const override
const BigInt & get_p() const
const BigInt & get_d2() const
bool check_key(RandomNumberGenerator &rng, bool) const override
const BigInt & get_d() const
secure_vector< uint8_t > private_key_bits() const override
RSA_PrivateKey(const AlgorithmIdentifier &alg_id, const secure_vector< uint8_t > &key_bits)
std::unique_ptr< PK_Ops::KEM_Decryption > create_kem_decryption_op(RandomNumberGenerator &rng, const std::string ¶ms, const std::string &provider) const override
const BigInt & get_d1() const
std::unique_ptr< PK_Ops::KEM_Encryption > create_kem_encryption_op(RandomNumberGenerator &rng, const std::string ¶ms, const std::string &provider) const override
void init(BigInt &&n, BigInt &&e)
size_t key_length() const override
std::string algo_name() const override
std::unique_ptr< PK_Ops::Verification > create_verification_op(const std::string ¶ms, const std::string &provider) const override
std::unique_ptr< PK_Ops::Encryption > create_encryption_op(RandomNumberGenerator &rng, const std::string ¶ms, const std::string &provider) const override
const BigInt & get_n() const
size_t estimated_strength() const override
AlgorithmIdentifier algorithm_identifier() const override
std::vector< uint8_t > public_key_bits() const override
std::shared_ptr< const RSA_Public_Data > m_public
std::shared_ptr< const RSA_Public_Data > public_data() const
const BigInt & get_e() const
bool check_key(RandomNumberGenerator &rng, bool) const override
auto run(F &&f, Args &&... args) -> std::future< typename std::result_of< F(Args...)>::type >
static Thread_Pool & global_instance()
int(* final)(unsigned char *, CTX *)
bool signature_consistency_check(RandomNumberGenerator &rng, const Private_Key &private_key, const Public_Key &public_key, const std::string &padding)
BigInt lcm(const BigInt &a, const BigInt &b)
bool is_prime(const BigInt &n, RandomNumberGenerator &rng, size_t prob, bool is_random)
std::shared_ptr< const Montgomery_Exponentation_State > monty_precompute(std::shared_ptr< const Montgomery_Params > params, const BigInt &g, size_t window_bits, bool const_time)
BigInt generate_rsa_prime(RandomNumberGenerator &keygen_rng, RandomNumberGenerator &prime_test_rng, size_t bits, const BigInt &coprime, size_t prob)
size_t if_work_factor(size_t bits)
BigInt monty_execute_vartime(const Montgomery_Exponentation_State &precomputed_state, const BigInt &k)
BigInt inverse_mod(const BigInt &n, const BigInt &mod)
BigInt monty_execute(const Montgomery_Exponentation_State &precomputed_state, const BigInt &k, size_t max_k_bits)
std::vector< T, secure_allocator< T > > secure_vector
BigInt mul_add(const BigInt &a, const BigInt &b, const BigInt &c)
BigInt ct_modulo(const BigInt &x, const BigInt &y)