Crypto++  5.6.4
Free C++ class library of cryptographic schemes
GF2NP Member List

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

AbstractRing()AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >inline
AbstractRing(const AbstractRing &source)AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >inline
Accumulate(Element &a, const Element &b) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
Add(const Element &a, const Element &b) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
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 GF2NP)GF2NPinlinevirtual
DEREncode(BufferedTransformation &bt) const (defined in GF2NP)GF2NPinlinevirtual
DEREncodeElement(BufferedTransformation &out, const Element &a) const (defined in GF2NP)GF2NP
Divide(const Element &a, const Element &b) constAbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
Double(const Element &a) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
Element typedef (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >)QuotientRing< EuclideanDomainOf< PolynomialMod2 > >
Equal(const Element &a, const Element &b) const GF2NPinlinevirtual
EuclideanDomain typedef (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >)QuotientRing< EuclideanDomainOf< PolynomialMod2 > >
Exponentiate(const Element &a, const Integer &e) constAbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >virtual
GetDomain() const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >)QuotientRing< EuclideanDomainOf< PolynomialMod2 > >inline
GetModulus() const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >)QuotientRing< EuclideanDomainOf< PolynomialMod2 > >inline
GF2NP(const PolynomialMod2 &modulus) (defined in GF2NP)GF2NP
HalfTrace(const Element &a) const (defined in GF2NP)GF2NP
Identity() constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
Inverse(const Element &a) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
InversionIsFast() constAbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >inlinevirtual
IsUnit(const Element &a) const GF2NPinlinevirtual
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) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >virtual
Multiply(const Element &a, const Element &b) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
operator=(const AbstractRing &source)AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >inline
operator==(const QuotientRing< EuclideanDomainOf< PolynomialMod2 > > &rhs) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >)QuotientRing< EuclideanDomainOf< PolynomialMod2 > >inline
QuotientRing(const EuclideanDomain &domain, const Element &modulus) (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >)QuotientRing< EuclideanDomainOf< PolynomialMod2 > >inline
Reduce(Element &a, const Element &b) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
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) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
SquareRoot(const Element &a) const (defined in GF2NP)GF2NP
Subtract(const Element &a, const Element &b) constQuotientRing< EuclideanDomainOf< PolynomialMod2 > >inlinevirtual
~AbstractGroup() (defined in AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >)AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >inlinevirtual