Skip to main content
placeholder image

Improved Cryptanalysis of the KMOV Elliptic Curve Cryptosystem

Journal Article


Abstract


  • This paper presents two new improved attacks on the KMOV cryptosystem. KMOV is an encryption algorithm based on elliptic curves over the ring (formula presented) is a product of two large primes of equal bit size. The first attack uses the properties of the convergents of the continued fraction expansion of a specific value derived from the KMOV public key. The second attack is based on Coppersmith’s method for finding small solutions of a multivariate polynomial modular equation. Both attacks improve the existing attacks on the KMOV cryptosystem.

Publication Date


  • 2019

Citation


  • Nitaj, A., Susilo, W. & Tonien, J. (2019). Improved Cryptanalysis of the KMOV Elliptic Curve Cryptosystem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11821 LNCS 206-221.

Scopus Eid


  • 2-s2.0-85075752702

Number Of Pages


  • 15

Start Page


  • 206

End Page


  • 221

Volume


  • 11821 LNCS

Place Of Publication


  • Germany

Abstract


  • This paper presents two new improved attacks on the KMOV cryptosystem. KMOV is an encryption algorithm based on elliptic curves over the ring (formula presented) is a product of two large primes of equal bit size. The first attack uses the properties of the convergents of the continued fraction expansion of a specific value derived from the KMOV public key. The second attack is based on Coppersmith’s method for finding small solutions of a multivariate polynomial modular equation. Both attacks improve the existing attacks on the KMOV cryptosystem.

Publication Date


  • 2019

Citation


  • Nitaj, A., Susilo, W. & Tonien, J. (2019). Improved Cryptanalysis of the KMOV Elliptic Curve Cryptosystem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11821 LNCS 206-221.

Scopus Eid


  • 2-s2.0-85075752702

Number Of Pages


  • 15

Start Page


  • 206

End Page


  • 221

Volume


  • 11821 LNCS

Place Of Publication


  • Germany