On the strength comparison of the ECDLP and the IFP

Masaya Yasuda; Takeshi Shimoyama; Jun Kogure; Tetsuya Izu

doi:10.1007/978-3-642-32928-9_17

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 proceeding › Conference 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 language	English
Title of host publication	Security and Cryptography for Networks - 8th International Conference, SCN 2012, Proceedings
Pages	302-325
Number of pages	24
DOIs	https://doi.org/10.1007/978-3-642-32928-9_17
Publication status	Published - Oct 1 2012
Externally published	Yes
Event	8th International Conference on Security and Cryptography for Networks, SCN 2012 - Amalfi, Italy Duration: Sep 5 2012 → Sep 7 2012

Publication series

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

Other

Other	8th International Conference on Security and Cryptography for Networks, SCN 2012
Country	Italy
City	Amalfi
Period	9/5/12 → 9/7/12

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-32928-9_17

Fingerprint Dive into the research topics of 'On the strength comparison of the ECDLP and the IFP'. Together they form a unique fingerprint.

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

On the strength comparison of the ECDLP and the IFP. / Yasuda, Masaya; Shimoyama, Takeshi; Kogure, Jun; Izu, Tetsuya.

Security and Cryptography for Networks - 8th International Conference, SCN 2012, Proceedings. 2012. p. 302-325 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7485 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7485 LNCS, pp. 302-325, 8th International Conference on Security and Cryptography for Networks, SCN 2012, Amalfi, Italy, 9/5/12. https://doi.org/10.1007/978-3-642-32928-9_17

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

@inproceedings{17dd53ffcd6941d4bd27dae99abdaa4f,

title = "On the strength comparison of the ECDLP and the IFP",

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.",

author = "Masaya Yasuda and Takeshi Shimoyama and Jun Kogure and Tetsuya Izu",

year = "2012",

month = oct,

day = "1",

doi = "10.1007/978-3-642-32928-9_17",

language = "English",

isbn = "9783642329272",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "302--325",

booktitle = "Security and Cryptography for Networks - 8th International Conference, SCN 2012, Proceedings",

note = "8th International Conference on Security and Cryptography for Networks, SCN 2012 ; Conference date: 05-09-2012 Through 07-09-2012",

}

TY - GEN

T1 - On the strength comparison of the ECDLP and the IFP

AU - Yasuda, Masaya

AU - Shimoyama, Takeshi

AU - Kogure, Jun

AU - Izu, Tetsuya

PY - 2012/10/1

Y1 - 2012/10/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84866666345&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866666345&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-32928-9_17

DO - 10.1007/978-3-642-32928-9_17

M3 - Conference contribution

AN - SCOPUS:84866666345

SN - 9783642329272

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

SP - 302

EP - 325

BT - Security and Cryptography for Networks - 8th International Conference, SCN 2012, Proceedings

T2 - 8th International Conference on Security and Cryptography for Networks, SCN 2012

Y2 - 5 September 2012 through 7 September 2012

ER -