import org.bouncycastle.pqc.crypto.rainbow.util.ComputeInField; //导入依赖的package包/类
/**
 * This function generates the invertible affine linear map L1 = A1*x + b1
 * <p/>
 * The translation part b1, is stored in a separate array. The inverse of
 * the matrix-part of L1 A1inv is also computed here.
 * <p/>
 * This linear map hides the output of the map F. It is on k^(n-v1).
 */
private void generateL1()
{

    // dimension = n-v1 = vi[last] - vi[first]
    int dim = vi[vi.length - 1] - vi[0];
    this.A1 = new short[dim][dim];
    this.A1inv = null;
    ComputeInField c = new ComputeInField();

    /* generation of A1 at random */
    while (A1inv == null)
    {
        for (int i = 0; i < dim; i++)
        {
            for (int j = 0; j < dim; j++)
            {
                A1[i][j] = (short)(sr.nextInt() & GF2Field.MASK);
            }
        }
        A1inv = c.inverse(A1);
    }

    /* generation of the translation vector at random */
    b1 = new short[dim];
    for (int i = 0; i < dim; i++)
    {
        b1[i] = (short)(sr.nextInt() & GF2Field.MASK);
    }
}
 

import org.bouncycastle.pqc.crypto.rainbow.util.ComputeInField; //导入依赖的package包/类
/**
 * This function generates the invertible affine linear map L2 = A2*x + b2
 * <p/>
 * The translation part b2, is stored in a separate array. The inverse of
 * the matrix-part of L2 A2inv is also computed here.
 * <p/>
 * This linear map hides the output of the map F. It is on k^(n).
 */
private void generateL2()
{

    // dimension = n = vi[last]
    int dim = vi[vi.length - 1];
    this.A2 = new short[dim][dim];
    this.A2inv = null;
    ComputeInField c = new ComputeInField();

    /* generation of A2 at random */
    while (this.A2inv == null)
    {
        for (int i = 0; i < dim; i++)
        {
            for (int j = 0; j < dim; j++)
            { // one col extra for b
                A2[i][j] = (short)(sr.nextInt() & GF2Field.MASK);
            }
        }
        this.A2inv = c.inverse(A2);
    }
    /* generation of the translation vector at random */
    b2 = new short[dim];
    for (int i = 0; i < dim; i++)
    {
        b2[i] = (short)(sr.nextInt() & GF2Field.MASK);
    }

}
 

import org.bouncycastle.pqc.crypto.rainbow.util.ComputeInField; //导入依赖的package包/类
/**
 * This function generates the invertible affine linear map L1 = A1*x + b1
 * <p>
 * The translation part b1, is stored in a separate array. The inverse of
 * the matrix-part of L1 A1inv is also computed here.
 * </p><p>
 * This linear map hides the output of the map F. It is on k^(n-v1).
 * </p>
 */
private void generateL1()
{

    // dimension = n-v1 = vi[last] - vi[first]
    int dim = vi[vi.length - 1] - vi[0];
    this.A1 = new short[dim][dim];
    this.A1inv = null;
    ComputeInField c = new ComputeInField();

    /* generation of A1 at random */
    while (A1inv == null)
    {
        for (int i = 0; i < dim; i++)
        {
            for (int j = 0; j < dim; j++)
            {
                A1[i][j] = (short)(sr.nextInt() & GF2Field.MASK);
            }
        }
        A1inv = c.inverse(A1);
    }

    /* generation of the translation vector at random */
    b1 = new short[dim];
    for (int i = 0; i < dim; i++)
    {
        b1[i] = (short)(sr.nextInt() & GF2Field.MASK);
    }
}
 

import org.bouncycastle.pqc.crypto.rainbow.util.ComputeInField; //导入依赖的package包/类
/**
 * This function generates the invertible affine linear map L2 = A2*x + b2
 * <p>
 * The translation part b2, is stored in a separate array. The inverse of
 * the matrix-part of L2 A2inv is also computed here.
 * </p><p>
 * This linear map hides the output of the map F. It is on k^(n).
 * </p>
 */
private void generateL2()
{

    // dimension = n = vi[last]
    int dim = vi[vi.length - 1];
    this.A2 = new short[dim][dim];
    this.A2inv = null;
    ComputeInField c = new ComputeInField();

    /* generation of A2 at random */
    while (this.A2inv == null)
    {
        for (int i = 0; i < dim; i++)
        {
            for (int j = 0; j < dim; j++)
            { // one col extra for b
                A2[i][j] = (short)(sr.nextInt() & GF2Field.MASK);
            }
        }
        this.A2inv = c.inverse(A2);
    }
    /* generation of the translation vector at random */
    b2 = new short[dim];
    for (int i = 0; i < dim; i++)
    {
        b2[i] = (short)(sr.nextInt() & GF2Field.MASK);
    }

}