Examples of DenseTernaryPolynomial

org.bouncycastle.pqc.math.ntru.polynomial.DenseTernaryPolynomial
A TernaryPolynomial with a "high" number of nonzero coefficients.

Examples of org.bouncycastle.pqc.math.ntru.polynomial.DenseTernaryPolynomial

                f = ProductFormPolynomial.fromBinary(is, N, d1, d2, d3 + 1, d3);
            }
            else
            {
                IntegerPolynomial fInt = IntegerPolynomial.fromBinary3Tight(is, N);
                f = sparse ? new SparseTernaryPolynomial(fInt) : new DenseTernaryPolynomial(fInt);
            }


            if (params.basisType == NTRUSigningKeyGenerationParameters.BASIS_TYPE_STANDARD)
            {
                IntegerPolynomial fPrimeInt = IntegerPolynomial.fromBinary(is, N, q);

View Full Code Here

Examples of org.bouncycastle.pqc.math.ntru.polynomial.DenseTernaryPolynomial

        }
        else
        {
            h = IntegerPolynomial.fromBinary(is, params.N, params.q);
            IntegerPolynomial fInt = IntegerPolynomial.fromBinary3Tight(is, params.N);
            t = params.sparse ? new SparseTernaryPolynomial(fInt) : new DenseTernaryPolynomial(fInt);
        }


        init();
    }

View Full Code Here

Examples of org.bouncycastle.pqc.math.ntru.polynomial.DenseTernaryPolynomial

            {
                return new SparseTernaryPolynomial(r);
            }
            else
            {
                return new DenseTernaryPolynomial(r);
            }
        }
    }

View Full Code Here

Examples of org.bouncycastle.pqc.math.ntru.polynomial.DenseTernaryPolynomial

            a = priv_t.mult(e, params.q);
        }
        a.center0(params.q);
        a.mod3();


        IntegerPolynomial c = params.fastFp ? a : new DenseTernaryPolynomial(a).mult(priv_fp, 3);
        c.center0(3);
        return c;
    }

View Full Code Here

Examples of org.bouncycastle.pqc.math.ntru.polynomial.DenseTernaryPolynomial

            fp = new IntegerPolynomial(N);
            fp.coeffs[0] = 1;
        }


        // choose a random g that is invertible mod q
        DenseTernaryPolynomial g;
        while (true)
        {
            g = DenseTernaryPolynomial.generateRandom(N, dg, dg - 1, params.getRandom());
            if (g.invertFq(q) != null)
            {
                break;
            }
        }


        IntegerPolynomial h = g.mult(fq, q);
        h.mult3(q);
        h.ensurePositive(q);
        g.clear();
        fq.clear();


        NTRUEncryptionPrivateKeyParameters priv = new NTRUEncryptionPrivateKeyParameters(h, t, fp, params.getEncryptionParameters());
        NTRUEncryptionPublicKeyParameters pub = new NTRUEncryptionPublicKeyParameters(h, params.getEncryptionParameters());
        return new AsymmetricCipherKeyPair(pub, priv);

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.