Construction of secure elliptic cryptosystems using CM tests and liftings

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

Volumn 1514, Issue , 1998, Pages 95-109

  Chao, Jinhui ^a   Nakamura, Osamu ^a   Sobataka, Kohji ^a   Tsujii, Shigeo ^a  

^a CHUO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; POLYNOMIAL APPROXIMATION; SECURITY OF DATA;

CLASS NUMBERS; DETERMINISTIC ALGORITHMS; ELLIPTIC CURVE; FINITE FIELDS; MODULAR FUNCTIONS; NUMBER FIELDS; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC ALGORITHM;

CRYPTOGRAPHY;

EID: 78649415463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49649-1_9     Document Type: Conference Paper

References (33)

1. A.O.L. Atkin, F. Morain.: "Elliptic Curves and Primality Proving", Research Report 1256, INRIA, Juin (1990).
2. J. Chao, K. Tanada, S. Tsujii: "On secure elliptic curves against reduction attack and their design strategy", IEICE, Symposium on Cryptography and Information Security, SCIS'94, 10A, 1994-1. IEICE, Tech. rep. ISEC-93-100, p 29-37, Mar (1994).
3. J. Chao, K. Tanada, S. Tsujii: "Design of Elliptic Curves with Controllable Lower boundary of Extension Degree for Reduction Attacks", Yvo G. Desmedt (Ed.). Advances in Cryptology-CRYPTO'94, Lecture Notes in Computer Science, 839, Springer-Verlag, pp. 50-55, (1994).
4. J. Chao, K. Harada, N. Matsuda, S. Tsujii: "Design of secure elliptic curves over extension fields with CM fields methods", IEICE, Symposium on Cryptography and Information Security, SCIS'94, A5.5, 1995-1. IEICE, Tech. rep. ISEC-95-52, p.1-12, 1995-3. Proc. of Pragocrypto'96, p.93-108, (1996)
5. J. Chao, N. Matsuda, S. Tsujii. "Efficient construction of secure hyperelliptic discrete logarithm problems" Springer-Verlag Lecture Notes on Computer Science, Vol.1334, pp.292-301, "Information and Communication Security" Y. Han, T. Oka-moto, S. Qing (Eds.) Proceedings of First International Conference ICICS'97, Beijing, China, Nov, (1997).
6. H. Cohen.: "A course in computational algebraic number theory", Springer, GTM 138, (1995).
7. H. Cohn.: "Construction of class fields", Cambridge Univ. Press, 1978.
8. J.-M. Couveignes, F. Morain, "Schoof's algorithm and isogeny cycles", Proceedings of ANTS'I, May 1994. Lecture Notes in Computer Science, Springer-Verlag, pp.43-58. (1994).
9. D. Cox.: "Primes of the forms x2 + ny2 ", John Wiley and Sons. (1989).
10. N. D. Elkies "Elliptic and modular curves over finite fields and related computational issues", "Computational perspectives on number theory", Proceedings of a Conference in Honor of A.O.L. Atkin, AMS, D.A.Buell, and J.T. Teitelbaum ed. pp.21-76, Sept (1995).
11. E. Kaltofen and N. Yui, "Explicit construction of the Hilbert class fields fo imaginary quadratic fields by integer lattice reduction", New York Number TheorySeminar, 1989-1990, pringer-Verlag, pp. 150-202, (1991).
12. H. Kawasiro, O. Nakamura, J. Chao, S. Tsujii.: "Construction of CM hyperelliptic curves using RM families", SCIS'98, 4-1-A, Jan. 1998. IEICE Tech. Rep. ISEC97-72, p. 43-50, March, (1998).
13. N. Koblitz.: "Elliptic Curve Cryptosystems", Math. Comp, vol.48, p.203-209, (1987).
14. D. Kohel. "Endomorphism rings of ellitpic curves over finite fields" PhD thesis,UCB, (1996).
15. K. Kurotani, K. Matsuo, J. Chao, S. Tsujii: "Consideration of security of hy-perelliptic cryptosystems", IEICE, Symposium on Cryptography and Information Security, SCIS'98, 4.1-D, Jan. (1998).
16. S. Lang.: "Elliptic Functions", 2nd ed., Springer-Verlag, (1987).
17. S. Lang.: "Complex multiplication" Springer-Verlag, (1983).
18. G-J. Lay and H.G. Zimmer: "Constructing Elliptic Curves with Given Group Order over Large Finite Fields", Proceeding of ANTS95, May, (1994).
19. R. Lercier and F. Morain.: "Counting the number of points on elliptic curves over finite fields: strategies and performances", Proceeding of EUROCRYPTO'95, (1995).
20. A. Menezes.: "Elliptic Curve Public Key Cryptosystems", Kluwer Academic, (1993).
21. V.S. Miller.: "Use of Elliptic Curves in Cryptography", Advances in Cryptology Proceedings of Crypto'85, Lecture Notes in Computer Science, 218, Springer-Verlag, p.417-426, (1986).
22. F. Morain,: "Building cyclic elliptic curves modulo large primes", Advances in Cryptology -EUROCRYPT'91, Lecture Notes in Computer Science. 547 p.328-336, (1991).
23. F. Morain, "Calcul du nombre de points sur une courbe elliptique dans un corps fini: aspects algorithmique" Actes des Journees Arithmetiques, (1995)
24. O. Nakamura, N. Matsuda, J. Chao, S. Tsujii: "On cryptosystems based on abe-lian varieties with CM", IEICE, Symposium on Cryptography and Information Security, SCIS'97, 12-E, 1997-1, IEICE, Tech. Rep. ISEC-96-81, Mar. (1997).
25. O. Nakamura, N. Matsuda, J. Chao, S. Tsujii: "On cryptosystems based on abelian varieties with CM", IEICE, The first symposium on algebraic curves and their applications, Sept. (1997).
26. R. Schoof: "Elliptic curves over finite fields and the computation of square roots mod p", Math. Comp., vol.44, p.483-494, (1985).
27. R. Schoof: "Counting points on elliptic curves over finite fields", Journal de The'orie des Nombres de Bordeaux 7, pp.219-254, (1995)
28. J.P. Serre, J. Tate.: "Good reduction of abelian varieties", Ann. of Math. (2), 88,p.492-517, (1968).
29. J. H. Silverman.: "The Arithmetic of Elliptic Curves", Springer-Verlag, (1988).
30. J. H. Silverman.: "Advanced Topics in the Arithmetic of Elliptic Curves", GTM-151, Springer-Verlag, (1994).
31. G. Shimura: "Arithmetic theory of automorphic function", Iwanami-Shoten and Princeton, (1971).
32. K. Sobataka, O. Namamura, J. Chao, S. Tsujii.: "Construction of secure elliptic cryptosystems using CM tests and Lifting ", SCIS'98, 4-1-B, Jan. (1998). IEICE Tech. Rep. ISEC97-71, p. 35-42, March, (1998).
33. J. Tate.: "Endomorphisms of Abelian varieties over finite fields", Invent. Math. 2,p.134-144,(1966).