Coverage Report

Created: 2022-06-23 06:44

/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_p384.cpp:(anonymous namespace)::operator<<(std::__1::basic_ostream<char, std::__1::char_traits<char> >&, Botan::PointGFp const&)
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&)
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
4.88k
   {
29
4.88k
   Botan::BigInt xpow3 = x * x * x;
30
31
4.88k
   Botan::BigInt g = curve_a * x;
32
4.88k
   g += xpow3;
33
4.88k
   g += curve_b;
34
4.88k
   g = g % curve_p;
35
36
4.88k
   Botan::BigInt z = sqrt_modulo_prime(g, curve_p);
37
38
4.88k
   if(z < 0)
39
1.93k
      throw Botan::Exception("Could not perform square root");
40
41
2.94k
   if(z.get_bit(0) != yMod2)
42
1.49k
      z = curve_p - z;
43
44
2.94k
   return z;
45
4.88k
   }
ecc_p384.cpp:(anonymous namespace)::decompress_point(bool, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&)
Line
Count
Source
28
1.29k
   {
29
1.29k
   Botan::BigInt xpow3 = x * x * x;
30
31
1.29k
   Botan::BigInt g = curve_a * x;
32
1.29k
   g += xpow3;
33
1.29k
   g += curve_b;
34
1.29k
   g = g % curve_p;
35
36
1.29k
   Botan::BigInt z = sqrt_modulo_prime(g, curve_p);
37
38
1.29k
   if(z < 0)
39
490
      throw Botan::Exception("Could not perform square root");
40
41
803
   if(z.get_bit(0) != yMod2)
42
351
      z = curve_p - z;
43
44
803
   return z;
45
1.29k
   }
ecc_p256.cpp:(anonymous namespace)::decompress_point(bool, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&)
Line
Count
Source
28
1.06k
   {
29
1.06k
   Botan::BigInt xpow3 = x * x * x;
30
31
1.06k
   Botan::BigInt g = curve_a * x;
32
1.06k
   g += xpow3;
33
1.06k
   g += curve_b;
34
1.06k
   g = g % curve_p;
35
36
1.06k
   Botan::BigInt z = sqrt_modulo_prime(g, curve_p);
37
38
1.06k
   if(z < 0)
39
397
      throw Botan::Exception("Could not perform square root");
40
41
668
   if(z.get_bit(0) != yMod2)
42
360
      z = curve_p - z;
43
44
668
   return z;
45
1.06k
   }
ecc_bp256.cpp:(anonymous namespace)::decompress_point(bool, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&)
Line
Count
Source
28
1.29k
   {
29
1.29k
   Botan::BigInt xpow3 = x * x * x;
30
31
1.29k
   Botan::BigInt g = curve_a * x;
32
1.29k
   g += xpow3;
33
1.29k
   g += curve_b;
34
1.29k
   g = g % curve_p;
35
36
1.29k
   Botan::BigInt z = sqrt_modulo_prime(g, curve_p);
37
38
1.29k
   if(z < 0)
39
594
      throw Botan::Exception("Could not perform square root");
40
41
703
   if(z.get_bit(0) != yMod2)
42
339
      z = curve_p - z;
43
44
703
   return z;
45
1.29k
   }
ecc_p521.cpp:(anonymous namespace)::decompress_point(bool, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&, Botan::BigInt const&)
Line
Count
Source
28
1.23k
   {
29
1.23k
   Botan::BigInt xpow3 = x * x * x;
30
31
1.23k
   Botan::BigInt g = curve_a * x;
32
1.23k
   g += xpow3;
33
1.23k
   g += curve_b;
34
1.23k
   g = g % curve_p;
35
36
1.23k
   Botan::BigInt z = sqrt_modulo_prime(g, curve_p);
37
38
1.23k
   if(z < 0)
39
456
      throw Botan::Exception("Could not perform square root");
40
41
774
   if(z.get_bit(0) != yMod2)
42
442
      z = curve_p - z;
43
44
774
   return z;
45
1.23k
   }
46
47
void check_ecc_math(const Botan::EC_Group& group,
48
                    const uint8_t in[], size_t len)
49
4.88k
   {
50
   // These depend only on the group, which is also static
51
4.88k
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
4.88k
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
4.88k
   const size_t hlen = len / 2;
57
4.88k
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
4.88k
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
4.88k
   const Botan::BigInt c = a + b;
60
61
4.88k
   const Botan::PointGFp P1 = base_point * a;
62
4.88k
   const Botan::PointGFp Q1 = base_point * b;
63
4.88k
   const Botan::PointGFp R1 = base_point * c;
64
65
4.88k
   const Botan::PointGFp S1 = P1 + Q1;
66
4.88k
   const Botan::PointGFp T1 = Q1 + P1;
67
68
4.88k
   FUZZER_ASSERT_EQUAL(S1, R1);
69
4.88k
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
4.88k
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
4.88k
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
4.88k
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
4.88k
   const Botan::PointGFp S2 = P2 + Q2;
75
4.88k
   const Botan::PointGFp T2 = Q2 + P2;
76
77
4.88k
   FUZZER_ASSERT_EQUAL(S2, R2);
78
4.88k
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
4.88k
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
4.88k
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
4.88k
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
4.88k
   const Botan::PointGFp S3 = P3 + Q3;
84
4.88k
   const Botan::PointGFp T3 = Q3 + P3;
85
86
4.88k
   FUZZER_ASSERT_EQUAL(S3, R3);
87
4.88k
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
4.88k
   FUZZER_ASSERT_EQUAL(S1, S2);
90
4.88k
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
4.88k
   try
93
4.88k
      {
94
4.88k
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
4.88k
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
4.88k
      const auto yn = -yp;
98
4.88k
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
4.88k
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
4.88k
      }
102
4.88k
   catch(...) {}
103
4.88k
   }
