Class and Description |
---|
GF2Matrix
This class describes some operations with matrices over finite field GF(2)
and is used in ecc and MQ-PKC (also has some specific methods and
implementation)
|
GF2mField
This class describes operations with elements from the finite field F =
GF(2^m).
|
Permutation
This class implements permutations of the set {0,1,...,n-1} for some given n
> 0, i.e., ordered sequences containing each number m (0 <=
m < n)
once and only once.
|
PolynomialGF2mSmallM
This class describes operations with polynomials from the ring R =
GF(2^m)[X], where 2 <= m <=31.
|
Class and Description |
---|
GF2Matrix
This class describes some operations with matrices over finite field GF(2)
and is used in ecc and MQ-PKC (also has some specific methods and
implementation)
|
GF2mField
This class describes operations with elements from the finite field F =
GF(2^m).
|
Permutation
This class implements permutations of the set {0,1,...,n-1} for some given n
> 0, i.e., ordered sequences containing each number m (0 <=
m < n)
once and only once.
|
PolynomialGF2mSmallM
This class describes operations with polynomials from the ring R =
GF(2^m)[X], where 2 <= m <=31.
|
Class and Description |
---|
GF2Matrix
This class describes some operations with matrices over finite field GF(2)
and is used in ecc and MQ-PKC (also has some specific methods and
implementation)
|
GF2mField
This class describes operations with elements from the finite field F =
GF(2^m).
|
GF2Vector
This class implements the abstract class Vector for the case of
vectors over the finite field GF(2).
|
Permutation
This class implements permutations of the set {0,1,...,n-1} for some given n
> 0, i.e., ordered sequences containing each number m (0 <=
m < n)
once and only once.
|
PolynomialGF2mSmallM
This class describes operations with polynomials from the ring R =
GF(2^m)[X], where 2 <= m <=31.
|
Class and Description |
---|
GF2Matrix
This class describes some operations with matrices over finite field GF(2)
and is used in ecc and MQ-PKC (also has some specific methods and
implementation)
|
GF2mField
This class describes operations with elements from the finite field F =
GF(2^m).
|
GF2mMatrix
This class describes some operations with matrices over finite field GF(2m)
with small m (1< m <32).
|
GF2mVector
This class implements vectors over the finite field
GF(2m) for small m (i.e.,
1<m<32).
|
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.
|
GF2Vector
This class implements the abstract class Vector for the case of
vectors over the finite field GF(2).
|
GFElement
This interface defines a finite field element.
|
GoppaCode.MaMaPe
This class is a container for two instances of
GF2Matrix and one
instance of Permutation . |
Matrix
This abstract class defines matrices.
|
Permutation
This class implements permutations of the set {0,1,...,n-1} for some given n
> 0, i.e., ordered sequences containing each number m (0 <=
m < n)
once and only once.
|
PolynomialGF2mSmallM
This class describes operations with polynomials from the ring R =
GF(2^m)[X], where 2 <= m <=31.
|
Vector
This abstract class defines vectors.
|
Copyright © 2020 BouncyCastle.org. All rights reserved.