Java PolynomialGF2mSmallM类代码示例

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Constructor (used by the {@link McElieceKeyFactory}).
 *
 * @param oid
 * @param n            the length of the code
 * @param k            the dimension of the code
 * @param encField     the encoded field polynomial defining the finite field
 *                     <tt>GF(2<sup>m</sup>)</tt>
 * @param encGoppaPoly the encoded irreducible Goppa polynomial
 * @param encSInv      the encoded matrix <tt>S<sup>-1</sup></tt>
 * @param encP1        the encoded permutation used to generate the systematic
 *                     check matrix
 * @param encP2        the encoded permutation used to compute the public
 *                     generator matrix
 * @param encH         the encoded canonical check matrix
 * @param encQInv      the encoded matrix used to compute square roots in
 *                     <tt>(GF(2<sup>m</sup>))<sup>t</sup></tt>
 * @param params       McElieceParameters
 */
public McEliecePrivateKeyParameters(String oid, int n, int k, byte[] encField,
                                    byte[] encGoppaPoly, byte[] encSInv, byte[] encP1, byte[] encP2,
                                    byte[] encH, byte[][] encQInv, McElieceParameters params)
{
    super(true, params);
    this.oid = oid;
    this.n = n;
    this.k = k;
    field = new GF2mField(encField);
    goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
    sInv = new GF2Matrix(encSInv);
    p1 = new Permutation(encP1);
    p2 = new Permutation(encP2);
    h = new GF2Matrix(encH);
    qInv = new PolynomialGF2mSmallM[encQInv.length];
    for (int i = 0; i < encQInv.length; i++)
    {
        qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Constructor used by the {@link McElieceKeyFactory}.
 *
 * @param n            the length of the code
 * @param k            the dimension of the code
 * @param encFieldPoly the encoded field polynomial defining the finite field
 *                     <tt>GF(2<sup>m</sup>)</tt>
 * @param encGoppaPoly the encoded irreducible Goppa polynomial
 * @param encP         the encoded permutation
 * @param encH         the encoded canonical check matrix
 * @param encQInv      the encoded matrix used to compute square roots in
 *                     <tt>(GF(2^m))^t</tt>
 * @param params       McElieceCCA2Parameters
 */
public McElieceCCA2PrivateKeyParameters(String oid, int n, int k, byte[] encFieldPoly,
                                        byte[] encGoppaPoly, byte[] encP, byte[] encH, byte[][] encQInv, McElieceCCA2Parameters params)
{
    super(true, params);
    this.oid = oid;
    this.n = n;
    this.k = k;
    field = new GF2mField(encFieldPoly);
    goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
    p = new Permutation(encP);
    h = new GF2Matrix(encH);
    qInv = new PolynomialGF2mSmallM[encQInv.length];
    for (int i = 0; i < encQInv.length; i++)
    {
        qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
public McElieceCCA2PrivateKey(ASN1ObjectIdentifier oid, int n, int k, GF2mField field, PolynomialGF2mSmallM goppaPoly, Permutation p, GF2Matrix h, PolynomialGF2mSmallM[] qInv)
{
    this.oid = oid;
    this.n = n;
    this.k = k;
    this.encField = field.getEncoded();
    this.encGp = goppaPoly.getEncoded();
    this.encP = p.getEncoded();
    this.encH = h.getEncoded();
    this.encqInv = new byte[qInv.length][];

    for (int i = 0; i != qInv.length; i++)
    {
        encqInv[i] = qInv[i].getEncoded();
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
public McEliecePrivateKey(ASN1ObjectIdentifier oid, int n, int k, GF2mField field, PolynomialGF2mSmallM goppaPoly, GF2Matrix sInv, Permutation p1, Permutation p2, GF2Matrix h, PolynomialGF2mSmallM[] qInv)
{
    this.oid = oid;
    this.n = n;
    this.k = k;
    this.encField = field.getEncoded();
    this.encGp = goppaPoly.getEncoded();
    this.encSInv = sInv.getEncoded();
    this.encP1 = p1.getEncoded();
    this.encP2 = p2.getEncoded();
    this.encH = h.getEncoded();
    this.encqInv = new byte[qInv.length][];

    for (int i = 0; i != qInv.length; i++)
    {
        encqInv[i] = qInv[i].getEncoded();
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Constructor used by the {@link McElieceKeyFactory}.
 *
 * @param n            the length of the code
 * @param k            the dimension of the code
 * @param encFieldPoly the encoded field polynomial defining the finite field
 *                     <tt>GF(2<sup>m</sup>)</tt>
 * @param encGoppaPoly the encoded irreducible Goppa polynomial
 * @param encP         the encoded permutation
 * @param encH         the encoded canonical check matrix
 * @param encQInv      the encoded matrix used to compute square roots in
 *                     <tt>(GF(2^m))^t</tt>
 */
public McElieceCCA2PrivateKeySpec(String oid, int n, int k, byte[] encFieldPoly,
                                  byte[] encGoppaPoly, byte[] encP, byte[] encH, byte[][] encQInv)
{
    this.oid = oid;
    this.n = n;
    this.k = k;
    field = new GF2mField(encFieldPoly);
    goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
    p = new Permutation(encP);
    h = new GF2Matrix(encH);
    qInv = new PolynomialGF2mSmallM[encQInv.length];
    for (int i = 0; i < encQInv.length; i++)
    {
        qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Constructor (used by the {@link McElieceKeyFactory}).
 *
 * @param oid
 * @param n            the length of the code
 * @param k            the dimension of the code
 * @param encField     the encoded field polynomial defining the finite field
 *                     <tt>GF(2<sup>m</sup>)</tt>
 * @param encGoppaPoly the encoded irreducible Goppa polynomial
 * @param encSInv      the encoded matrix <tt>S<sup>-1</sup></tt>
 * @param encP1        the encoded permutation used to generate the systematic
 *                     check matrix
 * @param encP2        the encoded permutation used to compute the public
 *                     generator matrix
 * @param encH         the encoded canonical check matrix
 * @param encQInv      the encoded matrix used to compute square roots in
 *                     <tt>(GF(2<sup>m</sup>))<sup>t</sup></tt>
 */
public McEliecePrivateKeySpec(String oid, int n, int k, byte[] encField,
                              byte[] encGoppaPoly, byte[] encSInv, byte[] encP1, byte[] encP2,
                              byte[] encH, byte[][] encQInv)
{
    this.oid = oid;
    this.n = n;
    this.k = k;
    field = new GF2mField(encField);
    goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
    sInv = new GF2Matrix(encSInv);
    p1 = new Permutation(encP1);
    p2 = new Permutation(encP2);
    h = new GF2Matrix(encH);
    qInv = new PolynomialGF2mSmallM[encQInv.length];
    for (int i = 0; i < encQInv.length; i++)
    {
        qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Constructor.
 *
 * @param oid
 * @param n            the length of the code
 * @param k            the dimension of the code
 * @param encField     the encoded field polynomial defining the finite field
 *                     <tt>GF(2<sup>m</sup>)</tt>
 * @param encGoppaPoly the encoded irreducible Goppa polynomial
 * @param encSInv      the encoded matrix <tt>S<sup>-1</sup></tt>
 * @param encP1        the encoded permutation used to generate the systematic
 *                     check matrix
 * @param encP2        the encoded permutation used to compute the public
 *                     generator matrix
 * @param encH         the encoded canonical check matrix
 * @param encQInv      the encoded matrix used to compute square roots in
 *                     <tt>(GF(2<sup>m</sup>))<sup>t</sup></tt>
 * @param params       McElieceParameters
 */
public McEliecePrivateKeyParameters(String oid, int n, int k, byte[] encField,
                                    byte[] encGoppaPoly, byte[] encSInv, byte[] encP1, byte[] encP2,
                                    byte[] encH, byte[][] encQInv, McElieceParameters params)
{
    super(true, params);
    this.oid = oid;
    this.n = n;
    this.k = k;
    field = new GF2mField(encField);
    goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
    sInv = new GF2Matrix(encSInv);
    p1 = new Permutation(encP1);
    p2 = new Permutation(encP2);
    h = new GF2Matrix(encH);
    qInv = new PolynomialGF2mSmallM[encQInv.length];
    for (int i = 0; i < encQInv.length; i++)
    {
        qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Constructor.
 *
 * @param n            the length of the code
 * @param k            the dimension of the code
 * @param encFieldPoly the encoded field polynomial defining the finite field
 *                     <tt>GF(2<sup>m</sup>)</tt>
 * @param encGoppaPoly the encoded irreducible Goppa polynomial
 * @param encP         the encoded permutation
 * @param encH         the encoded canonical check matrix
 * @param encQInv      the encoded matrix used to compute square roots in
 *                     <tt>(GF(2^m))^t</tt>
 * @param params       McElieceCCA2Parameters
 */
public McElieceCCA2PrivateKeyParameters(String oid, int n, int k, byte[] encFieldPoly,
                                        byte[] encGoppaPoly, byte[] encP, byte[] encH, byte[][] encQInv, McElieceCCA2Parameters params)
{
    super(true, params);
    this.oid = oid;
    this.n = n;
    this.k = k;
    field = new GF2mField(encFieldPoly);
    goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
    p = new Permutation(encP);
    h = new GF2Matrix(encH);
    qInv = new PolynomialGF2mSmallM[encQInv.length];
    for (int i = 0; i < encQInv.length; i++)
    {
        qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Constructor.
 *
 * @param n            the length of the code
 * @param k            the dimension of the code
 * @param encFieldPoly the encoded field polynomial defining the finite field
 *                     <tt>GF(2<sup>m</sup>)</tt>
 * @param encGoppaPoly the encoded irreducible Goppa polynomial
 * @param encP         the encoded permutation
 * @param encH         the encoded canonical check matrix
 * @param encQInv      the encoded matrix used to compute square roots in
 *                     <tt>(GF(2^m))^t</tt>
 */
public McElieceCCA2PrivateKeySpec(String oid, int n, int k, byte[] encFieldPoly,
                                  byte[] encGoppaPoly, byte[] encP, byte[] encH, byte[][] encQInv)
{
    this.oid = oid;
    this.n = n;
    this.k = k;
    field = new GF2mField(encFieldPoly);
    goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
    p = new Permutation(encP);
    h = new GF2Matrix(encH);
    qInv = new PolynomialGF2mSmallM[encQInv.length];
    for (int i = 0; i < encQInv.length; i++)
    {
        qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Constructor.
 *
 * @param oid          string representation of the object identifier the algorithm for this key.
 * @param n            the length of the code
 * @param k            the dimension of the code
 * @param encField     the encoded field polynomial defining the finite field
 *                     <tt>GF(2<sup>m</sup>)</tt>
 * @param encGoppaPoly the encoded irreducible Goppa polynomial
 * @param encSInv      the encoded matrix <tt>S<sup>-1</sup></tt>
 * @param encP1        the encoded permutation used to generate the systematic
 *                     check matrix
 * @param encP2        the encoded permutation used to compute the public
 *                     generator matrix
 * @param encH         the encoded canonical check matrix
 * @param encQInv      the encoded matrix used to compute square roots in
 *                     <tt>(GF(2<sup>m</sup>))<sup>t</sup></tt>
 */
public McEliecePrivateKeySpec(String oid, int n, int k, byte[] encField,
                              byte[] encGoppaPoly, byte[] encSInv, byte[] encP1, byte[] encP2,
                              byte[] encH, byte[][] encQInv)
{
    this.oid = oid;
    this.n = n;
    this.k = k;
    field = new GF2mField(encField);
    goppaPoly = new PolynomialGF2mSmallM(field, encGoppaPoly);
    sInv = new GF2Matrix(encSInv);
    p1 = new Permutation(encP1);
    p2 = new Permutation(encP2);
    h = new GF2Matrix(encH);
    qInv = new PolynomialGF2mSmallM[encQInv.length];
    for (int i = 0; i < encQInv.length; i++)
    {
        qInv[i] = new PolynomialGF2mSmallM(field, encQInv[i]);
    }
}
 

import org.bouncycastle.pqc.math.linearalgebra.PolynomialGF2mSmallM; //导入依赖的package包/类
/**
 * Generates a new random test-case with given parameters.
 *
 * @param coeffs the number of coefficients of the polynomial
 * @param n the number of points of the polynomial
 * @param f the number of faulty points
 */
private void genRandomTest(int x[], int y[], int expected[], int coeffs, int n, int f) {
    RandomSource rng = new JavaSecureRandom();
    rng.fillBytesAsInts(expected);

    PolynomialGF2mSmallM poly = new PolynomialGF2mSmallM(new GF2mField(8, 0x11d), expected);

    generateRandomIntegerArray(x, n, 256);
    for (int i = 0; i < x.length; i++) {
        y[i] = poly.evaluateAt(x[i]);
    }

    int[] idx = new int[n];
    int[] delta = new int[255];

    generateRandomIntegerArray(idx, f, n);
    generateRandomIntegerArray(delta, f, 255);

    // Adding a number in range [1, 255] to a number will change it for sure.
    for (int i = 0; i < f; i++) {
        y[idx[i]] = (y[idx[i]] + delta[i] + 1) % 256;
    }
}