GF2_192_Poly
Related Docs:
class GF2_192_Poly
| package crypto
Factory constructor -- same as GF2_192_Poly(coeff0, moreCoeffs)
Factory constructor -- same as GF2_192_Poly(coeff0, moreCoeffs)
byte array representing lowest coefficient (24 bytes)
byte array with concatenation of byte-converted coefficients (24 bytes each) from degree 1 to the highest
new polynomial with the given coefficients
Interpolates the polynomial at given points (and at point 0, if valueAt0!=null).
Interpolates the polynomial at given points (and at point 0, if valueAt0!=null). If points are not all distinct, or if 0 is in the points array and valueAt0!=null, behavior is undefined. valueAt0 is separated only for efficiency reason; the caller can treat 0 like any other point instead (i.e., the points array can include 0 if valueAt0==null, but computation will be slightly less efficient). If points is null, or values is null, or if lengths of points and values arrays differ, or if the arrays are 0 length and valueAt0 is null, returns null.
the set of distinct inputs to the returned polynomial (last byte of the field element only; all other bits are assumed to be 0)
values[i] will be the result evaluating the returned polynomial at points[i]. values[i] must not be null.
if not null, then valueAt0 will be the result of evaluating the returned polynomial at 0
the unique lowest-degree polynomial p such that for every i, p(points[i]) = values[i] and p(0)=valueAt0 (if valueAt0!=null)