|
Crypto++ 8.9
Free C++ class library of cryptographic schemes
|
This is the complete list of members for PolynomialMod2, including all inherited members.
| AllOnes(size_t n) | PolynomialMod2 | static |
| And(const PolynomialMod2 &b) const (defined in PolynomialMod2) | PolynomialMod2 | |
| BERDecodeAsOctetString(BufferedTransformation &bt, size_t length) | PolynomialMod2 | |
| BitCount() const | PolynomialMod2 | |
| ByteCount() const | PolynomialMod2 | |
| CoefficientCount() const | PolynomialMod2 | inline |
| Decode(const byte *input, size_t inputLen) (defined in PolynomialMod2) | PolynomialMod2 | |
| Decode(BufferedTransformation &bt, size_t inputLen) (defined in PolynomialMod2) | PolynomialMod2 | |
| Degree() const | PolynomialMod2 | inline |
| DEREncodeAsOctetString(BufferedTransformation &bt, size_t length) const | PolynomialMod2 | |
| Divide(PolynomialMod2 &r, PolynomialMod2 &q, const PolynomialMod2 &a, const PolynomialMod2 &d) | PolynomialMod2 | static |
| DividedBy(const PolynomialMod2 &b) const (defined in PolynomialMod2) | PolynomialMod2 | |
| Doubled() const | PolynomialMod2 | inline |
| Encode(byte *output, size_t outputLen) const | PolynomialMod2 | |
| Encode(BufferedTransformation &bt, size_t outputLen) const (defined in PolynomialMod2) | PolynomialMod2 | |
| Equals(const PolynomialMod2 &rhs) const (defined in PolynomialMod2) | PolynomialMod2 | |
| Gcd(const PolynomialMod2 &a, const PolynomialMod2 &n) | PolynomialMod2 | static |
| GetBit(size_t n) const | PolynomialMod2 | inline |
| GetByte(size_t n) const | PolynomialMod2 | |
| GetCoefficient(size_t i) const | PolynomialMod2 | inline |
| GF2NT (defined in PolynomialMod2) | PolynomialMod2 | friend |
| GF2NT233 (defined in PolynomialMod2) | PolynomialMod2 | friend |
| InverseMod(const PolynomialMod2 &) const | PolynomialMod2 | |
| IsIrreducible() const | PolynomialMod2 | |
| IsUnit() const | PolynomialMod2 | inline |
| IsZero() const (defined in PolynomialMod2) | PolynomialMod2 | inline |
| MinEncodedSize() const | PolynomialMod2 | inline |
| Minus(const PolynomialMod2 &b) const (defined in PolynomialMod2) | PolynomialMod2 | inline |
| Modulo(const PolynomialMod2 &b) const (defined in PolynomialMod2) | PolynomialMod2 | |
| Monomial(size_t i) | PolynomialMod2 | static |
| MultiplicativeInverse() const | PolynomialMod2 | inline |
| One() | PolynomialMod2 | static |
| operator!() const (defined in PolynomialMod2) | PolynomialMod2 | |
| operator%=(const PolynomialMod2 &t) (defined in PolynomialMod2) | PolynomialMod2 | |
| operator&=(const PolynomialMod2 &t) (defined in PolynomialMod2) | PolynomialMod2 | |
| operator*=(const PolynomialMod2 &t) (defined in PolynomialMod2) | PolynomialMod2 | |
| operator+() const (defined in PolynomialMod2) | PolynomialMod2 | inline |
| operator+=(const PolynomialMod2 &t) (defined in PolynomialMod2) | PolynomialMod2 | inline |
| operator-() const (defined in PolynomialMod2) | PolynomialMod2 | inline |
| operator-=(const PolynomialMod2 &t) (defined in PolynomialMod2) | PolynomialMod2 | inline |
| operator/=(const PolynomialMod2 &t) (defined in PolynomialMod2) | PolynomialMod2 | |
| operator<<(unsigned int n) const (defined in PolynomialMod2) | PolynomialMod2 | |
| operator<< (defined in PolynomialMod2) | PolynomialMod2 | friend |
| operator<<=(unsigned int) (defined in PolynomialMod2) | PolynomialMod2 | |
| operator=(const PolynomialMod2 &t) (defined in PolynomialMod2) | PolynomialMod2 | |
| operator>>(unsigned int n) const (defined in PolynomialMod2) | PolynomialMod2 | |
| operator>>=(unsigned int) (defined in PolynomialMod2) | PolynomialMod2 | |
| operator[](unsigned int i) const | PolynomialMod2 | inline |
| operator^=(const PolynomialMod2 &t) (defined in PolynomialMod2) | PolynomialMod2 | |
| Parity() const | PolynomialMod2 | |
| Pentanomial(size_t t0, size_t t1, size_t t2, size_t t3, size_t t4) | PolynomialMod2 | static |
| Plus(const PolynomialMod2 &b) const (defined in PolynomialMod2) | PolynomialMod2 | inline |
| PolynomialMod2() | PolynomialMod2 | |
| PolynomialMod2(const PolynomialMod2 &t) | PolynomialMod2 | |
| PolynomialMod2(word value, size_t bitLength=WORD_BITS) | PolynomialMod2 | |
| PolynomialMod2(const byte *encodedPoly, size_t byteCount) | PolynomialMod2 | inline |
| PolynomialMod2(BufferedTransformation &encodedPoly, size_t byteCount) | PolynomialMod2 | inline |
| PolynomialMod2(RandomNumberGenerator &rng, size_t bitcount) | PolynomialMod2 | inline |
| RandomizationParameter typedef (defined in PolynomialMod2) | PolynomialMod2 | |
| Randomize(RandomNumberGenerator &rng, size_t bitcount) (defined in PolynomialMod2) | PolynomialMod2 | |
| SetBit(size_t i, int value=1) (defined in PolynomialMod2) | PolynomialMod2 | |
| SetByte(size_t n, byte value) | PolynomialMod2 | |
| SetCoefficient(size_t i, int value) (defined in PolynomialMod2) | PolynomialMod2 | inline |
| Squared() const (defined in PolynomialMod2) | PolynomialMod2 | |
| swap(PolynomialMod2 &a) (defined in PolynomialMod2) | PolynomialMod2 | inline |
| Times(const PolynomialMod2 &b) const (defined in PolynomialMod2) | PolynomialMod2 | |
| Trinomial(size_t t0, size_t t1, size_t t2) | PolynomialMod2 | static |
| WordCount() const | PolynomialMod2 | |
| Xor(const PolynomialMod2 &b) const (defined in PolynomialMod2) | PolynomialMod2 | |
| Zero() | PolynomialMod2 | static |
1.10.0