Bouncy Castle Provider 1.77 · org.bouncycastle.pqc.legacy.math.linearalgebra.PolynomialRingGF2

Access	Constructor and Description
private	PolynomialRingGF2() Default constructor (private).

Method Summary

Modifier and Type	Method and Description
public static int	Returns: p+q add(int polynomial p, int polynomial q) Return sum of two polyomials
public static int	Returns: degree(p) degree(int polynomial p p) Return the degree of a polynomial
public static int	Returns: degree(p) degree(long polynomial p p) Return the degree of a polynomial
public static int	Returns: GCD(p, q) gcd(int polinomial p, int polinomial q) Return the greatest common divisor of two polynomials
public static int	Returns: irreducible polynomial p getIrreduciblePolynomial(int polynomial degree deg) Creates irreducible polynomial with degree d
public static boolean	Returns: true if p is irreducible and false otherwise isIrreducible(int polinomial p) Checking polynomial for irreducibility
public static int	Returns: `a * b mod r` modMultiply(int the first polynomial a, int the second polynomial b, int the reduction polynomial r) Compute the product of two polynomials modulo a third polynomial.
public static long	Returns: p*q multiply(int polynomial p, int polynomial q) Return product of two polynomials
public static int	Returns: `p mod q` remainder(int dividend p, int divisor q) Return the remainder of a polynomial division of two polynomials.
public static int	Returns: p mod q rest(long polinomial p, int polinomial q) Return the rest of devision two polynomials

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

PolynomialRingGF2	back to summary
private PolynomialRingGF2() Default constructor (private).

Method Detail

add	back to summary
public static int add(int p, int q) Return sum of two polyomials Parameters p:int polynomial q:int polynomial Returns:int p+q

add

back to summary

public static int add(int p, int q)

Return sum of two polyomials

Parameters

p:int: polynomial
q:int: polynomial

Returns:int

p+q

degree	back to summary
public static int degree(int p) Return the degree of a polynomial Parameters p:int polynomial p Returns:int degree(p)

degree

back to summary

public static int degree(int p)

Return the degree of a polynomial

Parameters

p:int: polynomial p

Returns:int

degree(p)

degree	back to summary
public static int degree(long p) Return the degree of a polynomial Parameters p:long polynomial p Returns:int degree(p)

degree

back to summary

public static int degree(long p)

Return the degree of a polynomial

Parameters

p:long: polynomial p

Returns:int

degree(p)

gcd	back to summary
public static int gcd(int p, int q) Return the greatest common divisor of two polynomials Parameters p:int polinomial q:int polinomial Returns:int GCD(p, q)

gcd

back to summary

public static int gcd(int p, int q)

Return the greatest common divisor of two polynomials

Parameters

p:int: polinomial
q:int: polinomial

Returns:int

GCD(p, q)

getIrreduciblePolynomial	back to summary
public static int getIrreduciblePolynomial(int deg) Creates irreducible polynomial with degree d Parameters deg:int polynomial degree Returns:int irreducible polynomial p

getIrreduciblePolynomial

back to summary

public static int getIrreduciblePolynomial(int deg)

Creates irreducible polynomial with degree d

Parameters

deg:int: polynomial degree

Returns:int

irreducible polynomial p

isIrreducible	back to summary
public static boolean isIrreducible(int p) Checking polynomial for irreducibility Parameters p:int polinomial Returns:boolean true if p is irreducible and false otherwise

isIrreducible

back to summary

public static boolean isIrreducible(int p)

Checking polynomial for irreducibility

Parameters

p:int: polinomial

Returns:boolean

true if p is irreducible and false otherwise

modMultiply back to summary

modMultiply	back to summary
public static int modMultiply(int a, int b, int r) Compute the product of two polynomials modulo a third polynomial. Parameters a:int the first polynomial b:int the second polynomial r:int the reduction polynomial Returns:int `a * b mod r`

public static int modMultiply(int a, int b, int r)

Compute the product of two polynomials modulo a third polynomial.

Parameters

a:int: the first polynomial
b:int: the second polynomial
r:int: the reduction polynomial

Returns:int

a * b mod r

multiply	back to summary
public static long multiply(int p, int q) Return product of two polynomials Parameters p:int polynomial q:int polynomial Returns:long p*q

multiply

back to summary

public static long multiply(int p, int q)

Return product of two polynomials

Parameters

p:int: polynomial
q:int: polynomial

Returns:long

p*q

remainder back to summary

remainder	back to summary
public static int remainder(int p, int q) Return the remainder of a polynomial division of two polynomials. Parameters p:int dividend q:int divisor Returns:int `p mod q`

public static int remainder(int p, int q)

Return the remainder of a polynomial division of two polynomials.

Parameters

p:int: dividend
q:int: divisor

Returns:int

p mod q

rest	back to summary
public static int rest(long p, int q) Return the rest of devision two polynomials Parameters p:long polinomial q:int polinomial Returns:int p mod q

rest

back to summary

public static int rest(long p, int q)

Return the rest of devision two polynomials

Parameters

p:long: polinomial
q:int: polinomial

Returns:int

p mod q

public final Class PolynomialRingGF2

Constructor Summary

Method Summary

Constructor Detail

Method Detail