Top Description Fields Constructors Methods
org.bouncycastle.pqc.legacy.math.ntru.polynomial

public Class ProductFormPolynomial

extends Object
implements Polynomial
Class Inheritance
All Implemented Interfaces
org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial
Imports
java.io.ByteArrayInputStream, .IOException, .InputStream, java.security.SecureRandom, org.bouncycastle.util.Arrays
A polynomial of the form f1*f2+f3, where f1,f2,f3 are very sparsely populated ternary polynomials.

Field Summary

Modifier and TypeField and Description
private SparseTernaryPolynomial
f1

private SparseTernaryPolynomial
f2

private SparseTernaryPolynomial
f3

Constructor Summary

AccessConstructor and Description
public
ProductFormPolynomial(SparseTernaryPolynomial f1, SparseTernaryPolynomial f2, SparseTernaryPolynomial f3)

Method Summary

Modifier and TypeMethod and Description
public boolean
equals(Object
the reference object with which to compare.
obj)

Overrides java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.
public static ProductFormPolynomial
fromBinary(byte[] data, int N, int df1, int df2, int df3Ones, int df3NegOnes)

public static ProductFormPolynomial
fromBinary(InputStream is, int N, int df1, int df2, int df3Ones, int df3NegOnes)

public static ProductFormPolynomial
generateRandom(int N, int df1, int df2, int df3Ones, int df3NegOnes, SecureRandom random)

public int
hashCode()

Overrides java.lang.Object.hashCode.

Returns a hash code value for the object.
public IntegerPolynomial
mult(IntegerPolynomial
a polynomial
b)

Implements org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

Multiplies the polynomial by an IntegerPolynomial, taking the indices mod N.
public BigIntPolynomial
mult(BigIntPolynomial
the polynomial to multiply by
b)

Implements org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

Multiplies the polynomial by a BigIntPolynomial, taking the indices mod N.
public IntegerPolynomial
mult(IntegerPolynomial
a polynomial
poly2, int
a modulus to apply
modulus)

Implements org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

Multiplies the polynomial by an IntegerPolynomial, taking the coefficient values mod modulus and the indices mod N.
public byte[]
toBinary()

public IntegerPolynomial
toIntegerPolynomial()

Implements org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.toIntegerPolynomial.

Returns a polynomial that is equal to this polynomial (in the sense that mult(IntegerPolynomial, int) returns equal IntegerPolynomials).
Inherited from java.lang.Object:
clonefinalizegetClassnotifynotifyAlltoStringwaitwaitwait

Field Detail

f1back to summary
private SparseTernaryPolynomial f1
f2back to summary
private SparseTernaryPolynomial f2
f3back to summary
private SparseTernaryPolynomial f3

Constructor Detail

ProductFormPolynomialback to summary
public ProductFormPolynomial(SparseTernaryPolynomial f1, SparseTernaryPolynomial f2, SparseTernaryPolynomial f3)

Method Detail

equalsback to summary
public boolean equals(Object obj)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

  • It is reflexive: for any non-null reference value x, x.equals(x) should return true.
  • It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
  • It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
  • It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
  • For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

Parameters
obj:Object

the reference object with which to compare.

Returns:boolean

true if this object is the same as the obj argument; false otherwise.

fromBinaryback to summary
public static ProductFormPolynomial fromBinary(byte[] data, int N, int df1, int df2, int df3Ones, int df3NegOnes) throws IOException
fromBinaryback to summary
public static ProductFormPolynomial fromBinary(InputStream is, int N, int df1, int df2, int df3Ones, int df3NegOnes) throws IOException
generateRandomback to summary
public static ProductFormPolynomial generateRandom(int N, int df1, int df2, int df3Ones, int df3NegOnes, SecureRandom random)
hashCodeback to summary
public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

  • Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
  • If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
  • It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.
Returns:int

a hash code value for this object.

multback to summary
public IntegerPolynomial mult(IntegerPolynomial b)

Implements org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

Doc from org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

Multiplies the polynomial by an IntegerPolynomial, taking the indices mod N.

Parameters
b:IntegerPolynomial

a polynomial

Returns:IntegerPolynomial

the product of the two polynomials

multback to summary
public BigIntPolynomial mult(BigIntPolynomial b)

Implements org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

Doc from org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

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.

Parameters
b:BigIntPolynomial

the polynomial to multiply by

Returns:BigIntPolynomial

a new polynomial

multback to summary
public IntegerPolynomial mult(IntegerPolynomial poly2, int modulus)

Implements org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

Doc from org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.mult.

Multiplies the polynomial by an IntegerPolynomial, taking the coefficient values mod modulus and the indices mod N.

Parameters
poly2:IntegerPolynomial

a polynomial

modulus:int

a modulus to apply

Returns:IntegerPolynomial

the product of the two polynomials

toBinaryback to summary
public byte[] toBinary()
toIntegerPolynomialback to summary
public IntegerPolynomial toIntegerPolynomial()

Implements org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.toIntegerPolynomial.

Doc from org.bouncycastle.pqc.legacy.math.ntru.polynomial.Polynomial.toIntegerPolynomial.

Returns a polynomial that is equal to this polynomial (in the sense that mult(IntegerPolynomial, int) returns equal IntegerPolynomials). The new polynomial is guaranteed to be independent of the original.

Returns:IntegerPolynomial

a new IntegerPolynomial.