org.spongycastle.math.ntru.polynomial.Polynomial Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of scprov-jdk15on Show documentation

The Bouncy Castle Crypto package is a Java implementation of cryptographic algorithms. This jar contains JCE provider for the Bouncy Castle Cryptography APIs for JDK 1.5 to JDK 1.7.

There is a newer version: 1.47.0.3

Show newest version

package org.spongycastle.math.ntru.polynomial;

public interface Polynomial
{

    /**
     * Multiplies the polynomial by an IntegerPolynomial,
     * taking the indices mod N.
     *
     * @param poly2 a polynomial
     * @return the product of the two polynomials
     */
    IntegerPolynomial mult(IntegerPolynomial poly2);

    /**
     * Multiplies the polynomial by an IntegerPolynomial,
     * taking the coefficient values mod modulus and the indices mod N.
     *
     * @param poly2   a polynomial
     * @param modulus a modulus to apply
     * @return the product of the two polynomials
     */
    IntegerPolynomial mult(IntegerPolynomial poly2, int modulus);

    /**
     * Returns a polynomial that is equal to this polynomial (in the sense that {@link #mult(IntegerPolynomial, int)}
     * returns equal IntegerPolynomials). The new polynomial is guaranteed to be independent of the original.
     *
     * @return a new IntegerPolynomial.
     */
    IntegerPolynomial toIntegerPolynomial();

    /**
     * Multiplies the polynomial by a BigIntPolynomial, taking the indices mod N. Does not
     * change this polynomial but returns the result as a new polynomial.

     * Both polynomials must have the same number of coefficients.
     *
     * @param poly2 the polynomial to multiply by
     * @return a new polynomial
     */
    BigIntPolynomial mult(BigIntPolynomial poly2);
}