Package | Description |
---|---|
org.spongycastle.math.ntru.polynomial |
Modifier and Type | Field and Description |
---|---|
BigIntPolynomial |
Resultant.rho
A polynomial such that
res = rho*this + t*(x^n-1) for some integer t |
Modifier and Type | Method and Description |
---|---|
(package private) static BigIntPolynomial |
BigIntPolynomial.generateRandomSmall(int N,
int numOnes,
int numNegOnes)
Generates a random polynomial with
numOnes coefficients equal to 1,
numNegOnes coefficients equal to -1, and the rest equal to 0. |
BigIntPolynomial |
IntegerPolynomial.mult(BigIntPolynomial poly2) |
BigIntPolynomial |
SparseTernaryPolynomial.mult(BigIntPolynomial poly2) |
BigIntPolynomial |
ProductFormPolynomial.mult(BigIntPolynomial b) |
BigIntPolynomial |
Polynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by a
BigIntPolynomial , taking the indices mod N. |
BigIntPolynomial |
BigIntPolynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by another, taking the indices mod N.
|
private BigIntPolynomial |
BigIntPolynomial.multRecursive(BigIntPolynomial poly2)
Karazuba multiplication
|
BigIntPolynomial |
BigDecimalPolynomial.round()
Rounds all coefficients to the nearest integer.
|
Modifier and Type | Method and Description |
---|---|
void |
BigIntPolynomial.add(BigIntPolynomial b)
Adds another polynomial which can have a different number of coefficients.
|
(package private) void |
BigIntPolynomial.add(BigIntPolynomial b,
java.math.BigInteger modulus)
Adds another polynomial which can have a different number of coefficients,
and takes the coefficient values mod
modulus . |
BigIntPolynomial |
IntegerPolynomial.mult(BigIntPolynomial poly2) |
BigDecimalPolynomial |
BigDecimalPolynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by another.
|
BigIntPolynomial |
SparseTernaryPolynomial.mult(BigIntPolynomial poly2) |
BigIntPolynomial |
ProductFormPolynomial.mult(BigIntPolynomial b) |
BigIntPolynomial |
Polynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by a
BigIntPolynomial , taking the indices mod N. |
BigIntPolynomial |
BigIntPolynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by another, taking the indices mod N.
|
private BigIntPolynomial |
BigIntPolynomial.multRecursive(BigIntPolynomial poly2)
Karazuba multiplication
|
void |
BigIntPolynomial.sub(BigIntPolynomial b)
Subtracts another polynomial which can have a different number of coefficients.
|
Constructor and Description |
---|
BigDecimalPolynomial(BigIntPolynomial p)
Constructs a
BigDecimalPolynomial from a BigIntPolynomial . |
IntegerPolynomial(BigIntPolynomial p)
Constructs a
IntegerPolynomial from a BigIntPolynomial . |
ModularResultant(BigIntPolynomial rho,
java.math.BigInteger res,
java.math.BigInteger modulus) |
Resultant(BigIntPolynomial rho,
java.math.BigInteger res) |