shadps4-emu/ext-cryptopp
1
0
Fork 0
mirror of https://github.com/shadps4-emu/ext-cryptopp.git synced 2024-11-26 19:30:21 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update comments

Browse Source
This commit is contained in:
Jeffrey Walton 2023-11-20 02:41:32 -05:00
parent 641ae35258
commit 93208e8393
No known key found for this signature in database
GPG Key ID: B36AB348921B1838
1 changed files with 8 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
gf2n.cpp
View File

@ -139,9 +139,9 @@ PolynomialMod2 PolynomialMod2::Trinomial(size_t t0, size_t t1, size_t t2)
CRYPTOPP_ASSERT(t0 > t1);
CRYPTOPP_ASSERT(t1 > t2);
// The test is odd because of ECIES<EC2N>. The basis is t0, but the other coefficients are not in descending order.
// The test is relaxed because of ECIES<EC2N>. The high order exponent is t0, but the other exponents are not in descending order.
if (t1 > t0 || t2 > t0)
throw InvalidArgument("PolynomialMod2: coefficients must be in descending order");
throw InvalidArgument("PolynomialMod2: exponents must be in descending order");
PolynomialMod2 r((word)0, t0+1);
r.SetBit(t0);
@ -158,9 +158,9 @@ PolynomialMod2 PolynomialMod2::Pentanomial(size_t t0, size_t t1, size_t t2, size
CRYPTOPP_ASSERT(t2 > t3);
CRYPTOPP_ASSERT(t3 > t4);
// The test is odd because of ECIES<EC2N>. The basis is t0, but the other coefficients are not in descending order.
// The test is relaxed because of ECIES<EC2N>. The high order exponent is t0, but the other exponents are not in descending order.
if (t1 > t0 || t2 > t0 || t3 > t0 || t4 > t0)
throw InvalidArgument("PolynomialMod2: coefficients must be in descending order");
throw InvalidArgument("PolynomialMod2: exponents must be in descending order");
PolynomialMod2 r((word)0, t0+1);
r.SetBit(t0);
@ -676,9 +676,9 @@ GF2NT::GF2NT(unsigned int c0, unsigned int c1, unsigned int c2)
// Asserts and checks due to Bing Shi
CRYPTOPP_ASSERT(c0 > c1 && c1 > c2 && c2==0);
// The test is odd because of ECIES<EC2N>. The basis is c0, but the other coefficients are not in descending order.
// The test is relaxed because of ECIES<EC2N>. The high order exponent is t0, but the other exponents are not in descending order.
if (c1 > c0 || c2 > c0)
throw InvalidArgument("GF2NT: coefficients must be in descending order");
throw InvalidArgument("GF2NT: exponents must be in descending order");
}
const GF2NT::Element& GF2NT::MultiplicativeInverse(const Element &a) const
@ -990,9 +990,9 @@ GF2NT233::GF2NT233(unsigned int c0, unsigned int c1, unsigned int c2)
// Asserts and checks due to Bing Shi
CRYPTOPP_ASSERT(c0 > c1 && c1 > c2 && c2==0);
// The test is odd because of ECIES<EC2N>. The basis is c0, but the other coefficients are not in descending order.
// The test is relaxed because of ECIES<EC2N>. The high order exponent is t0, but the other exponents are not in descending order.
if (c1 > c0 || c2 > c0)
throw InvalidArgument("GF2NT: coefficients must be in descending order");
throw InvalidArgument("GF2NT233: exponents must be in descending order");
}
const GF2NT::Element& GF2NT233::Multiply(const Element &a, const Element &b) const