Crypto++ 8.8
Free C++ class library of cryptographic schemes
GF2NT Member List

This is the complete list of members for GF2NT, including all inherited members.

AbstractRing()AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >inline
AbstractRing(const AbstractRing &source)AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >inline
BERDecodeElement(BufferedTransformation &in, Element &a) const (defined in GF2NP)GF2NP
CascadeExponentiate(const Element &x, const Integer &e1, const Element &y, const Integer &e2) constAbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
CascadeScalarMultiply(const Element &x, const Integer &e1, const Element &y, const Integer &e2) constAbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
Clone() const (defined in GF2NT)GF2NTinlinevirtual
DEREncode(BufferedTransformation &bt) const (defined in GF2NT)GF2NTvirtual
DEREncodeElement(BufferedTransformation &out, const Element &a) const (defined in GF2NP)GF2NP
Divide(const Element &a, const Element &b) constAbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
Equal(const Element &a, const Element &b) constGF2NPinlinevirtual
Exponentiate(const Element &a, const Integer &e) constAbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
GF2NP(const PolynomialMod2 &modulus) (defined in GF2NP)GF2NP
GF2NT(unsigned int t0, unsigned int t1, unsigned int t2) (defined in GF2NT)GF2NT
HalfTrace(const Element &a) const (defined in GF2NP)GF2NP
Identity() constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
InversionIsFast() constAbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >inlinevirtual
IsUnit(const Element &a) constGF2NPinlinevirtual
MaxElementBitLength() const (defined in GF2NP)GF2NPinline
MaxElementByteLength() const (defined in GF2NP)GF2NPinline
MultiplicativeGroup() constAbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >inlinevirtual
MultiplicativeIdentity() constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
MultiplicativeInverse(const Element &a) constGF2NTvirtual
Multiply(const Element &a, const Element &b) constGF2NTvirtual
operator=(const AbstractRing &source)AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >inline
ScalarMultiply(const Element &a, const Integer &e) constAbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) constAbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
SimultaneousMultiply(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) constAbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
SolveQuadraticEquation(const Element &a) const (defined in GF2NP)GF2NP
Square(const Element &a) constGF2NTinlinevirtual
SquareRoot(const Element &a) const (defined in GF2NP)GF2NP