GF2_192_Poly
Related Docs:
object GF2_192_Poly
| package crypto
Constructs a constant polynomial
Constructs a constant polynomial
the maximum degree this polynomial could possibly have (to allocate space)
the polynomial is initially created with degree 0 and given constantTerm
Constructs the polynomial given the byte array representation of the coefficients.
Constructs the polynomial given the byte array representation of the coefficients. Coefficient of degree zero is given separately. Each coefficient should be given as a 24-byte representation of a GF2_192 value. Coefficient of degree 1 should start at moreCoeffs[0].
byte array representing lowest coefficient (24 bytes)
byte array with concatenation of byte-converted coefficients (24 bytes each) from degree 1 to the highest
The degree-0 coefficient, converted to an array of 24 bytes
Evaluates the polynomial at a given point
Evaluates the polynomial at a given point
the last byte of a field element (all other bits are assumed to be 0)
the value of this polynomial evaluated at the field element
Returns a byte array that contains the concatenation of all the coefficients (except possibly the degree-0 coefficient, which is omitted if coeff0 is false).
Returns a byte array that contains the concatenation of all the coefficients (except possibly the degree-0 coefficient, which is omitted if coeff0 is false). Lowest-degree coefficient (0 or 1 depending on coeff0) starts at index 0 of the returned array. Each coefficient takes 24 bytes, for a total of degree*24 bytes if coeff0 is false, or (degree+1)*24 bytes if coeff0 is true
whether to include coeff0
array of all coefficients (except possibly 0th depending on coeff0)
this represented in usual polynomial notation (but possibly leading 0s), with X as the free variable