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

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

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

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

org.bouncycastle.pqc.math.ntru.polynomial.IntegerPolynomial.toBinary()
Encodes a polynomial whose coefficients are between 0 and q, to binary. q must be a power of 2. @param q @return the encoded polynomial

                IntegerPolynomial fPrimeInt = fPrime.toIntegerPolynomial();
                for (int i = 0; i < fPrimeInt.coeffs.length; i++)
                {
                    fPrimeInt.coeffs[i] += q / 2;
                }
                os.write(fPrimeInt.toBinary(q));
            }
            else
            {
                os.write(getEncoded(fPrime));
            }

View Full Code Here


            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();


            if (mTrin.count(-1) < dm0)

View Full Code Here

        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();
        byte[] cM = cMTrin.toBinary3Sves();

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.