On the strength comparison of the ECDLP and the IFP

Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Tetsuya Izu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

At present, the RSA cryptosystem is most widely used in public key cryptography. On the other hand, elliptic curve cryptography (ECC) has recently received much attention since smaller ECC key sizes provide the same security level as RSA. Although there are a lot of previous works that analyze the security of ECC and RSA, the comparison of strengths varies depending on analysis. The aim of this paper is once again to compare the security strengths, considering state-of-the-art of theory and experiments. The security of RSA is closely related to the hardness of the integer factorization problem (IFP), while the security of ECC is closely related to the elliptic curve discrete logarithm problem (ECDLP). In this paper, we compare the computing power required to solve the ECDLP and the IFP, respectively, and estimate the sizes of the problems that provide the same level of security.

Original languageEnglish
Title of host publicationSecurity and Cryptography for Networks - 8th International Conference, SCN 2012, Proceedings
Pages302-325
Number of pages24
DOIs
Publication statusPublished - Oct 1 2012
Externally publishedYes
Event8th International Conference on Security and Cryptography for Networks, SCN 2012 - Amalfi, Italy
Duration: Sep 5 2012Sep 7 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7485 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other8th International Conference on Security and Cryptography for Networks, SCN 2012
CountryItaly
CityAmalfi
Period9/5/129/7/12

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yasuda, M., Shimoyama, T., Kogure, J., & Izu, T. (2012). On the strength comparison of the ECDLP and the IFP. In Security and Cryptography for Networks - 8th International Conference, SCN 2012, Proceedings (pp. 302-325). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7485 LNCS). https://doi.org/10.1007/978-3-642-32928-9_17