Finite fields
Counting curves and their projections
Computational Complexity
Computing components and projections of curves over finite fields
SIAM Journal on Computing
Elliptic Curves: Number Theory and Cryptography, Second Edition
Elliptic Curves: Number Theory and Cryptography, Second Edition
Faster addition and doubling on elliptic curves
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Efficient scalar multiplication by isogeny decompositions
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Toric forms of elliptic curves and their arithmetic
Journal of Symbolic Computation
Efficient arithmetic on hessian curves
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
On various families of twisted jacobi quartics
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Hi-index | 0.00 |
We give explicit formulas for the number of distinct elliptic curves over a finite field (up to isomorphism over the algebraic closure of the ground field) in several families of curves of cryptographic interest such as Edwards curves and their generalization due to D. J. Bernstein and T. Lange as well as the curves introduced by C. Doche, T. Icart and D. R. Kohel.