Characterization of elliptic curve traces under FR-reduction

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

Volumn 2015, Issue , 2001, Pages 90-108

  Miyaji, Atsuko ^a   Nakabayashi, Masaki ^a   Takano, Shunzo ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Elliptic curve cryptosystems; FR reduction; Number theory; Trace

Indexed keywords

AD HOC NETWORKS; CRYPTOGRAPHY; CURVE FITTING; NUMBER THEORY; SECURITY OF DATA;

DISCRETE LOGARITHM PROBLEMS; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOSYSTEMS; ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEMS; SECURITY POINT; SUPERSINGULAR ELLIPTIC CURVE; TRACE;

GEOMETRY;

EID: 84959046713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45247-8_8     Document Type: Conference Paper

References (38)

1. R. Anderson and R. Needham, “Robustness principles for public key protocols”, Advances in Cryptology-Proceedings of CRYPTO’95, Lecture Notes in Computer Science, 963(1995), Springer-Verlag, 236-247.
2. A. O. L. Atkin and F. Morain, “Elliptic curves and primality proving”, Math. of Computation, 61(1993), 29-68.
3. K. Araki and T. Satoh “Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves”, Commentarii Math. Univ. St. Pauli., vol. 47 (1998), 81-92.
4. R. Balasubramanian and N. Koblitz, “The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes-Okamoto-Vanstone Algorithm”, J. Cryptology, 11 (1998), 141-145.
5. J. Chao, O. Nakamura, K. Sobataka, and S. Tsujii, “Construction of secure elliptic curves with CM tests and lifting”, Advances in Cryptology-Proceedings of ASI- ACRYPT’98, Lecture Notes in Computer Science, 1514(1998), Springer-Verlag, 95-109.
6. J. Chao, M. Hosoya, K. Sobataka, and S. Tsujii,’’Construction of Elliptic Cryptosystems Using Ordinary Lifting”, Proceeding of the 1999 Symposium on Cryptography and Information Security, 163-166.
7. J. M. Couveignes and F. Morain, “Schoof’s algorithm and isogeny cycles”, Proceedings of the ANTS-I, Lecture Notes in Compute Science, 877 (1994), Springer- Verlag, 43-58.
8. T. Denny, O. Schirokauer and D. Weber,’’Discrete logarithms: the effectiveness of the index calculus method”, Proceedings of ANTSII, Lecture Notes in Computer Science, 1122(1996), Springer-Verlag, 337-361.
9. M. Deuring, “Die typen der multiplikatorenringe elliptischer funktionenkorper”, Abh. Math. Sem. Hamburg, 14(1941), 197-272.
10. N. D. Elkies, “Explicit isogenies”, Preprint, 1991
11. 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.
12. “Proposed federal information processing standard for digital signature standard (DSS)”, Federal Register, 56 No. 169, 30 Aug 1991, 42980-42982.
13. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Trans. Inform. Theory, IT-31 (1985), 469-472.
14. D. M. Gordon, “Discrete logarithms in GF(p) using the number field sieve”, SIAM J. on Discrete Math., 6(1993), 124-138.
15. R. Harasawa, H. Imai, J. Shikata, J. Suzuki, “Comparing the MOV and FR Reductions in Elliptic Curve Cryptography”, Advances in Cryptology-Proceedings of EUROCRYPT’99, Lecture notes in Computer Science, 1592 (1999), 190-205.
16. K. Ireland and M. Rosen, A classical introduction to modern number theory, GTM 84, Springer-Verlag, New-York, 1982.
17. IEEE P1363 Working Draft, June 16, 1998.
18. N. Kanayama, T. Kobayashi, T. Saito, and S. Uchiyama”Remarks on elliptic curve discrete logarithm problems”, IEICE Trans., Fundamentals. vol. E83-A, No.1(2000), 17-23.
19. N. Koblitz, “Elliptic curve cryptosystems”, Mathematics of Computation, 48 (1987), 203-209.
20. N. Koblitz, “An elliptic curve implementation of the finite field digital signature algotirhm”, Advances in Cryptology-Proceedings of CRYPTO’98, Lecture Notes in Computer Science, 1462(1998), Springer-Verlag, 327-337.
21. M. Kasahara, K. Ohgishi, and R. Sakai”Notes on ID-based key sharing systems on elliptic curve”, IEICE Japan Tech. Rep., ISEC99-57(1999-11), 37-42.
22. M. Kasahara, K. Ohgishi, and R. Sakai”Cryptosystems based on pairing”, The 2000 Symposium on Cryptography and Information Security, SCIS2000-C20, Jan. 2000.
23. S. Lang, Elliptic Functions, GTM112, Springer-Verlag, New York, 1987.
24. A. Menezes, T. Okamoto and S. Vanstone, “Reducing elliptic curve logarithms to logarithms in a finite field”, Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (1991), 80-89.
25. V. S. Miller, “Use of elliptic curves in cryptography”, Advances in Cryptology- Proceedings of Crypto’85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417-426.
26. S. C. Pohlig and M. E. Hellman, “An improved algorithm for computing logarithms over GF(p) and its cryptographic significance”, IEEE Trans. Inf. Theory, IT-24 (1978), 106-110.
27. J. Pollard, “Monte Carlo methods for index computation (mod p)”, Mathematics of Computation, 32 (1978), 918-924.
28. R. Rivest, A. Shamir and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, Communications of the ACM, 21 No. 2 (1978), 120-126.
29. T. Saitoh and S. Uchiyama,”A Note on the Discrete Logarithm Problem on Elliptic Curves of Trace Two”, Technical Report of IEICE, ISEC98-27(1998), 51-57.
30. R. Schoof, “Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p”, Mathematics of computation, 44 (1985), 483-494.
31. R. Schoof, “Nonsingular plane cubic curves over finite fields”, Jornal of Combination Theory, vol. A 46 (1987), 183-211.
32. R. Schoof, “Counting points on elliptic curve over finite fields”, Journal de Theorie des Nombres die Bordeux, 7 (1995), 219-254.
33. Standards for Efficient Cryptography Group. http://www.secg.org/
34. I. A. Semaev “Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p”, Mathematics of computation, 67 (1998), 353-356.
35. J. H. Silverman, The Arithmetic of Elliptic Curves, GTM 106, Springer-Verlag, New York, 1986.
36. N. P. Smart “The discrete logarithm problem on elliptic curves of trace one”, J. Cryptology, 12 (1999), 193-196.
37. T. Takagi, Syotou seisuuronn kougi, Kyouritu Syuppan, 1971, (in Japanese).
38. Torbjorn Granlund, THE GNU MP LIBRARY, version 3.1, August 2000. ftp://ftp.gnu.org/gnu/gmp/gmp-3.1.tar.gz