Weil descent of elliptic curves over finite fields of characteristic three

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

Volumn 1976, Issue , 2000, Pages 248-258

  Arita, Seigo ^a  

^a NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

CAB CURVES; CHARACTERISTIC THREE; DISCRETE LOGARITHM PROBLEMS; EFFECTIVE ALGORITHMS; ELLIPTIC CURVE; ELLIPTIC CURVES OVER FINITE FIELDS; RHO METHODS; WEIL DESCENTS;

GEOMETRY;

EID: 23044522661     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_19     Document Type: Conference Paper

References (20)

1. S. Arita, “Algorithms for computations in Jacobian group of Cab curve and their application to discrete-log-based public key cryptosystems,” Conference on The Mathematics of Public Key Cryptography, Toronto, 1999.
2. S. Arita, “Gaudry’s variant against Cab curve,” LNCS 1751, Proceedings of PKC 2000, pp. 58-67, Melbourne, 2000.
3. S. Arita, “Construction of Secure Cab Curves Using Modular Curves,” ANTS VI, pp.113–126, Leiden, 2000.
4. G. Frey and H.-G. Rück, “A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves”, Mathematics of Computation, 62 (1994), 865-874.
5. S. Galbraith and N Smart, “A Cryptographic Application of Weil Descent,” HP Labs Tech. Report, HPL-1999-70.
6. P. Gaudry, “A variant of the Adleman-DeMarris-Huang algorithm and its application to small genera,” Conference on The Mathematics of Public Key Cryptography, Toronto, 1999.
7. P. Gaudry, F. Hess and N. Smart, “Constructive and destructive facets of Weil descent on elliptic curves,” HP Labs Tech. Report, HPL-2000-10.
8. T. de Jong, “An algorithm for computing integral closure,” J. Symbolic Comp., vol. 26, no.3, pp. 36-47, 1998.
9. N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of Computation, 48(1987), pp. 203-209.
10. R. Matsumoto, “Constructing Algebraic Geometry Codes on the Normalization of a Singular Cab Curve,” Trans. of IEICE, vol. E82-A, no. 9, 1981-1985, Sep. 1999.
11. A. Menezes, T. Okamoto, and S. Vanstone, “Reducing elliptic curve logarithms to logarithms in a finite field”, Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 80-89, 1991.
12. V.S. Miller, “Use of elliptic curves in cryptography,” CRYPTO’85(LNCS 218), pp. 417-426, 1986.
13. S. Miura, “Linear Codes on Affine Algebraic Curves”, Trans. of IEICE, vol. J81-A, no. 10, 1398-1421, Oct. 1998.
14. H.-G. Rück, “On the discrete logarithm in the divisor class group of curves,” Math. Comp.,68(226), pp.805-806,1999.
15. T. Satoh, K. Araki, “Fermat Quotients and the Polynomial Time Discrete Log Algorithm for Anomalous Elliptic Curves”, COMMENTARII MATHEMATICI UNIVERSITATIS SANCTI PAULI, vol. 47, No. 1, 81-92, 1998.
16. I.A. Semaev, “Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curves in characteristic p,” Math. Comp. 67, pp. 353-356, 1998.
17. J.H. Silverman, “The Arithmetic of Elliptic Curves”, Springer-Verlag, 1986.
18. P.N. Smart, “The discrete logarithm problem on elliptic curves of trace one,” J. Cryptology 12, 193-196 (1999).
19. S. Uchiyama, T. Saitoh “A Note on the Discrete Logarithm Problem on Elliptic Curves of Trace Two,” Proc. of the 1998 Engineering Sciences Society Conference of IEICE, pp. 231-232.
20. W. V. Vasconcelos, “Computational Methods in Commutative Algebra and Algebraic Geometry”, Springer, 1998