java.lang.Object | |
↳ | java.security.spec.ECFieldF2m |
This immutable class defines an elliptic curve (EC) characteristic 2 finite field.
Public Constructors | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Creates an elliptic curve characteristic 2 finite
field which has 2^
m elements with normal basis. | |||||||||||
Creates an elliptic curve characteristic 2 finite
field which has 2^
m elements with
polynomial basis. | |||||||||||
Creates an elliptic curve characteristic 2 finite
field which has 2^
m elements with
polynomial basis. |
Public Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Compares this finite field for equality with the
specified object.
| |||||||||||
Returns the field size in bits which is
m
for this characteristic 2 finite field. | |||||||||||
Returns the value
m of this characteristic
2 finite field. | |||||||||||
Returns an integer array which contains the order of the
middle term(s) of the reduction polynomial for polynomial
basis or null for normal basis.
| |||||||||||
Returns a BigInteger whose i-th bit corresponds to the
i-th coefficient of the reduction polynomial for polynomial
basis or null for normal basis.
| |||||||||||
Returns a hash code value for this characteristic 2
finite field.
|
[Expand]
Inherited Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
From class
java.lang.Object
| |||||||||||
From interface
java.security.spec.ECField
|
Creates an elliptic curve characteristic 2 finite
field which has 2^m
elements with normal basis.
m | with 2^m being the number of elements. |
---|
IllegalArgumentException | if m
is not positive.
|
---|
Creates an elliptic curve characteristic 2 finite
field which has 2^m
elements with
polynomial basis.
The reduction polynomial for this field is based
on rp
whose i-th bit correspondes to
the i-th coefficient of the reduction polynomial.
Note: A valid reduction polynomial is either a
trinomial (X^m
+ X^k
+ 1
with m
> k
>= 1) or a
pentanomial (X^m
+ X^k3
+ X^k2
+ X^k1
+ 1 with
m
> k3
> k2
> k1
>= 1).
m | with 2^m being the number of elements. |
---|---|
rp | the BigInteger whose i-th bit corresponds to the i-th coefficient of the reduction polynomial. |
NullPointerException | if rp is null. |
---|---|
IllegalArgumentException | if m
is not positive, or rp does not represent
a valid reduction polynomial.
|
Creates an elliptic curve characteristic 2 finite
field which has 2^m
elements with
polynomial basis. The reduction polynomial for this
field is based on ks
whose content
contains the order of the middle term(s) of the
reduction polynomial.
Note: A valid reduction polynomial is either a
trinomial (X^m
+ X^k
+ 1
with m
> k
>= 1) or a
pentanomial (X^m
+ X^k3
+ X^k2
+ X^k1
+ 1 with
m
> k3
> k2
> k1
>= 1), so ks
should
have length 1 or 3.
m | with 2^m being the number of elements. |
---|---|
ks | the order of the middle term(s) of the reduction polynomial. Contents of this array are copied to protect against subsequent modification. |
NullPointerException | if ks is null. |
---|---|
IllegalArgumentException | ifm
is not positive, or the length of ks
is neither 1 nor 3, or values in ks
are not between m -1 and 1 (inclusive)
and in descending order.
|
Compares this finite field for equality with the specified object.
obj | the object to be compared. |
---|
obj
is an instance
of ECFieldF2m and both m
and the reduction
polynomial match, false otherwise.
Returns the field size in bits which is m
for this characteristic 2 finite field.
Returns the value m
of this characteristic
2 finite field.
m
with 2^m
being the
number of elements.
Returns an integer array which contains the order of the middle term(s) of the reduction polynomial for polynomial basis or null for normal basis.
Returns a BigInteger whose i-th bit corresponds to the i-th coefficient of the reduction polynomial for polynomial basis or null for normal basis.
Returns a hash code value for this characteristic 2 finite field.