Security Scol plugin
|
Classes and functions for schemes over GF(2^n) More...
#include "cryptlib.h"
#include "secblock.h"
#include "algebra.h"
#include "misc.h"
#include "asn.h"
#include <iosfwd>
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 CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
bool | operator!= (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
bool | operator> (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
compares degree | |
bool | operator>= (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
compares degree | |
bool | operator< (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
compares degree | |
bool | operator<= (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
compares degree | |
CryptoPP::PolynomialMod2 | operator& (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
CryptoPP::PolynomialMod2 | operator^ (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
CryptoPP::PolynomialMod2 | operator+ (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
CryptoPP::PolynomialMod2 | operator- (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
CryptoPP::PolynomialMod2 | operator* (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
CryptoPP::PolynomialMod2 | operator/ (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
CryptoPP::PolynomialMod2 | operator% (const CryptoPP::PolynomialMod2 &a, const CryptoPP::PolynomialMod2 &b) |
CRYPTOPP_DLL GF2NP *CRYPTOPP_API | BERDecodeGF2NP (BufferedTransformation &bt) |
template<> | |
NAMESPACE_END void | swap (CryptoPP::PolynomialMod2 &a, CryptoPP::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 > > |
Classes and functions for schemes over GF(2^n)
Definition in file gf2n.h.
CRYPTOPP_DLL GF2NP *CRYPTOPP_API BERDecodeGF2NP | ( | BufferedTransformation & | bt | ) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
CRYPTOPP_DLL_TEMPLATE_CLASS AbstractEuclideanDomain< PolynomialMod2 > |
CRYPTOPP_DLL_TEMPLATE_CLASS AbstractGroup< PolynomialMod2 > |
CRYPTOPP_DLL_TEMPLATE_CLASS AbstractRing< PolynomialMod2 > |
CRYPTOPP_DLL_TEMPLATE_CLASS EuclideanDomainOf< PolynomialMod2 > |
CRYPTOPP_DLL_TEMPLATE_CLASS QuotientRing< EuclideanDomainOf< PolynomialMod2 > > |