Fabcoin Core  0.16.2
P2P Digital Currency
Public Member Functions | Private Member Functions | Private Attributes | List of all members
GF2NT Class Reference

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

#include <gf2n.h>

Inheritance diagram for GF2NT:
[legend]
Collaboration diagram for GF2NT:
[legend]

Public Member Functions

 GF2NT (unsigned int t0, unsigned int t1, unsigned int t2)
 
GF2NPClone () const
 
void DEREncode (BufferedTransformation &bt) const
 
const ElementMultiply (const Element &a, const Element &b) const
 Multiplies elements in the group. More...
 
const ElementSquare (const Element &a) const
 Square an element in the group. More...
 
const ElementMultiplicativeInverse (const Element &a) const
 Calculate the multiplicative inverse of an element in the group. More...
 
- Public Member Functions inherited from GF2NP
 GF2NP (const PolynomialMod2 &modulus)
 
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. More...
 
bool IsUnit (const Element &a) const
 Determines whether an element is a unit in the group. More...
 
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 ElementGetModulus () const
 
bool Equal (const Element &a, const Element &b) const
 Compare two elements for equality. More...
 
const ElementIdentity () const
 Provides the Identity element. More...
 
const ElementAdd (const Element &a, const Element &b) const
 Adds elements in the group. More...
 
ElementAccumulate (Element &a, const Element &b) const
 TODO. More...
 
const ElementInverse (const Element &a) const
 Inverts the element in the group. More...
 
const ElementSubtract (const Element &a, const Element &b) const
 Subtracts elements in the group. More...
 
ElementReduce (Element &a, const Element &b) const
 Reduces an element in the congruence class. More...
 
const ElementDouble (const Element &a) const
 Doubles an element in the group. More...
 
bool IsUnit (const Element &a) const
 Determines whether an element is a unit in the group. More...
 
const ElementMultiplicativeIdentity () const
 Retrieves the multiplicative identity. More...
 
const ElementMultiply (const Element &a, const Element &b) const
 Multiplies elements in the group. More...
 
const ElementSquare (const Element &a) const
 Square an element in the group. More...
 
const ElementMultiplicativeInverse (const Element &a) const
 Calculate the multiplicative inverse of an element in the group. More...
 
bool operator== (const QuotientRing< EuclideanDomainOf< PolynomialMod2 > > &rhs) const
 
- Public Member Functions inherited from AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >
 AbstractRing ()
 Construct an AbstractRing. More...
 
 AbstractRing (const AbstractRing &source)
 Copy construct an AbstractRing. More...
 
AbstractRingoperator= (const AbstractRing &source)
 Assign an AbstractRing. More...
 
virtual const ElementDivide (const Element &a, const Element &b) const
 Divides elements in the group. More...
 
virtual Element Exponentiate (const Element &a, const Integer &e) const
 Raises a base to an exponent in the group. More...
 
virtual Element CascadeExponentiate (const Element &x, const Integer &e1, const Element &y, const Integer &e2) const
 TODO. More...
 
virtual void SimultaneousExponentiate (Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const
 Exponentiates a base to multiple exponents in the Ring. More...
 
virtual const AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element > & MultiplicativeGroup () const
 Retrieves the multiplicative group. More...
 
- Public Member Functions inherited from AbstractGroup< EuclideanDomainOf< PolynomialMod2 >::Element >
virtual ~AbstractGroup ()
 
virtual bool InversionIsFast () const
 Determine if inversion is fast. More...
 
virtual Element ScalarMultiply (const Element &a, const Integer &e) const
 Performs a scalar multiplication. More...
 
virtual Element CascadeScalarMultiply (const Element &x, const Integer &e1, const Element &y, const Integer &e2) const
 TODO. More...
 
virtual void SimultaneousMultiply (Element *results, const Element &base, const Integer *exponents, unsigned int exponentsCount) const
 Multiplies a base to multiple exponents in a group. More...
 

Private Member Functions

const ElementReduced (const Element &a) const
 

Private Attributes

unsigned int t0
 
unsigned int t1
 
PolynomialMod2 result
 

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
 
- Protected Attributes inherited from GF2NP
unsigned int m
 
- Protected Attributes inherited from QuotientRing< EuclideanDomainOf< PolynomialMod2 > >
EuclideanDomain m_domain
 
Element m_modulus
 

Detailed Description

GF(2^n) with Trinomial Basis.

Definition at line 326 of file gf2n.h.

Constructor & Destructor Documentation

GF2NT::GF2NT ( unsigned int  t0,
unsigned int  t1,
unsigned int  t2 
)

Definition at line 604 of file gf2n.cpp.

Here is the caller graph for this function:

Member Function Documentation

GF2NP* GF2NT::Clone ( ) const
inlinevirtual

Reimplemented from GF2NP.

Definition at line 332 of file gf2n.h.

Here is the call graph for this function:

void GF2NT::DEREncode ( BufferedTransformation bt) const
virtual

Reimplemented from GF2NP.

Definition at line 847 of file gf2n.cpp.

Here is the call graph for this function:

const GF2NT::Element & GF2NT::MultiplicativeInverse ( const Element a) const
virtual

Calculate the multiplicative inverse of an element in the group.

Parameters
athe element

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

Definition at line 612 of file gf2n.cpp.

Here is the call graph for this function:

const GF2NT::Element & GF2NT::Multiply ( const Element a,
const Element b 
) const
virtual

Multiplies elements in the group.

Parameters
athe multiplicand
bthe multiplier
Returns
the product of a and b

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

Definition at line 757 of file gf2n.cpp.

Here is the call graph for this function:

const GF2NT::Element & GF2NT::Reduced ( const Element a) const
private

Definition at line 783 of file gf2n.cpp.

Here is the call graph for this function:

const Element& GF2NT::Square ( const Element a) const
inlinevirtual

Square an element in the group.

Parameters
athe element
Returns
the element squared

Reimplemented from AbstractRing< EuclideanDomainOf< PolynomialMod2 >::Element >.

Definition at line 337 of file gf2n.h.

Member Data Documentation

PolynomialMod2 GF2NT::result
mutableprivate

Definition at line 346 of file gf2n.h.

unsigned int GF2NT::t0
private

Definition at line 345 of file gf2n.h.

unsigned int GF2NT::t1
private

Definition at line 345 of file gf2n.h.


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