arne
/
cryptopp
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Switch to <nbtheory.h> functions

pull/611/head
Jeffrey Walton 2018-03-26 23:49:04 -04:00
parent 9ab3f61810
commit 36bde8eab5
No known key found for this signature in database
GPG Key ID: B36AB348921B1838
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
validat0.cpp
View File

@ -3158,7 +3158,7 @@ bool TestIntegerOps()
try { try {
Integer x = 0; Integer x = 0;
Integer y = 0; Integer y = 0;
Integer z = a_times_b_mod_c(y, y, x); Integer z = ModularMultiplication(y, y, x);
result = false; result = false;
} }
catch(const Integer::DivideByZero&) { catch(const Integer::DivideByZero&) {
@ -3356,7 +3356,7 @@ bool TestIntegerOps()
if (x != y) if (x != y)
{ {
result = (Integer::Gcd(x,y) == 1); result = (RelativelyPrime(x, y) == true);
pass = result && pass; pass = result && pass;
if (!result) if (!result)
@ -3396,8 +3396,8 @@ bool TestIntegerOps()
Integer y = (a % m).InverseMod(m); Integer y = (a % m).InverseMod(m);
Integer z = (a * y).Modulo(m); Integer z = (a * y).Modulo(m);
if (GCD(a,m) == 1) // coprime? if (RelativelyPrime(a, m) == true)
result = (x == y) && (z == 1) && (a_times_b_mod_c(a, x, m) == 1); result = (x == y) && (z == 1) && (ModularMultiplication(a, x, m) == 1);
else else
result = (x == y); result = (x == y);
@ -3449,8 +3449,8 @@ bool TestIntegerOps()
Integer y = (a % m).InverseMod(m); Integer y = (a % m).InverseMod(m);
Integer z = (a * y).Modulo(m); Integer z = (a * y).Modulo(m);
if (GCD(a,m) == 1) // coprime? if (RelativelyPrime(a, m) == true)
result = (x == y) && (z == 1) && (a_times_b_mod_c(a, x, m) == 1); result = (x == y) && (z == 1) && (ModularMultiplication(a, x, m) == 1);
else else
result = (x == y); result = (x == y);
@ -3470,8 +3470,8 @@ bool TestIntegerOps()
Integer y = (a % m).InverseMod(m); Integer y = (a % m).InverseMod(m);
Integer z = (a * y).Modulo(m); Integer z = (a * y).Modulo(m);
if (GCD(a,m) == 1) // coprime? if (RelativelyPrime(a, m) == true)
result = (x == y) && (z == 1) && (a_times_b_mod_c(a, x, m) == 1); result = (x == y) && (z == 1) && (ModularMultiplication(a, x, m) == 1);
else else
result = (x == y); result = (x == y);
@ -3498,7 +3498,7 @@ bool TestIntegerOps()
Integer y = Integer(Integer::POSITIVE, 0, ri.InverseMod(m)); Integer y = Integer(Integer::POSITIVE, 0, ri.InverseMod(m));
Integer z = Integer(Integer::POSITIVE, 0, (a * y).Modulo(m)); Integer z = Integer(Integer::POSITIVE, 0, (a * y).Modulo(m));
if (GCD(a,mi) == 1) // coprime? if (GCD(a,mi) == 1)
result = (x == y) && (z == 1); result = (x == y) && (z == 1);
else else
result = (x == y); result = (x == y);