Uses of Class
org.bouncycastle.pqc.legacy.math.ntru.polynomial.IntegerPolynomial
Packages that use IntegerPolynomial
Package
Description
-
Uses of IntegerPolynomial in org.bouncycastle.pqc.legacy.crypto.ntru
Fields in org.bouncycastle.pqc.legacy.crypto.ntru declared as IntegerPolynomialModifier and TypeFieldDescriptionNTRUSigningKeyPairGenerator.FGBasis.FNTRUEncryptionPrivateKeyParameters.fpNTRUSigningKeyPairGenerator.FGBasis.GNTRUEncryptionPrivateKeyParameters.hNTRUEncryptionPublicKeyParameters.hNTRUSigningPrivateKeyParameters.Basis.hNTRUSigningPublicKeyParameters.hMethods in org.bouncycastle.pqc.legacy.crypto.ntru that return IntegerPolynomialModifier and TypeMethodDescriptionprotected IntegerPolynomialNTRUSigner.createMsgRep(byte[] msgHash, int r) Deprecated.protected IntegerPolynomialNTRUEngine.decrypt(IntegerPolynomial e, Polynomial priv_t, IntegerPolynomial priv_fp) protected IntegerPolynomialNTRUEngine.encrypt(IntegerPolynomial m, TernaryPolynomial r, IntegerPolynomial pubKey) Methods in org.bouncycastle.pqc.legacy.crypto.ntru with parameters of type IntegerPolynomialModifier and TypeMethodDescriptionprotected IntegerPolynomialNTRUEngine.decrypt(IntegerPolynomial e, Polynomial priv_t, IntegerPolynomial priv_fp) protected IntegerPolynomialNTRUEngine.encrypt(IntegerPolynomial m, TernaryPolynomial r, IntegerPolynomial pubKey) Constructors in org.bouncycastle.pqc.legacy.crypto.ntru with parameters of type IntegerPolynomialModifierConstructorDescriptionprotectedBasis(Polynomial f, Polynomial fPrime, IntegerPolynomial h, NTRUSigningKeyGenerationParameters params) Constructs a new basis from polynomialsf, f', h.NTRUEncryptionPrivateKeyParameters(IntegerPolynomial h, Polynomial t, IntegerPolynomial fp, NTRUEncryptionParameters params) Constructs a new private key from a polynomialConstructs a new public key from a polynomialConstructs a new public key from a polynomial -
Uses of IntegerPolynomial in org.bouncycastle.pqc.legacy.math.ntru.polynomial
Subclasses of IntegerPolynomial in org.bouncycastle.pqc.legacy.math.ntru.polynomialModifier and TypeClassDescriptionclassATernaryPolynomialwith a "high" number of nonzero coefficients.Methods in org.bouncycastle.pqc.legacy.math.ntru.polynomial that return IntegerPolynomialModifier and TypeMethodDescriptionstatic IntegerPolynomialIntegerPolynomial.fromBinary(byte[] data, int N, int q) Returns a polynomial with N coefficients between0andq-1.
qmust be a power of 2.
Ignores any excess bytes.static IntegerPolynomialIntegerPolynomial.fromBinary(InputStream is, int N, int q) Returns a polynomial with N coefficients between0andq-1.
qmust be a power of 2.
Ignores any excess bytes.static IntegerPolynomialIntegerPolynomial.fromBinary3Sves(byte[] data, int N) Decodes a byte array to a polynomial withNternary coefficients
Ignores any excess bytes.static IntegerPolynomialIntegerPolynomial.fromBinary3Tight(byte[] b, int N) Converts a byte array produced bytoBinary3Tight()to a polynomial.static IntegerPolynomialIntegerPolynomial.fromBinary3Tight(InputStream is, int N) Reads data produced bytoBinary3Tight()from an input stream and converts it to a polynomial.IntegerPolynomial.invertF3()Computes the inverse mod 3.IntegerPolynomial.invertFq(int q) Computes the inverse modq; qmust be a power of 2.
Returnsnullif the polynomial is not invertible.DenseTernaryPolynomial.mult(IntegerPolynomial poly2, int modulus) IntegerPolynomial.mult(IntegerPolynomial poly2) Multiplies the polynomial with another, taking the indices mod NIntegerPolynomial.mult(IntegerPolynomial poly2, int modulus) Multiplies the polynomial with another, taking the values mod modulus and the indices mod NPolynomial.mult(IntegerPolynomial poly2) Multiplies the polynomial by anIntegerPolynomial, taking the indices modN.Polynomial.mult(IntegerPolynomial poly2, int modulus) Multiplies the polynomial by anIntegerPolynomial, taking the coefficient values modmodulusand the indices modN.ProductFormPolynomial.mult(IntegerPolynomial b) ProductFormPolynomial.mult(IntegerPolynomial poly2, int modulus) SparseTernaryPolynomial.mult(IntegerPolynomial poly2) SparseTernaryPolynomial.mult(IntegerPolynomial poly2, int modulus) TernaryPolynomial.mult(IntegerPolynomial poly2) Multiplies the polynomial by anIntegerPolynomial, taking the indices mod NIntegerPolynomial.toIntegerPolynomial()LongPolynomial2.toIntegerPolynomial()LongPolynomial5.toIntegerPolynomial()Polynomial.toIntegerPolynomial()Returns a polynomial that is equal to this polynomial (in the sense thatPolynomial.mult(IntegerPolynomial, int)returns equalIntegerPolynomials).ProductFormPolynomial.toIntegerPolynomial()SparseTernaryPolynomial.toIntegerPolynomial()Methods in org.bouncycastle.pqc.legacy.math.ntru.polynomial with parameters of type IntegerPolynomialModifier and TypeMethodDescriptionvoidIntegerPolynomial.add(IntegerPolynomial b) Adds another polynomial which can have a different number of coefficients.voidIntegerPolynomial.add(IntegerPolynomial b, int modulus) Adds another polynomial which can have a different number of coefficients, and takes the coefficient values modmodulus.DenseTernaryPolynomial.mult(IntegerPolynomial poly2, int modulus) IntegerPolynomial.mult(IntegerPolynomial poly2) Multiplies the polynomial with another, taking the indices mod NIntegerPolynomial.mult(IntegerPolynomial poly2, int modulus) Multiplies the polynomial with another, taking the values mod modulus and the indices mod NPolynomial.mult(IntegerPolynomial poly2) Multiplies the polynomial by anIntegerPolynomial, taking the indices modN.Polynomial.mult(IntegerPolynomial poly2, int modulus) Multiplies the polynomial by anIntegerPolynomial, taking the coefficient values modmodulusand the indices modN.ProductFormPolynomial.mult(IntegerPolynomial b) ProductFormPolynomial.mult(IntegerPolynomial poly2, int modulus) SparseTernaryPolynomial.mult(IntegerPolynomial poly2) SparseTernaryPolynomial.mult(IntegerPolynomial poly2, int modulus) TernaryPolynomial.mult(IntegerPolynomial poly2) Multiplies the polynomial by anIntegerPolynomial, taking the indices mod NvoidIntegerPolynomial.sub(IntegerPolynomial b) Subtracts another polynomial which can have a different number of coefficients.voidIntegerPolynomial.sub(IntegerPolynomial b, int modulus) Subtracts another polynomial which can have a different number of coefficients, and takes the coefficient values modmodulus.Constructors in org.bouncycastle.pqc.legacy.math.ntru.polynomial with parameters of type IntegerPolynomialModifierConstructorDescriptionConstructs aBigIntPolynomialfrom aIntegerPolynomial.DenseTernaryPolynomial(IntegerPolynomial intPoly) Constructs aDenseTernaryPolynomialfrom aIntegerPolynomial.Constructs aLongPolynomial2from aIntegerPolynomial.Constructs aLongPolynomial5from aIntegerPolynomial.SparseTernaryPolynomial(IntegerPolynomial intPoly) Constructs aDenseTernaryPolynomialfrom aIntegerPolynomial.