|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
Description
| Interface Summary | |
| GFElement | This interface defines a finite field element. |
| Class Summary | |
| GF2nElement | This abstract class implements an element of the finite field GF(2)n in either optimal normal basis representation (ONB) or in polynomial representation. |
| GF2nField | This abstract class defines the finite field GF(2n). |
| GF2nONBElement | This class implements an element of the finite field GF(2n ). |
| GF2nONBField | This class implements the abstract class GF2nField for ONB representation. |
| GF2nPolynomial | This class implements polynomials over GF2nElements. |
| GF2nPolynomialElement | This class implements elements of finite binary fields GF(2n) using polynomial representation. |
| GF2nPolynomialField | This class implements the abstract class GF2nField for polynomial representation. |
| GF2Polynomial | This class stores very long strings of bits and does some basic arithmetics. |
| GFPElement | This class implements an element of the finite field GF(p), where p is a large prime. |
This package holds classes representing elements of prime fields (GF(p), p prime) and finite fields with characteristic 2 (GF(2n), n integer), their arithmetic and the fields itself. Elements of GF(2n) can be stored using two different representations: Optimal Normal Basis (ONB) and Polynomial Representation using the corresponding classes GF2nONBElement respectively GF2nPolynomialElement.
The class Bitstring is used to store long strings of Bits and doing some basis arithmetics with them
Additionally the class PolynomialGF2n deals with Polynomials over GF2nElements.
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||