Tech report number
CERIAS TR 2007-33
The use of finite fields of low characteristic can make the implementation of elliptic curve cryptography more efficient. There are two approaches to lower the characteristic of the finite field in ECC while maintaining the same security level: Elliptic curves
over a finite field extension and hyperelliptic curves over a finite field. This thesis solves some problems in both approaches.
The group orders of elliptic curves over finite field extensions are described as polynomials. The irreducibility of these polynomials is proved, and hence the primality of the group orders can be studied. Asymptotic formulas for the number of
traces of elliptic curves over field extensions with almost prime orders are given and a proof based on Bateman-Horn
FINITE FIELDS, ELLIPTIC CURVE, CRYPTOGRAPHY
2 ELLIPTIC CURVES OVER FINITE FIELD EXTENTIONS
3 ARITHMETIC OF REAL HYPERELLIPTIC CURVES
Elliptic Curve Crytography
To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.