On the security of the KMOV public key cryptosystem

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

Volumn 1294, Issue , 1997, Pages 236-248

  Bleichenbacher, D ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

ELLIPTIC CURVE; PUBLIC KEY CRYPTOSYSTEMS;

CRYPTOGRAPHY;

EID: 84958675978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052239     Document Type: Conference Paper

References (20)

1. J. Borst. Public key cryptosystems using elliptic curves. Master's thesis, Eindhoven University of Technology, Feb. 1997.
2. H. Cohen. A Course in Computational Algebraic Number Theory. Number 138 in Graduate Texts in Mathematics. Springer Verlag, 1993.
3. D. Coppersmith. Finding a small root of a univariate modular equation. In Advances in Cryptology - EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 155-165. Springer Verlag, 1996.
4. D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter. Low exponent RSA with related messages. In Advances in Cryptology - EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 1-9. Springer Verlag, 1996.
5. N. Demytko. A new elliptic curve based analogue of RSA. In T. Helleseth, editor, Advances in Cryptology - EUROCRYPT '93, volume 765 of Lecture notes in computer science, pages 40-49. Springer-Verlag, 1994.
6. J. Hastad. Solving simultaneous modular equations of low degree. SIAM J. Computing, 17(2):336-341, Apr. 1988.
7. M. Joye and J.-J. Quisquater. Overview and security analysis of RSA-type cryptosystems against various attacks. In Proc. of DIM ACS workshop on network threats, Nov. 1996.
8. M. Joye and J.-J. Quisquater. Protocol failure for RSA-like functions using Lucas sequences and elliptic curves over a ring. In M. Lomas, editor, Security Protocols, volume 1189 of Lecture Notes in Computer Science, pages 93-100. Springer Verlag, 1997.
9. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203-209, 1987.
10. K. Koyama. Fast RSA-type schemes based on singular cubic curves y2 + axy = sc3 (mod n). In Advances in Cryptology - EUROCRYPT '95, volume 921 of Lecture Notes in Computer Science, pages 329-340. Springer, 1995.
11. K. Koyama, U. Maurer, T. Okamoto, and S. Vanstone. New public-key schemes based on elliptic curves over the ring Z„. In J. Feigenbaum, editor, Advances in Cryptology - CRYPTO '91, volume 576, pages 252-266. Springer Verlag, 1992. Lecture Notes in Computer Science.
12. K. Kurosawa, K. Okada, and S. Tsujii. Low exponent attack against elliptic curve RSA. In Advances in Cryptology - ASIACRYPT 94, volume 917, pages 376-383. Springer Verlag, 1995.
13. H. Kuwakado and K. Koyama. Efficient cryptosystems over elliptic curves based on a product of form-free primes. IEICE Transactions on fundamentals of electronics, communications and computer sciences, E77-A(8):1309-1318, Aug. 1994.
14. H. Kuwakado and K. Koyama. Security of RSA-type cryptosystems over elliptic curves against Hastad attack. Electronic Letters, 30(22):1843-1844, Oct. 1994.
15. A. Menezes, editor. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
16. V. S. Miller. Use of elliptic curves in cryptography. In H. C. Williams, editor, Advances in Cryptology - CRYPTO '85, volume 218 of Lecture Notes in Computer Science, pages 417-426. Springer, 1986.
17. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 2l(2):120-126, 1978.
18. C. P. Schnorr and M. Euchner. Lattice basis reduction: Improved practical algorithms and solving subset sum problems. In L. Budach, editor, Proceedings of Fundamentals of Computation Theory (FCT '91), volume 529 of Lecture Notes in Computer Science, pages 68-85. Springer Verlag, Sept. 1991.
19. H. Shimizu. On the improvement of the Hastad bound. In 1996 IEICE Fall Conference, volume A-162, 1996. (In Japanese).
20. T. Takagi and S. Naito. The multi-variable modular polynomial and its applications to cryptography. In 7th International Symposium on Algorithm and Computation, ISAAC'96, volume 1178 of Lecture Notes in Computer Science, pages 386-396. Springer Verlag, 1996.