|
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.