Examples of org.bouncycastle.pqc.math.ntru.polynomial.Polynomial.mult()

Package org.bouncycastle.pqc.math.ntru.polynomial

Class org.bouncycastle.pqc.math.ntru.polynomial.Polynomial

Examples of org.bouncycastle.pqc.math.ntru.polynomial.Polynomial.mult()

org.bouncycastle.pqc.math.ntru.polynomial.Polynomial.mult()
Multiplies the polynomial by an IntegerPolynomial, taking the indices mod N. @param poly2 a polynomial @return the product of the two polynomials

            Polynomial f = kPriv.getBasis(iLoop).f;
            Polynomial fPrime = kPriv.getBasis(iLoop).fPrime;


            IntegerPolynomial y = f.mult(i);
            y.div(q);
            y = fPrime.mult(y);


            IntegerPolynomial x = fPrime.mult(i);
            x.div(q);
            x = f.mult(x);

View Full Code Here


            IntegerPolynomial y = f.mult(i);
            y.div(q);
            y = fPrime.mult(y);


            IntegerPolynomial x = fPrime.mult(i);
            x.div(q);
            x = f.mult(x);


            IntegerPolynomial si = y;
            si.sub(x);

View Full Code Here

        Polynomial f = kPriv.getBasis(0).f;
        Polynomial fPrime = kPriv.getBasis(0).fPrime;


        IntegerPolynomial y = f.mult(i);
        y.div(q);
        y = fPrime.mult(y);


        IntegerPolynomial x = fPrime.mult(i);
        x.div(q);
        x = f.mult(x);

View Full Code Here


        IntegerPolynomial y = f.mult(i);
        y.div(q);
        y = fPrime.mult(y);


        IntegerPolynomial x = fPrime.mult(i);
        x.div(q);
        x = f.mult(x);


        y.sub(x);
        s.add(y);

View Full Code Here

            }
            IntegerPolynomial fRev = new IntegerPolynomial(fRevCoeffs);
            IntegerPolynomial gRev = new IntegerPolynomial(gRevCoeffs);


            IntegerPolynomial t = f.mult(fRev);
            t.add(g.mult(gRev));
            Resultant rt = t.resultant();
            C = fRev.mult(B);   // fRev.mult(B) is actually faster than new SparseTernaryPolynomial(fRev).mult(B), possibly due to cache locality?
            C.add(gRev.mult(A));
            C = C.mult(rt.rho);
            C.div(rt.res);

View Full Code Here

        }


        BigIntPolynomial F = (BigIntPolynomial)B.clone();
        F.sub(f.mult(C));
        BigIntPolynomial G = (BigIntPolynomial)A.clone();
        G.sub(g.mult(C));


        IntegerPolynomial FInt = new IntegerPolynomial(F);
        IntegerPolynomial GInt = new IntegerPolynomial(G);
        minimizeFG(fInt, gInt, FInt, GInt, N);

View Full Code Here

            byte[] bh = pub.toBinary(q);
            byte[] hTrunc = copyOf(bh, pkLen / 8);
            byte[] sData = buildSData(oid, m, l, b, hTrunc);


            Polynomial r = generateBlindingPoly(sData, M);
            IntegerPolynomial R = r.mult(pub, q);
            IntegerPolynomial R4 = (IntegerPolynomial)R.clone();
            R4.modPositive(4);
            byte[] oR4 = R4.toBinary(4);
            IntegerPolynomial mask = MGF(oR4, N, minCallsMask, hashSeed);
            mTrin.add(mask);

View Full Code Here

        byte[] bh = pub.toBinary(q);
        byte[] hTrunc = copyOf(bh, pkLen / 8);
        byte[] sData = buildSData(oid, cm, cl, cb, hTrunc);


        Polynomial cr = generateBlindingPoly(sData, cm);
        IntegerPolynomial cRPrime = cr.mult(pub);
        cRPrime.modPositive(q);
        if (!cRPrime.equals(cR))
        {
            throw new InvalidCipherTextException("Invalid message encoding");
        }

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.