Crypto++  8.2
Free C++ class library of cryptographic schemes
Classes | Functions | Variables
gf2n.h File Reference

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
 Excpetion 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 *CRYPTOPP_API BERDecodeGF2NP (BufferedTransformation &bt)
 
template<>
void swap (::PolynomialMod2 &a, ::PolynomialMod2 &b)
 

Variables

CRYPTOPP_DLL_TEMPLATE_CLASS AbstractGroup< PolynomialMod2 >
 
CRYPTOPP_DLL_TEMPLATE_CLASS AbstractRing< PolynomialMod2 >
 
CRYPTOPP_DLL_TEMPLATE_CLASS AbstractEuclideanDomain< PolynomialMod2 >
 
CRYPTOPP_DLL_TEMPLATE_CLASS EuclideanDomainOf< PolynomialMod2 >
 
CRYPTOPP_DLL_TEMPLATE_CLASS QuotientRing< EuclideanDomainOf< PolynomialMod2 > >
 

Detailed Description

Classes and functions for schemes over GF(2^n)

Definition in file gf2n.h.