Crypto++
Public Types | Public Member Functions | Protected Attributes
GF2NT Class Reference

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

#include <gf2n.h>

Inheritance diagram for GF2NT:
GF2NP QuotientRing< EuclideanDomainOf< PolynomialMod2 > >

List of all members.

Public Types

typedef T EuclideanDomain
typedef T::Element Element

Public Member Functions

 GF2NT (unsigned int t0, unsigned int t1, unsigned int t2)
GF2NPClone () const
void DEREncode (BufferedTransformation &bt) const
const Element & Multiply (const Element &a, const Element &b) const
const Element & Square (const Element &a) const
const Element & MultiplicativeInverse (const Element &a) 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
bool IsUnit (const Element &a) const
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
const EuclideanDomain & GetDomain () const
const Element & GetModulus () const
const Element & Identity () const
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
const Element & MultiplicativeIdentity () const
bool operator== (const QuotientRing< T > &rhs) const

Protected Attributes

unsigned int m
EuclideanDomain m_domain
Element m_modulus

Detailed Description

GF(2^n) with Trinomial Basis.


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