Uses of Package
org.bouncycastle.pqc.legacy.math.linearalgebra
Packages that use org.bouncycastle.pqc.legacy.math.linearalgebra
Package
Description
-
Classes in org.bouncycastle.pqc.legacy.math.linearalgebra used by org.bouncycastle.pqc.asn1ClassDescriptionThis 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)This class describes operations with elements from the finite field F = GF(2^m). ( GF(2^m)= GF(2)[A] where A is a root of irreducible polynomial with degree m, each field element B has a polynomial basis representation, i.e. it is represented by a different binary polynomial of degree less than m, B = poly(A) ) All operations are defined only for field with 1< m <32.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.This class describes operations with polynomials from the ring R = GF(2^m)[X], where 2 <= m <=31.
-
Classes in org.bouncycastle.pqc.legacy.math.linearalgebra used by org.bouncycastle.pqc.jcajce.provider.mcelieceClassDescriptionThis 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)This class describes operations with elements from the finite field F = GF(2^m). ( GF(2^m)= GF(2)[A] where A is a root of irreducible polynomial with degree m, each field element B has a polynomial basis representation, i.e. it is represented by a different binary polynomial of degree less than m, B = poly(A) ) All operations are defined only for field with 1< m <32.This class implements the abstract class Vector for the case of vectors over the finite field GF(2).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.This class describes operations with polynomials from the ring R = GF(2^m)[X], where 2 <= m <=31.
-
Classes in org.bouncycastle.pqc.legacy.math.linearalgebra used by org.bouncycastle.pqc.legacy.crypto.mcelieceClassDescriptionThis 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)This class describes operations with elements from the finite field F = GF(2^m). ( GF(2^m)= GF(2)[A] where A is a root of irreducible polynomial with degree m, each field element B has a polynomial basis representation, i.e. it is represented by a different binary polynomial of degree less than m, B = poly(A) ) All operations are defined only for field with 1< m <32.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.This class describes operations with polynomials from the ring R = GF(2^m)[X], where 2 <= m <=31.
-
Classes in org.bouncycastle.pqc.legacy.math.linearalgebra used by org.bouncycastle.pqc.legacy.math.linearalgebraClassDescriptionThis 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)This class describes operations with elements from the finite field F = GF(2^m). ( GF(2^m)= GF(2)[A] where A is a root of irreducible polynomial with degree m, each field element B has a polynomial basis representation, i.e. it is represented by a different binary polynomial of degree less than m, B = poly(A) ) All operations are defined only for field with 1< m <32.This class describes some operations with matrices over finite field GF(2m) with small m (1< m <32).This class implements vectors over the finite field GF(2m) for small m (i.e., 1<m<32).This abstract class implements an element of the finite field GF(2)n in either optimal normal basis representation (ONB) or in polynomial representation.This abstract class defines the finite field GF(2n).This class implements an element of the finite field GF(2n ).This class implements the abstract class GF2nField for ONB representation.This class implements polynomials over GF2nElements.This class implements elements of finite binary fields GF(2n) using polynomial representation.This class implements the abstract class GF2nField for polynomial representation.This class stores very long strings of bits and does some basic arithmetics.This class implements the abstract class Vector for the case of vectors over the finite field GF(2).This interface defines a finite field element.This class is a container for two instances of
GF2Matrixand one instance ofPermutation.This abstract class defines matrices.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.This class describes operations with polynomials from the ring R = GF(2^m)[X], where 2 <= m <=31.This abstract class defines vectors.