Crypto++ 8.8
Free C++ class library of cryptographic schemes
GF2NP Class Reference

GF(2^n) with Polynomial Basis. More...

#include <gf2n.h>

+ Inheritance diagram for GF2NP:

Public Member Functions

 GF2NP (const PolynomialMod2 &modulus)
 
virtual GF2NPClone () const
 
virtual void DEREncode (BufferedTransformation &bt) const
 
void DEREncodeElement (BufferedTransformation &out, const Element &a) const
 
void BERDecodeElement (BufferedTransformation &in, Element &a) const
 
bool Equal (const Element &a, const Element &b) const
 Compare two elements for equality.
 
bool IsUnit (const Element &a) const
 Determines whether an element is a unit in the group.
 
unsigned int MaxElementBitLength () const
 
unsigned int MaxElementByteLength () const
 
Element SquareRoot (const Element &a) const
 
Element HalfTrace (const Element &a) const
 
Element SolveQuadraticEquation (const Element &a) const
 
- Public Member Functions inherited from QuotientRing< EuclideanDomainOf< PolynomialMod2 > >
 QuotientRing (const EuclideanDomain &domain, const Element &modulus)
 
const EuclideanDomainGetDomain () const
 
const Element & GetModulus () const
 
bool Equal (const Element &a, const Element &b) const
 
const Element & Identity () const
 Provides the Identity element.
 
const Element & Add (const Element &a, const Element &b) const
 
Element & Accumulate (Element &a, const Element &b) const
 
const Element & Inverse (const Element &a) const
 
const Element & Subtract (const Element &a, const Element &b) const
 
Element & Reduce (Element &a, const Element &b) const
 
const Element & Double (const Element &a) const
 
bool IsUnit (const Element &a) const
 
const Element & MultiplicativeIdentity () const
 Retrieves the multiplicative identity.
 
const Element & Multiply (const Element &a, const Element &b) const
 
const Element & Square (const Element &a) const
 
const Element & MultiplicativeInverse (const Element &a) const
 
bool operator== (const QuotientRing< EuclideanDomainOf< PolynomialMod2 > > &rhs) const
 
- Public Member Functions inherited from AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >
 AbstractRing ()
 Construct an AbstractRing.
 
 AbstractRing (const AbstractRing &source)
 Copy construct an AbstractRing.
 
AbstractRingoperator= (const AbstractRing &source)
 Assign an AbstractRing.
 
virtual const Element & MultiplicativeInverse (const Element &a) const=0
 Calculate the multiplicative inverse of an element in the group.
 
virtual const Element & Divide (const Element &a, const Element &b) const
 Divides elements in the group.
 
virtual Element Exponentiate (const Element &a, const Integer &e) const
 Raises a base to an exponent in the group.
 
virtual Element CascadeExponentiate (const Element &x, const Integer &e1, const Element &y, const Integer &e2) const
 TODO.
 
virtual void SimultaneousExponentiate (Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const
 Exponentiates a base to multiple exponents in the Ring.
 
virtual const AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element > & MultiplicativeGroup () const
 Retrieves the multiplicative group.
 
- Public Member Functions inherited from AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >
virtual bool InversionIsFast () const
 Determine if inversion is fast.
 
virtual Element ScalarMultiply (const Element &a, const Integer &e) const
 Performs a scalar multiplication.
 
virtual Element CascadeScalarMultiply (const Element &x, const Integer &e1, const Element &y, const Integer &e2) const
 TODO.
 
virtual void SimultaneousMultiply (Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const
 Multiplies a base to multiple exponents in a group.
 

Additional Inherited Members

- Public Types inherited from QuotientRing< EuclideanDomainOf< PolynomialMod2 > >
typedef EuclideanDomainOf< PolynomialMod2EuclideanDomain
 
typedef EuclideanDomainOf< PolynomialMod2 >::Element Element
 
- Public Types inherited from AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >
typedef EuclideanDomainOf< PolynomialMod2 >::Element Element
 
- Public Types inherited from AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >
typedef EuclideanDomainOf< PolynomialMod2 >::Element Element
 

Detailed Description

GF(2^n) with Polynomial Basis.

Definition at line 296 of file gf2n.h.

Member Function Documentation

◆ Clone()

virtual GF2NP * GF2NP::Clone ( ) const
inlinevirtual

Definition at line 301 of file gf2n.h.

◆ DEREncode()

virtual void GF2NP::DEREncode ( BufferedTransformation & bt) const
inlinevirtual

Definition at line 302 of file gf2n.h.

◆ Equal()

bool GF2NP::Equal ( const Element & a,
const Element & b ) const
inlinevirtual

Compare two elements for equality.

Parameters
afirst element
bsecond element
Returns
true if the elements are equal, false otherwise

Equal() tests the elements for equality using a==b

Implements AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >.

Definition at line 308 of file gf2n.h.

◆ IsUnit()

bool GF2NP::IsUnit ( const Element & a) const
inlinevirtual

Determines whether an element is a unit in the group.

Parameters
athe element
Returns
true if the element is a unit after reduction, false otherwise.

Implements AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >.

Definition at line 311 of file gf2n.h.

◆ MaxElementBitLength()

unsigned int GF2NP::MaxElementBitLength ( ) const
inline

Definition at line 314 of file gf2n.h.

◆ MaxElementByteLength()

unsigned int GF2NP::MaxElementByteLength ( ) const
inline

Definition at line 317 of file gf2n.h.


The documentation for this class was generated from the following file: