| Package | Description |
|---|---|
| org.bouncycastle.pqc.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 |
|---|---|
BigIntPolynomial |
IntegerPolynomial.mult(BigIntPolynomial poly2) |
BigIntPolynomial |
Polynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by a
BigIntPolynomial, taking the indices mod N. |
BigIntPolynomial |
ProductFormPolynomial.mult(BigIntPolynomial b) |
BigIntPolynomial |
SparseTernaryPolynomial.mult(BigIntPolynomial poly2) |
BigIntPolynomial |
BigIntPolynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by another, taking the indices mod N.
|
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.
|
BigIntPolynomial |
IntegerPolynomial.mult(BigIntPolynomial poly2) |
BigIntPolynomial |
Polynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by a
BigIntPolynomial, taking the indices mod N. |
BigIntPolynomial |
ProductFormPolynomial.mult(BigIntPolynomial b) |
BigIntPolynomial |
SparseTernaryPolynomial.mult(BigIntPolynomial poly2) |
BigIntPolynomial |
BigIntPolynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by another, taking the indices mod N.
|
BigDecimalPolynomial |
BigDecimalPolynomial.mult(BigIntPolynomial poly2)
Multiplies the polynomial by another.
|
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. |
Copyright © 2015–2020 The veraPDF Consortium. All rights reserved.