• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

randombit / botan / 5230455705

10 Jun 2023 02:30PM UTC coverage: 91.715% (-0.03%) from 91.746%
5230455705

push

github

randombit
Merge GH #3584 Change clang-format AllowShortFunctionsOnASingleLine config from All to Inline

77182 of 84154 relevant lines covered (91.72%)

11975295.43 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

95.71
/src/lib/pubkey/dh/dh.cpp
1
/*
2
* Diffie-Hellman
3
* (C) 1999-2007,2016,2019,2023 Jack Lloyd
4
*
5
* Botan is released under the Simplified BSD License (see license.txt)
6
*/
7

8
#include <botan/dh.h>
9

10
#include <botan/internal/blinding.h>
11
#include <botan/internal/dl_scheme.h>
12
#include <botan/internal/pk_ops_impl.h>
13

14
namespace Botan {
15

16
DH_PublicKey::DH_PublicKey(const AlgorithmIdentifier& alg_id, std::span<const uint8_t> key_bits) {
13✔
17
   m_public_key = std::make_shared<DL_PublicKey>(alg_id, key_bits, DL_Group_Format::ANSI_X9_42);
13✔
18
}
13✔
19

20
DH_PublicKey::DH_PublicKey(const DL_Group& group, const BigInt& y) {
58✔
21
   m_public_key = std::make_shared<DL_PublicKey>(group, y);
58✔
22
}
58✔
23

24
std::vector<uint8_t> DH_PublicKey::public_value() const {
310✔
25
   return m_public_key->public_key_as_bytes();
310✔
26
}
27

28
size_t DH_PublicKey::estimated_strength() const {
2✔
29
   return m_public_key->estimated_strength();
2✔
30
}
31

32
size_t DH_PublicKey::key_length() const {
11✔
33
   return m_public_key->p_bits();
11✔
34
}
35

36
const BigInt& DH_PublicKey::get_int_field(std::string_view field) const {
6✔
37
   return m_public_key->get_int_field(algo_name(), field);
6✔
38
}
39

40
AlgorithmIdentifier DH_PublicKey::algorithm_identifier() const {
18✔
41
   return AlgorithmIdentifier(object_identifier(), m_public_key->group().DER_encode(DL_Group_Format::ANSI_X9_42));
36✔
42
}
43

44
std::vector<uint8_t> DH_PublicKey::public_key_bits() const {
5✔
45
   return m_public_key->DER_encode();
5✔
46
}
47

48
bool DH_PublicKey::check_key(RandomNumberGenerator& rng, bool strong) const {
11✔
49
   return m_public_key->check_key(rng, strong);
11✔
50
}
51

52
DH_PrivateKey::DH_PrivateKey(RandomNumberGenerator& rng, const DL_Group& group) {
34✔
53
   m_private_key = std::make_shared<DL_PrivateKey>(group, rng);
34✔
54
   m_public_key = m_private_key->public_key();
34✔
55
}
34✔
56

57
DH_PrivateKey::DH_PrivateKey(const DL_Group& group, const BigInt& x) {
187✔
58
   m_private_key = std::make_shared<DL_PrivateKey>(group, x);
187✔
59
   m_public_key = m_private_key->public_key();
187✔
60
}
187✔
61

62
DH_PrivateKey::DH_PrivateKey(const AlgorithmIdentifier& alg_id, std::span<const uint8_t> key_bits) {
19✔
63
   m_private_key = std::make_shared<DL_PrivateKey>(alg_id, key_bits, DL_Group_Format::ANSI_X9_42);
19✔
64
   m_public_key = m_private_key->public_key();
6✔
65
}
19✔
66

67
std::unique_ptr<Public_Key> DH_PrivateKey::public_key() const {
3✔
68
   return std::unique_ptr<DH_PublicKey>(new DH_PublicKey(m_public_key));
6✔
69
}
70

71
std::vector<uint8_t> DH_PrivateKey::public_value() const {
260✔
72
   return DH_PublicKey::public_value();
260✔
73
}
74

75
secure_vector<uint8_t> DH_PrivateKey::private_key_bits() const {
13✔
76
   return m_private_key->DER_encode();
13✔
77
}
78

79
secure_vector<uint8_t> DH_PrivateKey::raw_private_key_bits() const {
×
80
   return m_private_key->raw_private_key_bits();
×
81
}
82

83
const BigInt& DH_PrivateKey::get_int_field(std::string_view field) const {
11✔
84
   return m_private_key->get_int_field(algo_name(), field);
11✔
85
}
86

87
namespace {
88

89
/**
90
* DH operation
91
*/
92
class DH_KA_Operation final : public PK_Ops::Key_Agreement_with_KDF {
×
93
   public:
94
      DH_KA_Operation(const std::shared_ptr<const DL_PrivateKey>& key,
219✔
95
                      std::string_view kdf,
96
                      RandomNumberGenerator& rng) :
219✔
97
            PK_Ops::Key_Agreement_with_KDF(kdf),
98
            m_key(key),
438✔
99
            m_key_bits(m_key->private_key().bits()),
219✔
100
            m_blinder(
438✔
101
               m_key->group().get_p(),
219✔
102
               rng,
103
               [](const BigInt& k) { return k; },
219✔
104
               [this](const BigInt& k) {
438✔
105
                  const BigInt inv_k = inverse_mod(k, group().get_p());
219✔
106
                  return powermod_x_p(inv_k);
219✔
107
               }) {}
657✔
108

109
      size_t agreed_value_size() const override { return group().p_bytes(); }
72✔
110

111
      secure_vector<uint8_t> raw_agree(const uint8_t w[], size_t w_len) override;
112

113
   private:
114
      const DL_Group& group() const { return m_key->group(); }
1,996✔
115

116
      BigInt powermod_x_p(const BigInt& v) const { return group().power_b_p(v, m_key->private_key(), m_key_bits); }
219✔
117

118
      std::shared_ptr<const DL_PrivateKey> m_key;
119
      std::shared_ptr<const Montgomery_Params> m_monty_p;
120
      const size_t m_key_bits;
121
      Blinder m_blinder;
122
};
123

124
secure_vector<uint8_t> DH_KA_Operation::raw_agree(const uint8_t w[], size_t w_len) {
1,742✔
125
   BigInt v = BigInt::decode(w, w_len);
1,742✔
126

127
   if(v <= 1 || v >= group().get_p()) {
1,742✔
128
      throw Invalid_Argument("DH agreement - invalid key provided");
2✔
129
   }
130

131
   v = m_blinder.blind(v);
1,740✔
132
   v = powermod_x_p(v);
1,740✔
133
   v = m_blinder.unblind(v);
1,740✔
134

135
   return BigInt::encode_1363(v, group().p_bytes());
1,740✔
136
}
1,740✔
137

138
}  // namespace
139

140
std::unique_ptr<PK_Ops::Key_Agreement> DH_PrivateKey::create_key_agreement_op(RandomNumberGenerator& rng,
339✔
141
                                                                              std::string_view params,
142
                                                                              std::string_view provider) const {
143
   if(provider == "base" || provider.empty()) {
379✔
144
      return std::make_unique<DH_KA_Operation>(this->m_private_key, params, rng);
219✔
145
   }
146
   throw Provider_Not_Found(algo_name(), provider);
240✔
147
}
148

149
}  // namespace Botan
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc