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