ecc_p384.cpp:(anonymous namespace)::check_ecc_math(Botan::EC_Group const&, unsigned char const*, unsigned long)
Line
Count
Source
49
1.29k
   {
50
   // These depend only on the group, which is also static
51
1.29k
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
1.29k
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
1.29k
   const size_t hlen = len / 2;
57
1.29k
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
1.29k
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
1.29k
   const Botan::BigInt c = a + b;
60
61
1.29k
   const Botan::PointGFp P1 = base_point * a;
62
1.29k
   const Botan::PointGFp Q1 = base_point * b;
63
1.29k
   const Botan::PointGFp R1 = base_point * c;
64
65
1.29k
   const Botan::PointGFp S1 = P1 + Q1;
66
1.29k
   const Botan::PointGFp T1 = Q1 + P1;
67
68
1.29k
   FUZZER_ASSERT_EQUAL(S1, R1);
69
1.29k
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
1.29k
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
1.29k
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
1.29k
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
1.29k
   const Botan::PointGFp S2 = P2 + Q2;
75
1.29k
   const Botan::PointGFp T2 = Q2 + P2;
76
77
1.29k
   FUZZER_ASSERT_EQUAL(S2, R2);
78
1.29k
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
1.29k
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
1.29k
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
1.29k
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
1.29k
   const Botan::PointGFp S3 = P3 + Q3;
84
1.29k
   const Botan::PointGFp T3 = Q3 + P3;
85
86
1.29k
   FUZZER_ASSERT_EQUAL(S3, R3);
87
1.29k
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
1.29k
   FUZZER_ASSERT_EQUAL(S1, S2);
90
1.29k
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
1.29k
   try
93
1.29k
      {
94
1.29k
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
1.29k
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
1.29k
      const auto yn = -yp;
98
1.29k
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
1.29k
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
1.29k
      }
102
1.29k
   catch(...) {}
103
1.29k
   }
ecc_p256.cpp:(anonymous namespace)::check_ecc_math(Botan::EC_Group const&, unsigned char const*, unsigned long)
Line
Count
Source
49
1.06k
   {
50
   // These depend only on the group, which is also static
51
1.06k
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
1.06k
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
1.06k
   const size_t hlen = len / 2;
57
1.06k
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
1.06k
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
1.06k
   const Botan::BigInt c = a + b;
60
61
1.06k
   const Botan::PointGFp P1 = base_point * a;
62
1.06k
   const Botan::PointGFp Q1 = base_point * b;
63
1.06k
   const Botan::PointGFp R1 = base_point * c;
64
65
1.06k
   const Botan::PointGFp S1 = P1 + Q1;
66
1.06k
   const Botan::PointGFp T1 = Q1 + P1;
67
68
1.06k
   FUZZER_ASSERT_EQUAL(S1, R1);
69
1.06k
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
1.06k
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
1.06k
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
1.06k
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
1.06k
   const Botan::PointGFp S2 = P2 + Q2;
75
1.06k
   const Botan::PointGFp T2 = Q2 + P2;
76
77
1.06k
   FUZZER_ASSERT_EQUAL(S2, R2);
78
1.06k
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
1.06k
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
1.06k
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
1.06k
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
1.06k
   const Botan::PointGFp S3 = P3 + Q3;
84
1.06k
   const Botan::PointGFp T3 = Q3 + P3;
85
86
1.06k
   FUZZER_ASSERT_EQUAL(S3, R3);
87
1.06k
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
1.06k
   FUZZER_ASSERT_EQUAL(S1, S2);
90
1.06k
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
1.06k
   try
93
1.06k
      {
94
1.06k
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
1.06k
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
1.06k
      const auto yn = -yp;
98
1.06k
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
1.06k
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
1.06k
      }
102
1.06k
   catch(...) {}
103
1.06k
   }
