1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
/*
* (C) 2016 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include "tests.h"
#if defined(BOTAN_HAS_NEWHOPE) && defined(BOTAN_HAS_CHACHA)
#include <botan/newhope.h>
#include <botan/sha3.h>
#include <botan/chacha.h>
#include <botan/rng.h>
#endif
namespace Botan_Tests {
#if defined(BOTAN_HAS_NEWHOPE) && defined(BOTAN_HAS_CHACHA)
class NEWHOPE_RNG final : public Botan::RandomNumberGenerator
{
public:
std::string name() const override
{
return "NEWHOPE_RNG";
}
void clear() override
{
/* ignored */
}
void randomize(uint8_t out[], size_t len) override
{
if(m_first.size() == len)
{
if(len != 32)
{
throw Test_Error("NEWHOPE_RNG called in unexpected way, bad test?");
}
Botan::copy_mem(out, m_first.data(), m_first.size());
return;
}
/*
* This slavishly emulates the behavior of the reference
* implementations RNG, in order to ensure that from the same
* random seed we compute the exact same result.
*/
Botan::clear_mem(out, len);
m_chacha.cipher1(out, len);
m_calls += 1;
uint8_t nonce[8] = { 0 };
if(m_calls < 3)
{
nonce[0] = m_calls;
}
else
{
nonce[7] = m_calls;
}
m_chacha.set_iv(nonce, 8);
}
bool is_seeded() const override
{
return true;
}
void add_entropy(const uint8_t[], size_t) override
{
/* ignored */
}
NEWHOPE_RNG(const std::vector<uint8_t>& seed)
{
if(seed.size() != 64 && seed.size() != 32)
{
throw Test_Error("Invalid NEWHOPE RNG seed");
}
if(seed.size() == 64)
{
m_first.assign(seed.begin(), seed.begin() + 32);
m_chacha.set_key(seed.data() + 32, 32);
}
else
{
m_chacha.set_key(seed.data(), 32);
}
}
private:
Botan::ChaCha m_chacha;
std::vector<uint8_t> m_first;
uint8_t m_calls = 0;
};
class NEWHOPE_Tests final : public Text_Based_Test
{
public:
NEWHOPE_Tests()
: Text_Based_Test(
"pubkey/newhope.vec",
"DRBG_SeedA,H_OutputA,DRBG_SeedB,H_OutputB,SharedKey") {}
Test::Result run_one_test(const std::string&, const VarMap& vars) override
{
Test::Result result("NEWHOPE");
const std::vector<uint8_t> h_output_a = vars.get_req_bin("H_OutputA");
const std::vector<uint8_t> h_output_b = vars.get_req_bin("H_OutputB");
const std::vector<uint8_t> shared_key = vars.get_req_bin("SharedKey");
NEWHOPE_RNG drbg_a(vars.get_req_bin("DRBG_SeedA"));
NEWHOPE_RNG drbg_b(vars.get_req_bin("DRBG_SeedB"));
Botan::SHA_3_256 sha3;
std::vector<uint8_t> send_a(Botan::NEWHOPE_SENDABYTES);
Botan::newhope_poly a_sk;
Botan::newhope_keygen(send_a.data(), &a_sk, drbg_a);
std::vector<uint8_t> h_send_a(sha3.output_length());
sha3.update(send_a);
sha3.final(h_send_a.data());
result.test_eq("Hash Output A", h_send_a, h_output_a);
std::vector<uint8_t> sharedkey_b(32);
std::vector<uint8_t> send_b(Botan::NEWHOPE_SENDBBYTES);
Botan::newhope_sharedb(sharedkey_b.data(), send_b.data(), send_a.data(), drbg_b);
result.test_eq("Key B", sharedkey_b, shared_key);
std::vector<uint8_t> h_send_b(sha3.output_length());
sha3.update(send_b);
sha3.final(h_send_b.data());
result.test_eq("Hash Output B", h_send_b, h_output_b);
std::vector<uint8_t> sharedkey_a(32);
newhope_shareda(sharedkey_a.data(), &a_sk, send_b.data());
result.test_eq("Key A", sharedkey_a, shared_key);
return result;
}
};
BOTAN_REGISTER_TEST("newhope", NEWHOPE_Tests);
#endif
}
|
