|
Crypto++ 8.7
Free C++ class library of cryptographic schemes
|
This is the complete list of members for GF2NPP, including all inherited members.
| AbstractRing() | AbstractRing< T::Element > | inline |
| AbstractRing(const AbstractRing &source) | AbstractRing< T::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 (defined in GF2NP) | GF2NP | |
| CascadeExponentiate(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const | AbstractRing< T::Element > | virtual |
| CascadeScalarMultiply(const Element &x, const Integer &e1, const Element &y, const Integer &e2) const | AbstractGroup< T > | virtual |
| Clone() const (defined in GF2NPP) | GF2NPP | inlinevirtual |
| 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 | AbstractRing< T::Element > | virtual |
| Double(const Element &a) const | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | inlinevirtual |
| Equal(const Element &a, const Element &b) const | GF2NP | inlinevirtual |
| Exponentiate(const Element &a, const Integer &e) const | AbstractRing< T::Element > | virtual |
| 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 | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | inlinevirtual |
| Inverse(const Element &a) const | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | inlinevirtual |
| InversionIsFast() const | AbstractGroup< T > | inlinevirtual |
| IsUnit(const Element &a) const | GF2NP | inlinevirtual |
| MaxElementBitLength() const (defined in GF2NP) | GF2NP | inline |
| MaxElementByteLength() const (defined in GF2NP) | GF2NP | inline |
| MultiplicativeGroup() const | AbstractRing< T::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< T::Element > | inline |
| Reduce(Element &a, const Element &b) const | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | inlinevirtual |
| ScalarMultiply(const Element &a, const Integer &e) const | AbstractGroup< T > | virtual |
| SimultaneousExponentiate(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const | AbstractRing< T::Element > | virtual |
| SimultaneousMultiply(Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const | AbstractGroup< T > | virtual |
| SolveQuadraticEquation(const Element &a) const (defined in GF2NP) | GF2NP | |
| Square(const Element &a) const | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | inlinevirtual |
| SquareRoot(const Element &a) const (defined in GF2NP) | GF2NP | |
| Subtract(const Element &a, const Element &b) const | QuotientRing< EuclideanDomainOf< PolynomialMod2 > > | inlinevirtual |
| ~AbstractGroup() (defined in AbstractGroup< T >) | AbstractGroup< T > | inlinevirtual |
1.9.4