Examples of org.bouncycastle.pqc.math.ntru.polynomial.IntegerPolynomial.sub()

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

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

Examples of org.bouncycastle.pqc.math.ntru.polynomial.IntegerPolynomial.sub()

org.bouncycastle.pqc.math.ntru.polynomial.IntegerPolynomial.sub()
Subtracts another polynomial which can have a different number of coefficients, and takes the coefficient values mod modulus. @param b another polynomial

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


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


            IntegerPolynomial hi = (IntegerPolynomial)kPriv.getBasis(iLoop).h.clone();
            if (iLoop > 1)
            {

View Full Code Here

            s.add(si);


            IntegerPolynomial hi = (IntegerPolynomial)kPriv.getBasis(iLoop).h.clone();
            if (iLoop > 1)
            {
                hi.sub(kPriv.getBasis(iLoop - 1).h);
            }
            else
            {
                hi.sub(kPub.h);
            }

View Full Code Here

            {
                hi.sub(kPriv.getBasis(iLoop - 1).h);
            }
            else
            {
                hi.sub(kPub.h);
            }
            i = si.mult(hi, q);


            iLoop--;
        }

View Full Code Here

        int q = params.q;
        double normBoundSq = params.normBoundSq;
        double betaSq = params.betaSq;


        IntegerPolynomial t = h.mult(s, q);
        t.sub(i);
        long centeredNormSq = (long)(s.centeredNormSq(q) + betaSq * t.centeredNormSq(q));
        return centeredNormSq <= normBoundSq;
    }


    protected IntegerPolynomial createMsgRep(byte[] msgHash, int r)

View Full Code Here

        {
            throw new InvalidCipherTextException("Less than dm0 coefficients equal 1");
        }


        IntegerPolynomial cR = (IntegerPolynomial)e.clone();
        cR.sub(ci);
        cR.modPositive(q);
        IntegerPolynomial cR4 = (IntegerPolynomial)cR.clone();
        cR4.modPositive(4);
        byte[] coR4 = cR4.toBinary(4);
        IntegerPolynomial mask = MGF(coR4, N, minCallsMask, hashSeed);

View Full Code Here

        IntegerPolynomial cR4 = (IntegerPolynomial)cR.clone();
        cR4.modPositive(4);
        byte[] coR4 = cR4.toBinary(4);
        IntegerPolynomial mask = MGF(coR4, N, minCallsMask, hashSeed);
        IntegerPolynomial cMTrin = ci;
        cMTrin.sub(mask);
        cMTrin.mod3();
        byte[] cM = cMTrin.toBinary3Sves();


        byte[] cb = new byte[bLen];
        System.arraycopy(cM, 0, cb, 0, bLen);

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.