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
|
/*
* (C) 2015,2016 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#ifndef ECC_HELPERS_H__
#define ECC_HELPERS_H__
#include "driver.h"
#include <botan/curve_gfp.h>
#include <botan/ec_group.h>
#include <botan/reducer.h>
#include <botan/system_rng.h>
void check_redc(std::function<void (BigInt&, secure_vector<word>&)> redc_fn,
const Modular_Reducer& redc,
const BigInt& prime,
const BigInt& x)
{
const Botan::BigInt v1 = x % prime;
const Botan::BigInt v2 = redc.reduce(x);
Botan::secure_vector<Botan::word> ws;
Botan::BigInt v3 = x;
redc_fn(v3, ws);
FUZZER_ASSERT_EQUAL(v1, v2);
FUZZER_ASSERT_EQUAL(v2, v3);
}
inline std::ostream& operator<<(std::ostream& o, const PointGFp& point)
{
o << point.get_affine_x() << "," << point.get_affine_y();
return o;
}
void check_ecc_math(const EC_Group& group, const uint8_t in[], size_t len)
{
const size_t hlen = len / 2;
const BigInt a = BigInt::decode(in, hlen);
const BigInt b = BigInt::decode(in + hlen, len - hlen);
const Botan::PointGFp& base_point = group.get_base_point();
const Botan::BigInt& group_order = group.get_order();
const Botan::BigInt c = a + b;
const Botan::PointGFp P = base_point * a;
const Botan::PointGFp Q = base_point * b;
const Botan::PointGFp R = base_point * c;
const Botan::PointGFp A1 = P + Q;
const Botan::PointGFp A2 = Q + P;
if(a == 31337 && b == 31337)
abort();
FUZZER_ASSERT_EQUAL(A1, R);
FUZZER_ASSERT_EQUAL(A2, R);
Botan::Blinded_Point_Multiply blind(base_point, group_order, 4);
const Botan::PointGFp P1 = blind.blinded_multiply(a, system_rng());
const Botan::PointGFp Q1 = blind.blinded_multiply(b, system_rng());
const Botan::PointGFp R1 = blind.blinded_multiply(c, system_rng());
const Botan::PointGFp S1 = P1 + Q1;
const Botan::PointGFp S2 = Q1 + P1;
FUZZER_ASSERT_EQUAL(S1, R1);
FUZZER_ASSERT_EQUAL(S2, R1);
}
#endif
|
