Represents a polynomial from F_2[X].
Returns the string representation of the polynomial x.
Computes this*f mod g.
Returns this*y. When an overflow occurs, throws an exception.
Returns the integer division result this / d.
Returns the remainder of this / d.
Returns the coefficients in hex.
Returns the degree of the polynomial. If this is zero, -1 is returned.
Returns true iff x is irreducible over F_2. This function uses Ben Or's reducibility test. For details see "Tests and Constructions of Irreducible Polynomials over Finite Fields".
Returns an irreducible polynomial of degree 53 (largest prime number below 64-8) by reading bytes from source. There are (2^53-2/53) irreducible polynomials of degree 53 in F_2[X], c.f. Michael O. Rabin (1981): "Fingerprinting by Random Polynomials", page 4. If no polynomial could be found in one million tries, an error is returned.
Returns quotient and remainder from division [x / d, x % d], see https://en.wikipedia.org/wiki/Division_algorithm
Computes the Greatest Common Divisor of x and f.
Returns a new random irreducible polynomial of degree 53 using the default rndGen as source. It is equivalent to calling derive(generate!(() => uniform!ubyte)).