Uses of Class
org.bouncycastle.pqc.legacy.math.linearalgebra.PolynomialGF2mSmallM
Packages that use PolynomialGF2mSmallM
Package
Description
-
Uses of PolynomialGF2mSmallM in org.bouncycastle.pqc.asn1
Methods in org.bouncycastle.pqc.asn1 that return PolynomialGF2mSmallMModifier and TypeMethodDescriptionMcElieceCCA2PrivateKey.getGoppaPoly()McEliecePrivateKey.getGoppaPoly()Constructors in org.bouncycastle.pqc.asn1 with parameters of type PolynomialGF2mSmallMModifierConstructorDescriptionMcElieceCCA2PrivateKey(int n, int k, GF2mField field, PolynomialGF2mSmallM goppaPoly, Permutation p, AlgorithmIdentifier digest) McEliecePrivateKey(int n, int k, GF2mField field, PolynomialGF2mSmallM goppaPoly, Permutation p1, Permutation p2, GF2Matrix sInv) -
Uses of PolynomialGF2mSmallM in org.bouncycastle.pqc.jcajce.provider.mceliece
Methods in org.bouncycastle.pqc.jcajce.provider.mceliece that return PolynomialGF2mSmallMModifier and TypeMethodDescriptionBCMcElieceCCA2PrivateKey.getGoppaPoly()BCMcEliecePrivateKey.getGoppaPoly()BCMcElieceCCA2PrivateKey.getQInv()BCMcEliecePrivateKey.getQInv() -
Uses of PolynomialGF2mSmallM in org.bouncycastle.pqc.legacy.crypto.mceliece
Methods in org.bouncycastle.pqc.legacy.crypto.mceliece that return PolynomialGF2mSmallMModifier and TypeMethodDescriptionMcElieceCCA2PrivateKeyParameters.getGoppaPoly()McEliecePrivateKeyParameters.getGoppaPoly()McElieceCCA2PrivateKeyParameters.getQInv()McEliecePrivateKeyParameters.getQInv()Constructors in org.bouncycastle.pqc.legacy.crypto.mceliece with parameters of type PolynomialGF2mSmallMModifierConstructorDescriptionMcElieceCCA2PrivateKeyParameters(int n, int k, GF2mField field, PolynomialGF2mSmallM gp, GF2Matrix canonicalCheckMatrix, Permutation p, String digest) Constructor.McElieceCCA2PrivateKeyParameters(int n, int k, GF2mField field, PolynomialGF2mSmallM gp, Permutation p, String digest) Constructor.McEliecePrivateKeyParameters(int n, int k, GF2mField field, PolynomialGF2mSmallM gp, Permutation p1, Permutation p2, GF2Matrix sInv) Constructor. -
Uses of PolynomialGF2mSmallM in org.bouncycastle.pqc.legacy.math.linearalgebra
Fields in org.bouncycastle.pqc.legacy.math.linearalgebra declared as PolynomialGF2mSmallMModifier and TypeFieldDescriptionprotected PolynomialGF2mSmallM[]PolynomialRingGF2m.sqMatrixthe squaring matrix for this polynomial ring (given as the array of its row vectors)protected PolynomialGF2mSmallM[]PolynomialRingGF2m.sqRootMatrixthe matrix for computing square roots in this polynomial ring (given as the array of its row vectors).Methods in org.bouncycastle.pqc.legacy.math.linearalgebra that return PolynomialGF2mSmallMModifier and TypeMethodDescriptionPolynomialGF2mSmallM.add(PolynomialGF2mSmallM addend) Compute the sum of this polynomial and the given polynomial.PolynomialGF2mSmallM.addMonomial(int degree) Compute the sum of this polynomial and the monomial of the given degree.PolynomialGF2mSmallM.div(PolynomialGF2mSmallM f) Divide this polynomial by the given polynomial.PolynomialGF2mSmallM.gcd(PolynomialGF2mSmallM f) Return the greatest common divisor of this and a polynomial fPolynomialRingGF2m.getSquareRootMatrix()PolynomialRingGF2m.getSquaringMatrix()PolynomialGF2mSmallM.mod(PolynomialGF2mSmallM f) Reduce this polynomial modulo another polynomial.PolynomialGF2mSmallM.modDiv(PolynomialGF2mSmallM divisor, PolynomialGF2mSmallM modulus) Compute the result of the division of this polynomial by another polynomial modulo a third polynomial.PolynomialGF2mSmallM.modInverse(PolynomialGF2mSmallM a) Compute the inverse of this polynomial modulo the given polynomial.PolynomialGF2mSmallM.modMultiply(PolynomialGF2mSmallM a, PolynomialGF2mSmallM b) Compute the product of this polynomial and another polynomial modulo a third polynomial.PolynomialGF2mSmallM.modPolynomialToFracton(PolynomialGF2mSmallM g) Compute a polynomial pair (a,b) from this polynomial and the given polynomial g with the property b*this = a mod g and deg(a)<=deg(g)/2.PolynomialGF2mSmallM.modSquareMatrix(PolynomialGF2mSmallM[] matrix) Square this polynomial using a squaring matrix.PolynomialGF2mSmallM.modSquareRoot(PolynomialGF2mSmallM a) Compute the square root of this polynomial modulo the given polynomial.PolynomialGF2mSmallM.modSquareRootMatrix(PolynomialGF2mSmallM[] matrix) Compute the square root of this polynomial using a square root matrix.PolynomialGF2mSmallM.multiply(PolynomialGF2mSmallM factor) Compute the product of this polynomial and the given factor using a Karatzuba like scheme.PolynomialGF2mSmallM.multWithElement(int element) Compute the product of this polynomial with an element from GF(2^m).PolynomialGF2mSmallM.multWithMonomial(int k) Compute the product of this polynomial with a monomial X^k.Methods in org.bouncycastle.pqc.legacy.math.linearalgebra with parameters of type PolynomialGF2mSmallMModifier and TypeMethodDescriptionPolynomialGF2mSmallM.add(PolynomialGF2mSmallM addend) Compute the sum of this polynomial and the given polynomial.voidPolynomialGF2mSmallM.addToThis(PolynomialGF2mSmallM addend) Add the given polynomial to this polynomial (overwrite this).static GF2MatrixGoppaCode.createCanonicalCheckMatrix(GF2mField field, PolynomialGF2mSmallM gp) Construct the check matrix of a Goppa code in canonical form from the irreducible Goppa polynomial over the finite field GF(2m).PolynomialGF2mSmallM.div(PolynomialGF2mSmallM f) Divide this polynomial by the given polynomial.PolynomialGF2mSmallM.gcd(PolynomialGF2mSmallM f) Return the greatest common divisor of this and a polynomial fPolynomialGF2mSmallM.mod(PolynomialGF2mSmallM f) Reduce this polynomial modulo another polynomial.PolynomialGF2mSmallM.modDiv(PolynomialGF2mSmallM divisor, PolynomialGF2mSmallM modulus) Compute the result of the division of this polynomial by another polynomial modulo a third polynomial.PolynomialGF2mSmallM.modInverse(PolynomialGF2mSmallM a) Compute the inverse of this polynomial modulo the given polynomial.PolynomialGF2mSmallM.modMultiply(PolynomialGF2mSmallM a, PolynomialGF2mSmallM b) Compute the product of this polynomial and another polynomial modulo a third polynomial.PolynomialGF2mSmallM.modPolynomialToFracton(PolynomialGF2mSmallM g) Compute a polynomial pair (a,b) from this polynomial and the given polynomial g with the property b*this = a mod g and deg(a)<=deg(g)/2.PolynomialGF2mSmallM.modSquareMatrix(PolynomialGF2mSmallM[] matrix) Square this polynomial using a squaring matrix.PolynomialGF2mSmallM.modSquareRoot(PolynomialGF2mSmallM a) Compute the square root of this polynomial modulo the given polynomial.PolynomialGF2mSmallM.modSquareRootMatrix(PolynomialGF2mSmallM[] matrix) Compute the square root of this polynomial using a square root matrix.PolynomialGF2mSmallM.multiply(PolynomialGF2mSmallM factor) Compute the product of this polynomial and the given factor using a Karatzuba like scheme.static GF2VectorGoppaCode.syndromeDecode(GF2Vector syndVec, GF2mField field, PolynomialGF2mSmallM gp, PolynomialGF2mSmallM[] sqRootMatrix) Find an error vector e over GF(2) from an input syndrome s over GF(2m).Constructors in org.bouncycastle.pqc.legacy.math.linearalgebra with parameters of type PolynomialGF2mSmallMModifierConstructorDescriptionCopy constructor.PolynomialRingGF2m(GF2mField field, PolynomialGF2mSmallM p) Constructor.