Fast elliptic curve point counting using gaussian normal basis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2369, Issue , 2002, Pages 292-307

  Kim, Hae Young ^a   Park, Jung Youl ^a   Cheon, Jung Hee ^a   Park, Je Hong ^a   Kim, Jae Heon ^b   Hahn, Sang Geun ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b National Security Research Institute (NSRI)   (South Korea)

Author keywords

Elliptic curve; Gaussian normal basis; Order counting

Indexed keywords

GAUSSIAN DISTRIBUTION; GEOMETRY; NUMBER THEORY;

COMPUTATION ALGORITHM; ELLIPTIC CURVE; ELLIPTIC CURVES OVER FINITE FIELDS; GAUSSIAN NORMAL BASES (GNB); GAUSSIAN NORMAL BASIS; ORDER COUNTING; SPACE COMPLEXITY; SPECIFIC PROPERTIES;

ALGORITHMS;

EID: 84958552680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45455-1_24     Document Type: Conference Paper

References (24)

1. A. O. L. Atkin, The number of points on an elliptic curve modulo a prime, Series of e-mails to the NUMBERTHRY mailing list, 1992.
2. L. F. Blake, R. M. Roth, and G. Seroussi, Efficient Arithmetic in GF(2n) through Palindromic Representation, Tech. Rep. HPL-98-134, Hewlett Packard, 1998.
3. I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, Cambridge Univ. Press, 2000.
4. J. M. Couveignes, Computing l-isogenies using the p-Torsion, Algorithmic number theory - ANTS-II LNCS 1122, pp. 59–66, Springer-Verlag, 1996.
5. M. Deuring, Die Typen der Multiplikatorenringe elliptischer Funktionenk örper. Abh. Math. Sem. Univ. Hamburg, 14, pp. 197–272, 1941.
6. N. D. Elkies, Elliptic and modular curves over finite fields and related computational issues, In D.A. Buell and eds. J.T. Teitelbaum, editors, Computational perspective on number theory, AMS/IP Stud. Adv. Math., 7, pp. 21–78, Province, RI: AMS, 1998. Proceedings of a Conference in Honor of A.O.L. Atkin.
7. M. Fouquet, P.Gaudry, and R. Harley, On Satoh’s algorithm and its implementation, J. Ramanujan Math. Soc., 15, pp. 281–318, 2000.
8. R. Harley, Counting points with the arithmetic-geometric mean(joint work with J. F. Mestre and P. Gaudry), Eurocrypt 2001, Rump session, 2001.
9. C. Hooley, On Artin’s conjecture, J. Reine Angew Math., 225, pp. 209–220, 1967.
10. K. Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology, available at http://arXiv.org/abs/math/0105031.
11. N. Koblitz, Elliptic curve cyptosystem, Math. Comp., 48(177), pp. 203-209, 1998.
12. S. Lang, Algebraic Number Theory, Springer-Verlag, 1994.
13. J. Lubin, J. P. Serre, and J. Tate. Elliptic curves and formal group. Lecture notes in prepared in connection with the seminars held at the Summer institute on Algebraic Geometry, Whitney Estate, Woods Hole, Massachusetts, 1964.
14. A. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, 1993.
15. A. Menezes, Application of Finite Fields, Kluwer Academic Publisher, 1993.
16. V. Miller, Use of elliptic curves in cryptography. Crypto’86, LNCS 263, pp. 417–426, 1987.
17. M. R. Murty, Artin’s conjecture for primitive roots, Math. Intelligencer, 10 (4), pp. 59–67, 1988.
18. M. S. Parterson and L. J. Stockmeyer, On the number of nonscalar multiplications necessary to evaluate polynomials. SIMA J. Comput., 2, pp. 60–67, 1973.
19. T. Satoh, The canonical lift of an ordinary elliptic curve over a finite field and its point counting, J. Ramanujan Math. Soc., 15, pp. 247–270, 2000.
20. R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comput., 44, pp. 483–494, 1985.
21. H. Silverman, Fast Multiplication in Finite Fields GF(2N), Crytographic Hardware and Embedded Systems - CHES’99, LNCS 1717, pp. 122-134, Springer-Verlag, 1999.
22. B. Skjernaa, Satoh Point Counting in characteristic 2. To appear in Math. Comp.
23. T. Satoh, B. Skjernaa, and Y. Taguchi, Fast Computation of Canonical Lifts of Elliptic curves and its Application to Point Counting, Preprint, 2001.
24. F. Vercauteren, B. Preneel, and J. Vandewalle, A Memory Efficient Version of Satoh’s Algorithm. Advances in Cryptology - Eurocrypt 2001, LNCS 2045, pp. 1–13, Springer-Verlag, 2001.