ecc_bp256.cpp:(anonymous namespace)::check_ecc_math(Botan::EC_Group const&, unsigned char const*, unsigned long)
Line
Count
Source
49
1.29k
   {
50
   // These depend only on the group, which is also static
51
1.29k
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
1.29k
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
1.29k
   const size_t hlen = len / 2;
57
1.29k
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
1.29k
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
1.29k
   const Botan::BigInt c = a + b;
60
61
1.29k
   const Botan::PointGFp P1 = base_point * a;
62
1.29k
   const Botan::PointGFp Q1 = base_point * b;
63
1.29k
   const Botan::PointGFp R1 = base_point * c;
64
65
1.29k
   const Botan::PointGFp S1 = P1 + Q1;
66
1.29k
   const Botan::PointGFp T1 = Q1 + P1;
67
68
1.29k
   FUZZER_ASSERT_EQUAL(S1, R1);
69
1.29k
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
1.29k
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
1.29k
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
1.29k
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
1.29k
   const Botan::PointGFp S2 = P2 + Q2;
75
1.29k
   const Botan::PointGFp T2 = Q2 + P2;
76
77
1.29k
   FUZZER_ASSERT_EQUAL(S2, R2);
78
1.29k
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
1.29k
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
1.29k
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
1.29k
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
1.29k
   const Botan::PointGFp S3 = P3 + Q3;
84
1.29k
   const Botan::PointGFp T3 = Q3 + P3;
85
86
1.29k
   FUZZER_ASSERT_EQUAL(S3, R3);
87
1.29k
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
1.29k
   FUZZER_ASSERT_EQUAL(S1, S2);
90
1.29k
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
1.29k
   try
93
1.29k
      {
94
1.29k
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
1.29k
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
1.29k
      const auto yn = -yp;
98
1.29k
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
1.29k
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
1.29k
      }
102
1.29k
   catch(...) {}
103
1.29k
   }
ecc_p521.cpp:(anonymous namespace)::check_ecc_math(Botan::EC_Group const&, unsigned char const*, unsigned long)
Line
Count
Source
49
1.23k
   {
50
   // These depend only on the group, which is also static
51
1.23k
   static const Botan::PointGFp base_point = group.get_base_point();
52
53
   // This is shared across runs to reduce overhead
54
1.23k
   static std::vector<Botan::BigInt> ws(Botan::PointGFp::WORKSPACE_SIZE);
55
56
1.23k
   const size_t hlen = len / 2;
57
1.23k
   const Botan::BigInt a = Botan::BigInt::decode(in, hlen);
58
1.23k
   const Botan::BigInt b = Botan::BigInt::decode(in + hlen, len - hlen);
59
1.23k
   const Botan::BigInt c = a + b;
60
61
1.23k
   const Botan::PointGFp P1 = base_point * a;
62
1.23k
   const Botan::PointGFp Q1 = base_point * b;
63
1.23k
   const Botan::PointGFp R1 = base_point * c;
64
65
1.23k
   const Botan::PointGFp S1 = P1 + Q1;
66
1.23k
   const Botan::PointGFp T1 = Q1 + P1;
67
68
1.23k
   FUZZER_ASSERT_EQUAL(S1, R1);
69
1.23k
   FUZZER_ASSERT_EQUAL(T1, R1);
70
71
1.23k
   const Botan::PointGFp P2 = group.blinded_base_point_multiply(a, fuzzer_rng(), ws);
72
1.23k
   const Botan::PointGFp Q2 = group.blinded_base_point_multiply(b, fuzzer_rng(), ws);
73
1.23k
   const Botan::PointGFp R2 = group.blinded_base_point_multiply(c, fuzzer_rng(), ws);
74
1.23k
   const Botan::PointGFp S2 = P2 + Q2;
75
1.23k
   const Botan::PointGFp T2 = Q2 + P2;
76
77
1.23k
   FUZZER_ASSERT_EQUAL(S2, R2);
78
1.23k
   FUZZER_ASSERT_EQUAL(T2, R2);
79
80
1.23k
   const Botan::PointGFp P3 = group.blinded_var_point_multiply(base_point, a, fuzzer_rng(), ws);
81
1.23k
   const Botan::PointGFp Q3 = group.blinded_var_point_multiply(base_point, b, fuzzer_rng(), ws);
82
1.23k
   const Botan::PointGFp R3 = group.blinded_var_point_multiply(base_point, c, fuzzer_rng(), ws);
83
1.23k
   const Botan::PointGFp S3 = P3 + Q3;
84
1.23k
   const Botan::PointGFp T3 = Q3 + P3;
85
86
1.23k
   FUZZER_ASSERT_EQUAL(S3, R3);
87
1.23k
   FUZZER_ASSERT_EQUAL(T3, R3);
88
89
1.23k
   FUZZER_ASSERT_EQUAL(S1, S2);
90
1.23k
   FUZZER_ASSERT_EQUAL(S1, S3);
91
92
1.23k
   try
93
1.23k
      {
94
1.23k
      const auto yp = decompress_point(true, a, group.get_p(), group.get_a(), group.get_b());
95
1.23k
      const auto pt_p = group.blinded_var_point_multiply(group.point(a, yp), b, fuzzer_rng(), ws);
96
97
1.23k
      const auto yn = -yp;
98
1.23k
      const auto pt_n = group.blinded_var_point_multiply(group.point(a, yn), b, fuzzer_rng(), ws);
99
100
1.23k
      FUZZER_ASSERT_EQUAL(pt_p, -pt_n);
101
1.23k
      }
102
1.23k
   catch(...) {}
103
1.23k
   }
104
105
}
106
107
#endif