Crypto++
8.9
Free C++ class library of cryptographic schemes
|
Classes and functions for schemes over GF(2^n) More...
Go to the source code of this file.
Classes | |
class | PolynomialMod2 |
Polynomial with Coefficients in GF(2) More... | |
class | PolynomialMod2::DivideByZero |
Exception thrown when divide by zero is encountered. More... | |
class | GF2NP |
GF(2^n) with Polynomial Basis. More... | |
class | GF2NT |
GF(2^n) with Trinomial Basis. More... | |
class | GF2NT233 |
GF(2^n) for b233 and k233. More... | |
class | GF2NPP |
GF(2^n) with Pentanomial Basis. More... | |
Functions | |
bool | operator== (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
bool | operator!= (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
bool | operator> (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
compares degree | |
bool | operator>= (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
compares degree | |
bool | operator< (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
compares degree | |
bool | operator<= (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
compares degree | |
inline ::PolynomialMod2 | operator& (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
inline ::PolynomialMod2 | operator^ (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
inline ::PolynomialMod2 | operator+ (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
inline ::PolynomialMod2 | operator- (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
inline ::PolynomialMod2 | operator* (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
inline ::PolynomialMod2 | operator/ (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
inline ::PolynomialMod2 | operator% (const ::PolynomialMod2 &a, const ::PolynomialMod2 &b) |
CRYPTOPP_DLL GF2NP * | BERDecodeGF2NP (BufferedTransformation &bt) |
template<> | |
void | swap (::PolynomialMod2 &a, ::PolynomialMod2 &b) |
Classes and functions for schemes over GF(2^n)
Definition in file gf2n.h.