Uses of Class
org.bouncycastle.pqc.legacy.math.linearalgebra.GF2nPolynomial
Packages that use GF2nPolynomial
-
Uses of GF2nPolynomial in org.bouncycastle.pqc.legacy.math.linearalgebra
Methods in org.bouncycastle.pqc.legacy.math.linearalgebra that return GF2nPolynomialModifier and TypeMethodDescriptionfinal GF2nPolynomialGF2nPolynomial.add(GF2nPolynomial b) Adds the PolynomialGF2n b to this and returns the result in a new PolynomialGF2n.final GF2nPolynomial[]GF2nPolynomial.divide(GF2nPolynomial b) Divides this by b and stores the result in a new PolynomialGF2n[2], quotient in result[0] and remainder in result[1].final GF2nPolynomialGF2nPolynomial.gcd(GF2nPolynomial g) Computes the greatest common divisor of this and g and returns the result in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.multiply(GF2nPolynomial b) Multiplies this by b and returns the result in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.multiplyAndReduce(GF2nPolynomial b, GF2nPolynomial g) Multiplies this by b, reduces the result by g and returns it in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.quotient(GF2nPolynomial b) Divides this by b and stores the quotient in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.reduce(GF2nPolynomial g) Reduces this by g and returns the result in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.remainder(GF2nPolynomial b) Divides this by b and stores the remainder in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.scalarMultiply(GF2nElement s) Multiplies the scalar s to each coefficient of this PolynomialGF2n and returns the result in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.shiftLeft(int amount) Methods in org.bouncycastle.pqc.legacy.math.linearalgebra with parameters of type GF2nPolynomialModifier and TypeMethodDescriptionfinal GF2nPolynomialGF2nPolynomial.add(GF2nPolynomial b) Adds the PolynomialGF2n b to this and returns the result in a new PolynomialGF2n.final GF2nPolynomial[]GF2nPolynomial.divide(GF2nPolynomial b) Divides this by b and stores the result in a new PolynomialGF2n[2], quotient in result[0] and remainder in result[1].final GF2nPolynomialGF2nPolynomial.gcd(GF2nPolynomial g) Computes the greatest common divisor of this and g and returns the result in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.multiply(GF2nPolynomial b) Multiplies this by b and returns the result in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.multiplyAndReduce(GF2nPolynomial b, GF2nPolynomial g) Multiplies this by b, reduces the result by g and returns it in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.quotient(GF2nPolynomial b) Divides this by b and stores the quotient in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.reduce(GF2nPolynomial g) Reduces this by g and returns the result in a new PolynomialGF2n.final GF2nPolynomialGF2nPolynomial.remainder(GF2nPolynomial b) Divides this by b and stores the remainder in a new PolynomialGF2n.Constructors in org.bouncycastle.pqc.legacy.math.linearalgebra with parameters of type GF2nPolynomialModifierConstructorDescriptionCreates a new PolynomialGF2n by cloning the given PolynomialGF2n a.