Coverage Report

Created: 2020-11-21 08:34

/src/botan/src/fuzzer/ecc_helper.h
Line
Count
Source (jump to first uncovered line)
1
/*
2
* (C) 2015,2016 Jack Lloyd
3
*
4
* Botan is released under the Simplified BSD License (see license.txt)
5
*/
6
7
#ifndef ECC_HELPERS_H_
8
#define ECC_HELPERS_H_
9
10
#include "fuzzers.h"
11
#include <botan/ec_group.h>
12
#include <botan/reducer.h>
13
#include <botan/numthry.h>
14
15
namespace {
16
17
inline std::ostream& operator<<(std::ostream& o, const Botan::PointGFp& point)
18
0
   {
19
0
   o << point.get_affine_x() << "," << point.get_affine_y();
20
0
   return o;
21
0
   }
Unexecuted instantiation: ecc_p256.cpp:(anonymous namespace)::operator<<(std::__1::basic_ostream<char, std::__1::char_traits<char> >&, Botan::PointGFp const&)
Unexecuted instantiation: ecc_bp256.cpp:(anonymous namespace)::operator<<(std::__1::basic_ostream<char, std::__1::char_traits<char> >&, Botan::PointGFp const&)
Unexecuted instantiation: ecc_p521.cpp:(anonymous namespace)::operator<<(std::__1::basic_ostream<char, std::__1::char_traits<char> >&, Botan::PointGFp const&)
Unexecuted instantiation: ecc_p384.cpp:(anonymous namespace)::operator<<(std::__1::basic_ostream<char, std::__1::char_traits<char> >&, Botan::PointGFp const&)
22
23
Botan::BigInt decompress_point(bool yMod2,
24
                               const Botan::BigInt& x,
25
                               const Botan::BigInt& curve_p,
26
                               const Botan::BigInt& curve_a,
27
                               const Botan::BigInt& curve_b)
28
3.35k
   {
29
3.35k
   Botan::BigInt xpow3 = x * x * x;
30
31
3.35k
   Botan::BigInt g = curve_a * x;
32
3.35k
   g += xpow3;
33
3.35k
   g += curve_b;
34
3.35k
   g = g % curve_p;
35
36
3.35k
   Botan::BigInt z = ressol(g, curve_p);
37
38
3.35k
   if(z < 0)
39
1.45k
      throw Botan::Exception("Could not perform square root");
40
41
1.89k
   if(z.get_bit(0) != yMod2)
42
1.05k
      z = curve_p - z;
43
44
1.89k
   return z;
45
1.89k
   }
ecc_p256.cpp:(anonymous namespace)::decompress_point(bool, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&)
Line
Count
Source
28
837
   {
29
837
   Botan::BigInt xpow3 = x * x * x;
30
31
837
   Botan::BigInt g = curve_a * x;
32
837
   g += xpow3;
33
837
   g += curve_b;
34
837
   g = g % curve_p;
35
36
837
   Botan::BigInt z = ressol(g, curve_p);
37
38
837
   if(z < 0)
39
356
      throw Botan::Exception("Could not perform square root");
40
41
481
   if(z.get_bit(0) != yMod2)
42
328
      z = curve_p - z;
43
44
481
   return z;
45
481
   }
ecc_bp256.cpp:(anonymous namespace)::decompress_point(bool, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&)
Line
Count
Source
28
826
   {
29
826
   Botan::BigInt xpow3 = x * x * x;
30
31
826
   Botan::BigInt g = curve_a * x;
32
826
   g += xpow3;
33
826
   g += curve_b;
34
826
   g = g % curve_p;
35
36
826
   Botan::BigInt z = ressol(g, curve_p);
37
38
826
   if(z < 0)
39
471
      throw Botan::Exception("Could not perform square root");
40
41
355
   if(z.get_bit(0) != yMod2)
42
153
      z = curve_p - z;
43
44
355
   return z;
45
355
   }
ecc_p521.cpp:(anonymous namespace)::decompress_point(bool, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&)
Line
Count
Source
28
865
   {
29
865
   Botan::BigInt xpow3 = x * x * x;
30
31
865
   Botan::BigInt g = curve_a * x;
32
865
   g += xpow3;
33
865
   g += curve_b;
34
865
   g = g % curve_p;
35
36
865
   Botan::BigInt z = ressol(g, curve_p);
37
38
865
   if(z < 0)
39
297
      throw Botan::Exception("Could not perform square root");
40
41
568
   if(z.get_bit(0) != yMod2)
42
385
      z = curve_p - z;
43
44
568
   return z;
45
568
   }
ecc_p384.cpp:(anonymous namespace)::decompress_point(bool, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&)
Line
Count
Source
28
824
   {
29
824
   Botan::BigInt xpow3 = x * x * x;
30
31
824
   Botan::BigInt g = curve_a * x;
32
824
   g += xpow3;
33
824
   g += curve_b;
34
824
   g = g % curve_p;
35
36
824
   Botan::BigInt z = ressol(g, curve_p);
37
38
824
   if(z < 0)
39
329
      throw Botan::Exception("Could not perform square root");
40
41
495
   if(z.get_bit(0) != yMod2)
42
186
      z = curve_p - z;
43
44
495
   return z;
45
495
   }
46
47
void check_ecc_math(const Botan::EC_Group& group,
48
                    const uint8_t in[], size_t len)
49
3.35k
   {
50
   // These depend only on the group, which is also static
51
3.35k
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
3.35k
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
3.35k
   const size_t hlen = len / 2;
57
3.35k
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
3.35k
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
3.35k
   const Botan::BigInt c = a + b;
60
61
3.35k
   const Botan::PointGFp P1 = base_point * a;
62
3.35k
   const Botan::PointGFp Q1 = base_point * b;
63
3.35k
   const Botan::PointGFp R1 = base_point * c;
64
65
3.35k
   const Botan::PointGFp S1 = P1 + Q1;
66
3.35k
   const Botan::PointGFp T1 = Q1 + P1;
67
68
3.35k
   FUZZER_ASSERT_EQUAL(S1, R1);
69
3.35k
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
3.35k
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
3.35k
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
3.35k
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
3.35k
   const Botan::PointGFp S2 = P2 + Q2;
75
3.35k
   const Botan::PointGFp T2 = Q2 + P2;
76
77
3.35k
   FUZZER_ASSERT_EQUAL(S2, R2);
78
3.35k
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
3.35k
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
3.35k
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
3.35k
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
3.35k
   const Botan::PointGFp S3 = P3 + Q3;
84
3.35k
   const Botan::PointGFp T3 = Q3 + P3;
85
86
3.35k
   FUZZER_ASSERT_EQUAL(S3, R3);
87
3.35k
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
3.35k
   FUZZER_ASSERT_EQUAL(S1, S2);
90
3.35k
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
3.35k
   try
93
3.35k
      {
94
3.35k
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
3.35k
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
3.35k
      const auto yn = -yp;
98
3.35k
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
3.35k
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
3.35k
      }
102
3.35k
   catch(...) {}
103
3.35k
   }
ecc_p256.cpp:(anonymous namespace)::check_ecc_math(Botan::EC_Group const&, unsigned char const*, unsigned long)
Line
Count
Source
49
837
   {
50
   // These depend only on the group, which is also static
51
837
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
837
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
837
   const size_t hlen = len / 2;
57
837
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
837
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
837
   const Botan::BigInt c = a + b;
60
61
837
   const Botan::PointGFp P1 = base_point * a;
62
837
   const Botan::PointGFp Q1 = base_point * b;
63
837
   const Botan::PointGFp R1 = base_point * c;
64
65
837
   const Botan::PointGFp S1 = P1 + Q1;
66
837
   const Botan::PointGFp T1 = Q1 + P1;
67
68
837
   FUZZER_ASSERT_EQUAL(S1, R1);
69
837
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
837
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
837
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
837
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
837
   const Botan::PointGFp S2 = P2 + Q2;
75
837
   const Botan::PointGFp T2 = Q2 + P2;
76
77
837
   FUZZER_ASSERT_EQUAL(S2, R2);
78
837
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
837
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
837
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
837
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
837
   const Botan::PointGFp S3 = P3 + Q3;
84
837
   const Botan::PointGFp T3 = Q3 + P3;
85
86
837
   FUZZER_ASSERT_EQUAL(S3, R3);
87
837
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
837
   FUZZER_ASSERT_EQUAL(S1, S2);
90
837
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
837
   try
93
837
      {
94
837
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
837
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
837
      const auto yn = -yp;
98
837
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
837
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
837
      }
102
837
   catch(...) {}
103
837
   }
ecc_bp256.cpp:(anonymous namespace)::check_ecc_math(Botan::EC_Group const&, unsigned char const*, unsigned long)
Line
Count
Source
49
826
   {
50
   // These depend only on the group, which is also static
51
826
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
826
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
826
   const size_t hlen = len / 2;
57
826
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
826
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
826
   const Botan::BigInt c = a + b;
60
61
826
   const Botan::PointGFp P1 = base_point * a;
62
826
   const Botan::PointGFp Q1 = base_point * b;
63
826
   const Botan::PointGFp R1 = base_point * c;
64
65
826
   const Botan::PointGFp S1 = P1 + Q1;
66
826
   const Botan::PointGFp T1 = Q1 + P1;
67
68
826
   FUZZER_ASSERT_EQUAL(S1, R1);
69
826
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
826
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
826
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
826
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
826
   const Botan::PointGFp S2 = P2 + Q2;
75
826
   const Botan::PointGFp T2 = Q2 + P2;
76
77
826
   FUZZER_ASSERT_EQUAL(S2, R2);
78
826
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
826
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
826
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
826
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
826
   const Botan::PointGFp S3 = P3 + Q3;
84
826
   const Botan::PointGFp T3 = Q3 + P3;
85
86
826
   FUZZER_ASSERT_EQUAL(S3, R3);
87
826
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
826
   FUZZER_ASSERT_EQUAL(S1, S2);
90
826
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
826
   try
93
826
      {
94
826
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
826
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
826
      const auto yn = -yp;
98
826
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
826
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
826
      }
102
826
   catch(...) {}
103
826
   }
ecc_p521.cpp:(anonymous namespace)::check_ecc_math(Botan::EC_Group const&, unsigned char const*, unsigned long)
Line
Count
Source
49
865
   {
50
   // These depend only on the group, which is also static
51
865
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
865
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
865
   const size_t hlen = len / 2;
57
865
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
865
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
865
   const Botan::BigInt c = a + b;
60
61
865
   const Botan::PointGFp P1 = base_point * a;
62
865
   const Botan::PointGFp Q1 = base_point * b;
63
865
   const Botan::PointGFp R1 = base_point * c;
64
65
865
   const Botan::PointGFp S1 = P1 + Q1;
66
865
   const Botan::PointGFp T1 = Q1 + P1;
67
68
865
   FUZZER_ASSERT_EQUAL(S1, R1);
69
865
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
865
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
865
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
865
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
865
   const Botan::PointGFp S2 = P2 + Q2;
75
865
   const Botan::PointGFp T2 = Q2 + P2;
76
77
865
   FUZZER_ASSERT_EQUAL(S2, R2);
78
865
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
865
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
865
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
865
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
865
   const Botan::PointGFp S3 = P3 + Q3;
84
865
   const Botan::PointGFp T3 = Q3 + P3;
85
86
865
   FUZZER_ASSERT_EQUAL(S3, R3);
87
865
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
865
   FUZZER_ASSERT_EQUAL(S1, S2);
90
865
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
865
   try
93
865
      {
94
865
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
865
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
865
      const auto yn = -yp;
98
865
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
865
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
865
      }
102
865
   catch(...) {}
103
865
   }
ecc_p384.cpp:(anonymous namespace)::check_ecc_math(Botan::EC_Group const&, unsigned char const*, unsigned long)
Line
Count
Source
49
824
   {
50
   // These depend only on the group, which is also static
51
824
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
824
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
824
   const size_t hlen = len / 2;
57
824
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
824
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
824
   const Botan::BigInt c = a + b;
60
61
824
   const Botan::PointGFp P1 = base_point * a;
62
824
   const Botan::PointGFp Q1 = base_point * b;
63
824
   const Botan::PointGFp R1 = base_point * c;
64
65
824
   const Botan::PointGFp S1 = P1 + Q1;
66
824
   const Botan::PointGFp T1 = Q1 + P1;
67
68
824
   FUZZER_ASSERT_EQUAL(S1, R1);
69
824
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
824
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
824
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
824
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
824
   const Botan::PointGFp S2 = P2 + Q2;
75
824
   const Botan::PointGFp T2 = Q2 + P2;
76
77
824
   FUZZER_ASSERT_EQUAL(S2, R2);
78
824
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
824
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
824
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
824
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
824
   const Botan::PointGFp S3 = P3 + Q3;
84
824
   const Botan::PointGFp T3 = Q3 + P3;
85
86
824
   FUZZER_ASSERT_EQUAL(S3, R3);
87
824
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
824
   FUZZER_ASSERT_EQUAL(S1, S2);
90
824
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
824
   try
93
824
      {
94
824
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
824
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
824
      const auto yn = -yp;
98
824
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
824
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
824
      }
102
824
   catch(...) {}
103
824
   }
104
105
}
106
107
#endif