Coverage Report

Created: 2020-06-30 13:58

/src/botan/src/fuzzer/invert.cpp
Line
Count
Source (jump to first uncovered line)
1
/*
2
* (C) 2015,2016,2020 Jack Lloyd
3
*
4
* Botan is released under the Simplified BSD License (see license.txt)
5
*/
6
#include "fuzzers.h"
7
#include <botan/numthry.h>
8
9
namespace {
10
11
Botan::BigInt ref_inverse_mod(const Botan::BigInt& n, const Botan::BigInt& mod)
12
859
   {
13
859
   if(n == 0 || mod < 2)
14
2
      return 0;
15
857
   if(n.is_even() && mod.is_even())
16
3
      return 0;
17
854
   Botan::BigInt u = mod, v = n;
18
854
   Botan::BigInt A = 1, B = 0, C = 0, D = 1;
19
854
20
404k
   while(u.is_nonzero())
21
403k
      {
22
403k
      const size_t u_zero_bits = Botan::low_zero_bits(u);
23
403k
      u >>= u_zero_bits;
24
1.00M
      for(size_t i = 0; i != u_zero_bits; ++i)
25
601k
         {
26
601k
         if(A.is_odd() || B.is_odd())
27
267k
            { A += n; B -= mod; }
28
601k
         A >>= 1; B >>= 1;
29
601k
         }
30
403k
31
403k
      const size_t v_zero_bits = Botan::low_zero_bits(v);
32
403k
      v >>= v_zero_bits;
33
994k
      for(size_t i = 0; i != v_zero_bits; ++i)
34
590k
         {
35
590k
         if(C.is_odd() || D.is_odd())
36
276k
            { C += n; D -= mod; }
37
590k
         C >>= 1; D >>= 1;
38
590k
         }
39
403k
40
403k
      if(u >= v) { u -= v; A -= C; B -= D; }
41
281k
      else       { v -= u; C -= A; D -= B; }
42
403k
      }
43
854
44
854
   if(v != 1)
45
132
      return 0; // no modular inverse
46
722
47
1.47k
   while(D.is_negative()) D += mod;
48
937
   while(D >= mod) D -= mod;
49
722
50
722
   return D;
51
722
   }
52
53
}
54
55
void fuzz(const uint8_t in[], size_t len)
56
879
   {
57
879
   static const size_t max_bits = 4096;
58
879
59
879
   if(len > 2*max_bits/8)
60
17
      return;
61
862
62
862
   const Botan::BigInt x = Botan::BigInt::decode(in, len / 2);
63
862
   Botan::BigInt mod = Botan::BigInt::decode(in + len / 2, len - len / 2);
64
862
65
862
   if(mod < 2)
66
3
      return;
67
859
68
859
   const Botan::BigInt lib = Botan::inverse_mod(x, mod);
69
859
   const Botan::BigInt ref = ref_inverse_mod(x, mod);
70
859
71
859
   if(ref != lib)
72
0
      {
73
0
      FUZZER_WRITE_AND_CRASH("X = " << x << "\n"
74
0
                             << "Mod = " << mod << "\n"
75
0
                             << "GCD(X,Mod) = " << gcd(x, mod) << "\n"
76
0
                             << "RefInv(X,Mod) = " << ref << "\n"
77
0
                             << "LibInv(X,Mod)  = " << lib << "\n"
78
0
                             << "RefCheck = " << (x*ref)%mod << "\n"
79
0
                             << "LibCheck  = " << (x*lib)%mod << "\n");
80
0
      }
81
859
   }
82