Package | Description |
---|---|
org.bouncycastle.pqc.asn1 | |
org.bouncycastle.pqc.crypto.mceliece | |
org.bouncycastle.pqc.jcajce.provider.mceliece | |
org.bouncycastle.pqc.math.linearalgebra |
Modifier and Type | Method and Description |
---|---|
PolynomialGF2mSmallM |
McEliecePrivateKey.getGoppaPoly() |
PolynomialGF2mSmallM |
McElieceCCA2PrivateKey.getGoppaPoly() |
Constructor and Description |
---|
McElieceCCA2PrivateKey(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) |
Modifier and Type | Method and Description |
---|---|
PolynomialGF2mSmallM |
McElieceCCA2PrivateKeyParameters.getGoppaPoly() |
PolynomialGF2mSmallM |
McEliecePrivateKeyParameters.getGoppaPoly() |
PolynomialGF2mSmallM[] |
McElieceCCA2PrivateKeyParameters.getQInv() |
PolynomialGF2mSmallM[] |
McEliecePrivateKeyParameters.getQInv() |
Constructor and Description |
---|
McElieceCCA2PrivateKeyParameters(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.
|
Modifier and Type | Method and Description |
---|---|
PolynomialGF2mSmallM |
BCMcEliecePrivateKey.getGoppaPoly() |
PolynomialGF2mSmallM |
BCMcElieceCCA2PrivateKey.getGoppaPoly() |
PolynomialGF2mSmallM[] |
BCMcEliecePrivateKey.getQInv() |
PolynomialGF2mSmallM[] |
BCMcElieceCCA2PrivateKey.getQInv() |
Modifier and Type | Field and Description |
---|---|
protected PolynomialGF2mSmallM[] |
PolynomialRingGF2m.sqMatrix
the squaring matrix for this polynomial ring (given as the array of its
row vectors)
|
protected PolynomialGF2mSmallM[] |
PolynomialRingGF2m.sqRootMatrix
the matrix for computing square roots in this polynomial ring (given as
the array of its row vectors).
|
Modifier and Type | Method and Description |
---|---|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.add(PolynomialGF2mSmallM addend)
Compute the sum of this polynomial and the given polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.addMonomial(int degree)
Compute the sum of this polynomial and the monomial of the given degree.
|
PolynomialGF2mSmallM[] |
PolynomialGF2mSmallM.div(PolynomialGF2mSmallM f)
Divide this polynomial by the given polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.gcd(PolynomialGF2mSmallM f)
Return the greatest common divisor of this and a polynomial f
|
PolynomialGF2mSmallM[] |
PolynomialRingGF2m.getSquareRootMatrix() |
PolynomialGF2mSmallM[] |
PolynomialRingGF2m.getSquaringMatrix() |
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.mod(PolynomialGF2mSmallM f)
Reduce this polynomial modulo another polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modDiv(PolynomialGF2mSmallM divisor,
PolynomialGF2mSmallM modulus)
Compute the result of the division of this polynomial by another
polynomial modulo a third polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modInverse(PolynomialGF2mSmallM a)
Compute the inverse of this polynomial modulo the given polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modMultiply(PolynomialGF2mSmallM a,
PolynomialGF2mSmallM b)
Compute the product of this polynomial and another polynomial modulo a
third polynomial.
|
PolynomialGF2mSmallM[] |
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 |
PolynomialGF2mSmallM.modSquareMatrix(PolynomialGF2mSmallM[] matrix)
Square this polynomial using a squaring matrix.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modSquareRoot(PolynomialGF2mSmallM a)
Compute the square root of this polynomial modulo the given polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modSquareRootMatrix(PolynomialGF2mSmallM[] matrix)
Compute the square root of this polynomial using a square root matrix.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.multiply(PolynomialGF2mSmallM factor)
Compute the product of this polynomial and the given factor using a
Karatzuba like scheme.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.multWithElement(int element)
Compute the product of this polynomial with an element from GF(2^m).
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.multWithMonomial(int k)
Compute the product of this polynomial with a monomial X^k.
|
Modifier and Type | Method and Description |
---|---|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.add(PolynomialGF2mSmallM addend)
Compute the sum of this polynomial and the given polynomial.
|
void |
PolynomialGF2mSmallM.addToThis(PolynomialGF2mSmallM addend)
Add the given polynomial to this polynomial (overwrite this).
|
static GF2Matrix |
GoppaCode.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[] |
PolynomialGF2mSmallM.div(PolynomialGF2mSmallM f)
Divide this polynomial by the given polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.gcd(PolynomialGF2mSmallM f)
Return the greatest common divisor of this and a polynomial f
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.mod(PolynomialGF2mSmallM f)
Reduce this polynomial modulo another polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modDiv(PolynomialGF2mSmallM divisor,
PolynomialGF2mSmallM modulus)
Compute the result of the division of this polynomial by another
polynomial modulo a third polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modInverse(PolynomialGF2mSmallM a)
Compute the inverse of this polynomial modulo the given polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modMultiply(PolynomialGF2mSmallM a,
PolynomialGF2mSmallM b)
Compute the product of this polynomial and another polynomial modulo a
third polynomial.
|
PolynomialGF2mSmallM[] |
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 |
PolynomialGF2mSmallM.modSquareMatrix(PolynomialGF2mSmallM[] matrix)
Square this polynomial using a squaring matrix.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modSquareRoot(PolynomialGF2mSmallM a)
Compute the square root of this polynomial modulo the given polynomial.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.modSquareRootMatrix(PolynomialGF2mSmallM[] matrix)
Compute the square root of this polynomial using a square root matrix.
|
PolynomialGF2mSmallM |
PolynomialGF2mSmallM.multiply(PolynomialGF2mSmallM factor)
Compute the product of this polynomial and the given factor using a
Karatzuba like scheme.
|
static GF2Vector |
GoppaCode.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).
|
static GF2Vector |
GoppaCode.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).
|
Constructor and Description |
---|
PolynomialGF2mSmallM(PolynomialGF2mSmallM other)
Copy constructor.
|
PolynomialRingGF2m(GF2mField field,
PolynomialGF2mSmallM p)
Constructor.
|
Copyright © 2020 BouncyCastle.org. All rights reserved.