Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks

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

Volumn 839 LNCS, Issue , 1994, Pages 50-55

  Chao, Jinhui ^a   Tanada, Kazuo ^b   Tsujii, Shigeo ^a  

^a CHUO UNIVERSITY   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

COMPLEX MULTIPLICATION; DESIGN STRATEGIES; ELLIPTIC CURVE; LOWER BOUNDARY; PRIME FIELD;

CRYPTOGRAPHY;

EID: 84957382777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48658-5_6     Document Type: Conference Paper

References (18)

1. Miller, V. S.: Use of elliptic curves in cryptography. Advances in Cryptology-CRYPTO’85, Lecture Notes in Computer Science, 218 (1986) 417–426
2. Koblitz, N.: Elliptic Curve Cryptosystems. Math. Comp. 48 (1987) 203–209
3. Menezes, A. J.: Elliptic Curve Public Key Cryptosystems Kluwer Academic Publishers (1993)
4. Knuth, D. E.: The art of computer programming, Sorting and searching. vol. 3, Addison Wesley (1973)
5. Menezes, A. J., Vanstone, S., Okamoto T.: Reducing elliptic curve logarithms to logarithms in a finite field. Proc. of STOC’91 (1991) 80–89
6. Pohlig, S. C., Hellman, M. E.: An improved algorithm for computing logarithm over GF(p)and its cryptographic significance. IEEE Trans. Information Theory, IT-24,1 (1978) 106–110
7. Adleman, L. M.: A subexponential algorithm for the discrete logarithm problem with applications to cryptography. Proc. of IEEE 20th Symp. on Foundations of Comp. Sci. (1979) 55–60
8. Koblitz, N.: Elliptic curve implementation of zero-knowledge blobs. Journal of Cryptology, vol. 4, No. 3 (1991) 207–213
9. Atkin, A. O. L., Morain F.: Elliptic curves and primality proving. Research Report 1256, INRIA, June (1990)
10. Morain, F., Building cyclic elliptic curves modulo large primes. Advances in Cryptology-EUROCRYPT’91, Lecture Notes in Computer Science, 547 (1991) 328–336
11. Chao, J., Tanada, K., Tsujii S.: On secure elliptic curves against the “reduction attack” and their design strategy. Proc. of SCIS’94 (1994) 10A, IEICE Tech. Report, ISEC93-100, 29–37
12. Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp. 44 (1985) 483–494
13. Berlekamp, E. R.: Algebraic coding theory. MacGraw-Hill (1968)
14. Robin, M. O.: Probabilistic algorithm in finite fields. SIAM J. on Comput., Vol.9, No.2 (1980) 273–280
15. Miyaji, A.: On ordinary elliptic curve cryptosystems. Advances in Cryptology-ASIACRYPT’91, Lecture Notes on Computer Science 739 (1991) 460–469
16. Miyaji, A.: Fast elliptic curve cryptosystems, Technical Report of IEICE (1993) COMP93–25
17. Chao, J., Ikemoto, H., Tanada, K., Tsujii, S.: On Discrete Logarithm Problems over elliptic curves with p-divisible groups. Proc. of Joint Workshop on Information Security and Cryptography, JW-ISC93 (1993) 99–104
18. Koblitz, N.: Constructing elliptic curve cryptosystems in characteristic 2. Advances in Cryptology-CRYPTO’90, Lecture Notes in Computer Science, 537 (1990) 156–167