论文信息 - On Ordinary Elliptic Curve Cryptosystems

On Ordinary Elliptic Curve Cryptosystems

Recently, a method, reducing the elliptic curve discrete logarithm problem(EDLP) to the discrete logarithm problem(DLP) in a finite field, was proposed. But this reducing is valid only when Weil pairing can be defined over the m-torsion group which includes the base point of EDLP. If an elliptic curve is ordinary, there exists EDLP to which we cannot apply the reducing. In this paper, we investigate the condition for which this reducing is invalid. We show the next two main results.

Atsuko Miyaji | A. Miyaji

[1] Andreas Bender,et al. On the Implementation of Elliptic Curve Cryptosystems , 1989, CRYPTO.

[2] H. E. Rose. A course in number theory , 1988 .

[3] Victor S. Miller,et al. Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[4] François Morain. Building Elliptic Curves Modulo Large Primes , 1991, EUROCRYPT.

[5] P. Ribenboim. The Book of Prime Number Records , 1988 .

[6] M. Deuring. Die Typen der Multiplikatorenringe elliptischer Funktionenkörper , 1941 .

[7] Alfred Menezes,et al. Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.

[8] N. Koblitz. A Course in Number Theory and Cryptography , 1987 .

[9] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.

[10] S. Lang. Algebraic Number Theory , 1971 .

[11] Thomas Beth,et al. Non Supersingular Elliptic Curves for Public Key Cryptosystems , 1991, EUROCRYPT.

[12] N. Koblitz. Elliptic curve cryptosystems , 1987 .

[13] A. Atkin,et al. ELLIPTIC CURVES AND PRIMALITY PROVING , 1993 .

[14] Kouichi Sakurai,et al. On the Complexity of Hyperelliptic Discrete Logarithm Problem , 1991, EUROCRYPT.