GF2NT Member List

This is the complete list of members for GF2NT, 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) 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	GF2NT	inlinevirtual
DEREncode(BufferedTransformation &bt) const	GF2NT	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
GF2NT(unsigned int t0, unsigned int t1, unsigned int t2)	GF2NT
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	GF2NT	virtual
Multiply(const Element &a, const Element &b) const	GF2NT	virtual
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
Reduced(const Element &a) const	GF2NT	private
result	GF2NT	mutableprivate
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	GF2NT	inlinevirtual
SquareRoot(const Element &a) const	GF2NP
Subtract(const Element &a, const Element &b) const	QuotientRing< EuclideanDomainOf< PolynomialMod2 > >	inlinevirtual
t0	GF2NT	private
t1	GF2NT	private
~AbstractGroup()	AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >	inlinevirtual