6421338519

Committed 05 Oct 2023 03:44PM UTC coverage: 91.703% (-0.08%) from 91.783%

Build # 6421338519

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #3609 from Rohde-Schwarz/tls13/kem_establishment

[TLS 1.3] Hybrid PQ/T key establishment

Run Details

79958 of 87192 relevant lines covered (91.7%)

8521367.99 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

96.15

/src/fuzzer/invert.cpp

/*
* (C) 2015,2016,2020 Jack Lloyd
*
* Botan is released under the Simplified BSD License (see license.txt)
*/
#include "fuzzers.h"

#include <botan/numthry.h>

namespace {

Botan::BigInt ref_inverse_mod(const Botan::BigInt& n, const Botan::BigInt& mod) {
   if(n == 0 || mod < 2) {
      return 0;
   }
   if(n.is_even() && mod.is_even()) {
      return 0;
   }
   Botan::BigInt u = mod, v = n;
   Botan::BigInt A = 1, B = 0, C = 0, D = 1;

   while(u.is_nonzero()) {
      const size_t u_zero_bits = Botan::low_zero_bits(u);
      u >>= u_zero_bits;
      for(size_t i = 0; i != u_zero_bits; ++i) {
         if(A.is_odd() || B.is_odd()) {
            A += n;
            B -= mod;
         }
         A >>= 1;
         B >>= 1;
      }

      const size_t v_zero_bits = Botan::low_zero_bits(v);
      v >>= v_zero_bits;
      for(size_t i = 0; i != v_zero_bits; ++i) {
         if(C.is_odd() || D.is_odd()) {
            C += n;
            D -= mod;
         }
         C >>= 1;
         D >>= 1;
      }

      if(u >= v) {
         u -= v;
         A -= C;
         B -= D;
      } else {
         v -= u;
         C -= A;
         D -= B;
      }
   }

   if(v != 1) {
      return 0;  // no modular inverse
   }

   while(D.is_negative()) {
      D += mod;
   }
   while(D >= mod) {
      D -= mod;
   }

   return D;
}

}  // namespace

void fuzz(const uint8_t in[], size_t len) {
   static const size_t max_bits = 4096;

   if(len > 2 * max_bits / 8) {
      return;
   }

   const Botan::BigInt x = Botan::BigInt::decode(in, len / 2);
   Botan::BigInt mod = Botan::BigInt::decode(in + len / 2, len - len / 2);

   if(mod < 2) {
      return;
   }

   const Botan::BigInt lib = Botan::inverse_mod(x, mod);
   const Botan::BigInt ref = ref_inverse_mod(x, mod);

   if(ref != lib) {
      FUZZER_WRITE_AND_CRASH("X = " << x << "\n"
                                    << "Mod = " << mod << "\n"
                                    << "GCD(X,Mod) = " << gcd(x, mod) << "\n"
                                    << "RefInv(X,Mod) = " << ref << "\n"
                                    << "LibInv(X,Mod)  = " << lib << "\n"
                                    << "RefCheck = " << (x * ref) % mod << "\n"
                                    << "LibCheck  = " << (x * lib) % mod << "\n");
   }
}

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
8	#include <botan/numthry.h>
9
10	namespace {
11
12	Botan::BigInt ref_inverse_mod(const Botan::BigInt& n, const Botan::BigInt& mod) {	98✔
13	if(n == 0 \|\| mod < 2) {	196✔
14	return 0;	×
15	}
16	if(n.is_even() && mod.is_even()) {	246✔
17	return 0;	24✔
18	}
19	Botan::BigInt u = mod, v = n;	74✔
20	Botan::BigInt A = 1, B = 0, C = 0, D = 1;	74✔
21
22	while(u.is_nonzero()) {	42,485✔
23	const size_t u_zero_bits = Botan::low_zero_bits(u);	28,247✔
24	u >>= u_zero_bits;	28,247✔
25	for(size_t i = 0; i != u_zero_bits; ++i) {	56,382✔
26	if(A.is_odd() \|\| B.is_odd()) {	74,827✔
27	A += n;	14,085✔
28	B -= mod;	14,085✔
29	}
30	A >>= 1;	28,135✔
31	B >>= 1;	28,135✔
32	}
33
34	const size_t v_zero_bits = Botan::low_zero_bits(v);	28,247✔
35	v >>= v_zero_bits;	28,247✔
36	for(size_t i = 0; i != v_zero_bits; ++i) {	56,416✔
37	if(C.is_odd() \|\| D.is_odd()) {	75,113✔
38	C += n;	13,991✔
39	D -= mod;	13,991✔
40	}
41	C >>= 1;	28,169✔
42	D >>= 1;	28,169✔
43	}
44
45	if(u >= v) {	28,247✔
46	u -= v;	14,164✔
47	A -= C;	14,164✔
48	B -= D;	14,164✔
49	} else {
50	v -= u;	14,083✔
51	C -= A;	14,083✔
52	D -= B;	14,083✔
53	}
54	}
55
56	if(v != 1) {	74✔
57	return 0; // no modular inverse	15✔
58	}
59
60	while(D.is_negative()) {	109✔
61	D += mod;	50✔
62	}
63	while(D >= mod) {	59✔
64	D -= mod;	×
65	}
66
67	return D;	74✔
68	}	468✔
69
70	} // namespace
71
72	void fuzz(const uint8_t in[], size_t len) {	100✔
73	static const size_t max_bits = 4096;	100✔
74
75	if(len > 2 * max_bits / 8) {	100✔
76	return;	2✔
77	}
78
79	const Botan::BigInt x = Botan::BigInt::decode(in, len / 2);	100✔
80	Botan::BigInt mod = Botan::BigInt::decode(in + len / 2, len - len / 2);	100✔
81
82	if(mod < 2) {	100✔
83	return;	2✔
84	}
85
86	const Botan::BigInt lib = Botan::inverse_mod(x, mod);	98✔
87	const Botan::BigInt ref = ref_inverse_mod(x, mod);	98✔
88
89	if(ref != lib) {	98✔
90	FUZZER_WRITE_AND_CRASH("X = " << x << "\n"	98✔
91	<< "Mod = " << mod << "\n"
92	<< "GCD(X,Mod) = " << gcd(x, mod) << "\n"
93	<< "RefInv(X,Mod) = " << ref << "\n"
94	<< "LibInv(X,Mod) = " << lib << "\n"
95	<< "RefCheck = " << (x * ref) % mod << "\n"
96	<< "LibCheck = " << (x * lib) % mod << "\n");
97	}
98	}	365✔

randombit / botan / 6421338519

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous