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

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

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

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

org.bouncycastle.pqc.math.ntru.polynomial.IntegerPolynomial.div()
Divides each coefficient by k and rounds to the nearest integer. Does not return a new polynomial but modifies this polynomial. @param k the divisor

        {
            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);
            s.add(si);

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);
        s.modPositive(q);

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.