Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A course in computational algebraic number theory
A course in computational algebraic number theory
Elliptic curves and their applications to cryptography: an introduction
Elliptic curves and their applications to cryptography: an introduction
Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Fast Elliptic Curve Point Counting Using Gaussian Normal Basis
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Two Topics in Hyperelliptic Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Fast arithmetic in unramified p-adic fields
Finite Fields and Their Applications
Fast computation of canonical lifts of elliptic curves and its application to point counting
Finite Fields and Their Applications
A p-adic point counting algorithm for elliptic curves on legendre form
Finite Fields and Their Applications
| Hi-index | 0.00 |
We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2, extending the O(log5 q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.