List of modPositive() Examples

Examples of modPositive()

org.bouncycastle.pqc.math.ntru.polynomial.IntegerPolynomial.modPositive()
Ensures all coefficients are between 0 and modulus-1 @param modulus a modulus

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

        else
        {
            fPrime = g;
            h = FInt.mult(fq, q);
        }
        h.modPositive(q);


        return new FGBasis(f, fPrime, h, FInt, GInt, params);
    }


    /**

View Full Code Here

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

            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);
            mTrin.mod3();

View Full Code Here

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

            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);
        IntegerPolynomial cMTrin = ci;

View Full Code Here

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


        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);
        IntegerPolynomial cMTrin = ci;
        cMTrin.sub(mask);
        cMTrin.mod3();

View Full Code Here

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

        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.