# GF2NPP Member List

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

AbstractRing() (defined in AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element > | `[inline]`
AbstractRing(const AbstractRing &source) (defined in AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element > | `[inline]`
Accumulate(Element &a, const Element &b) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
Add(const Element &a, const Element &b) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
BERDecodeElement(BufferedTransformation &in, Element &a) const (defined in GF2NP) | GF2NP |
CascadeExponentiate(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const (defined in AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element > | `[virtual]`
CascadeScalarMultiply(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const (defined in AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element > | `[virtual]`
Clone() const (defined in GF2NPP) | GF2NPP | `[inline, virtual]`
DEREncode(BufferedTransformation &bt) const (defined in GF2NPP) | GF2NPP | `[virtual]`
DEREncodeElement(BufferedTransformation &out, const Element &a) const (defined in GF2NP) | GF2NP |
Divide(const Element &a, const Element &b) const (defined in AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element > | `[virtual]`
Double(const Element &a) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
Element typedef (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > |
Equal(const Element &a, const Element &b) const (defined in GF2NP) | GF2NP | `[inline]`
Equal(const Element &a, const Element &b) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
EuclideanDomain typedef (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > |
Exponentiate(const Element &a, const Integer &e) const (defined in AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractRing< 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 |
GF2NPP(unsigned int t0, unsigned int t1, unsigned int t2, unsigned int t3, unsigned int t4) (defined in GF2NPP) | GF2NPP | `[inline]`
HalfTrace(const Element &a) const (defined in GF2NP) | GF2NP |
Identity() const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
Inverse(const Element &a) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
InversionIsFast() const (defined in AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element > | `[inline, virtual]`
IsUnit(const Element &a) const (defined in GF2NP) | GF2NP | `[inline]`
IsUnit(const Element &a) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
m (defined in GF2NP) | GF2NP | `[protected]`
m_domain (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[protected]`
m_modulus (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[protected]`
MaxElementBitLength() const (defined in GF2NP) | GF2NP | `[inline]`
MaxElementByteLength() const (defined in GF2NP) | GF2NP | `[inline]`
MultiplicativeGroup() const (defined in AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element > | `[inline, virtual]`
MultiplicativeIdentity() const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
MultiplicativeInverse(const Element &a) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[virtual]`
Multiply(const Element &a, const Element &b) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
operator=(const AbstractRing &source) (defined in AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >) | 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) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
ScalarMultiply(const Element &a, const Integer &e) const (defined in AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element > | `[virtual]`
SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const (defined in AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element > | `[virtual]`
SimultaneousMultiply(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const (defined in AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element > | `[virtual]`
SolveQuadraticEquation(const Element &a) const (defined in GF2NP) | GF2NP |
Square(const Element &a) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
SquareRoot(const Element &a) const (defined in GF2NP) | GF2NP |
Subtract(const Element &a, const Element &b) const (defined in QuotientRing< EuclideanDomainOf< PolynomialMod2 > >) | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | `[inline, virtual]`
~AbstractGroup() (defined in AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >) | AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element > | `[inline, virtual]`