Crypto++ 8.9
Free C++ class library of cryptographic schemes
GF2NT233 Member List

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

AbstractRing()AbstractRing< T::Element >inline
AbstractRing(const AbstractRing &source)AbstractRing< T::Element >inline
AbstractRing< T::Element >::Accumulate(Element &a, const Element &b) constAbstractGroup< T >virtual
AbstractRing< T::Element >::Add(const Element &a, const Element &b) const =0AbstractGroup< T >pure virtual
BERDecodeElement(BufferedTransformation &in, Element &a) const (defined in GF2NP)GF2NP
CascadeExponentiate(const Element &x, const Integer &e1, const Element &y, const Integer &e2) constAbstractRing< T::Element >virtual
CascadeScalarMultiply(const Element &x, const Integer &e1, const Element &y, const Integer &e2) constAbstractGroup< T >virtual
Clone() const (defined in GF2NT233)GF2NT233inlinevirtual
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< T::Element >virtual
AbstractRing< T::Element >::Double(const Element &a) constAbstractGroup< T >virtual
Equal(const Element &a, const Element &b) const (defined in GF2NP)GF2NPinline
AbstractRing< T::Element >::Equal(const Element &a, const Element &b) const =0AbstractGroup< T >pure virtual
Exponentiate(const Element &a, const Integer &e) constAbstractRing< T::Element >virtual
GF2NP(const PolynomialMod2 &modulus) (defined in GF2NP)GF2NP
GF2NT(unsigned int t0, unsigned int t1, unsigned int t2) (defined in GF2NT)GF2NT
GF2NT233(unsigned int t0, unsigned int t1, unsigned int t2) (defined in GF2NT233)GF2NT233
HalfTrace(const Element &a) const (defined in GF2NP)GF2NP
Identity() constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
AbstractRing< T::Element >::Inverse(const Element &a) const =0AbstractGroup< T >pure virtual
InversionIsFast() constAbstractGroup< T >inlinevirtual
IsUnit(const Element &a) const (defined in GF2NP)GF2NPinline
AbstractRing< T::Element >::IsUnit(const Element &a) const=0AbstractRing< T::Element >pure virtual
MaxElementBitLength() const (defined in GF2NP)GF2NPinline
MaxElementByteLength() const (defined in GF2NP)GF2NPinline
MultiplicativeGroup() constAbstractRing< T::Element >inlinevirtual
MultiplicativeIdentity() constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
MultiplicativeInverse(const Element &a) const (defined in GF2NT)GF2NT
AbstractRing< T::Element >::MultiplicativeInverse(const Element &a) const=0AbstractRing< T::Element >pure virtual
Multiply(const Element &a, const Element &b) const (defined in GF2NT233)GF2NT233
AbstractRing< T::Element >::Multiply(const Element &a, const Element &b) const=0AbstractRing< T::Element >pure virtual
operator=(const AbstractRing &source)AbstractRing< T::Element >inline
AbstractRing< T::Element >::Reduce(Element &a, const Element &b) constAbstractGroup< T >virtual
ScalarMultiply(const Element &a, const Integer &e) constAbstractGroup< T >virtual
SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) constAbstractRing< T::Element >virtual
SimultaneousMultiply(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) constAbstractGroup< T >virtual
SolveQuadraticEquation(const Element &a) const (defined in GF2NP)GF2NP
Square(const Element &a) const (defined in GF2NT233)GF2NT233
AbstractRing< T::Element >::Square(const Element &a) constAbstractRing< T::Element >virtual
SquareRoot(const Element &a) const (defined in GF2NP)GF2NP
AbstractRing< T::Element >::Subtract(const Element &a, const Element &b) constAbstractGroup< T >virtual
~AbstractGroup() (defined in AbstractGroup< T >)AbstractGroup< T >inlinevirtual