Application of scalar multiplication of edwards curves to pairing-based cryptography

Takanori Yasuda; Tsuyoshi Takagi; Kouichi Sakurai

doi:10.1007/978-3-642-34117-5-2

Application of scalar multiplication of edwards curves to pairing-based cryptography

Takanori Yasuda, Tsuyoshi Takagi, Kouichi Sakurai

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

1 Citation (Scopus)

Abstract

Edwards curves have efficient scalar multiplication algorithms, and their application to pairing-based cryptography has been studied. In particular, if a pairing-friendly curve used in a pairing-based protocol is isomorphic to an Edwards curve, all the scalar multiplication appearing in the protocol can be computed efficiently. In this paper, we extend this idea to pairing-friendly curves not isomorphic but isogenous to Edwards curves, and add to pairing-friendly curves to which Edwards curves can be applied. Above all, pairing-friendly curves with smaller ρ-values provide more efficient pairing computation. Therefore, we investigate whether pairing-friendly curves with the minimal ρ-values are isogenous to Edwards curves for embedding degree up to 50. Based on the investigation, we present parameters of pairing-friendly curves with 160-bit and 256-bit security level at embedding degree 16 and 24, respectively. These curves have the minimal ρ-values and are not isomorphic but isogenous to Edwards curves, and thus our proposed method is effective for these curves.

Original language	English
Title of host publication	Advances in Information and Computer Security - 7th International Workshop on Security, IWSEC 2012, Proceedings
Pages	19-36
Number of pages	18
Volume	7631 LNCS
DOIs	https://doi.org/10.1007/978-3-642-34117-5-2
Publication status	Published - 2012
Event	7th International Workshop on Security, IWSEC 2012 - Fukuoka, Japan Duration: Nov 7 2012 → Nov 9 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7631 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	7th International Workshop on Security, IWSEC 2012
Country	Japan
City	Fukuoka
Period	11/7/12 → 11/9/12

All Science Journal Classification (ASJC) codes

Computer Science(all)
Theoretical Computer Science

Access to Document

10.1007/978-3-642-34117-5-2

Fingerprint Dive into the research topics of 'Application of scalar multiplication of edwards curves to pairing-based cryptography'. Together they form a unique fingerprint.

Cite this

Yasuda, T., Takagi, T., & Sakurai, K. (2012). Application of scalar multiplication of edwards curves to pairing-based cryptography. In Advances in Information and Computer Security - 7th International Workshop on Security, IWSEC 2012, Proceedings (Vol. 7631 LNCS, pp. 19-36). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7631 LNCS). https://doi.org/10.1007/978-3-642-34117-5-2

Application of scalar multiplication of edwards curves to pairing-based cryptography. / Yasuda, Takanori; Takagi, Tsuyoshi; Sakurai, Kouichi.

Advances in Information and Computer Security - 7th International Workshop on Security, IWSEC 2012, Proceedings. Vol. 7631 LNCS 2012. p. 19-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7631 LNCS).

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

Yasuda, T, Takagi, T & Sakurai, K 2012, Application of scalar multiplication of edwards curves to pairing-based cryptography. in Advances in Information and Computer Security - 7th International Workshop on Security, IWSEC 2012, Proceedings. vol. 7631 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7631 LNCS, pp. 19-36, 7th International Workshop on Security, IWSEC 2012, Fukuoka, Japan, 11/7/12. https://doi.org/10.1007/978-3-642-34117-5-2

Yasuda T, Takagi T, Sakurai K. Application of scalar multiplication of edwards curves to pairing-based cryptography. In Advances in Information and Computer Security - 7th International Workshop on Security, IWSEC 2012, Proceedings. Vol. 7631 LNCS. 2012. p. 19-36. (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-34117-5-2

Yasuda, Takanori ; Takagi, Tsuyoshi ; Sakurai, Kouichi. / Application of scalar multiplication of edwards curves to pairing-based cryptography. Advances in Information and Computer Security - 7th International Workshop on Security, IWSEC 2012, Proceedings. Vol. 7631 LNCS 2012. pp. 19-36 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cb9a5985667141db89187786939a23bf,

title = "Application of scalar multiplication of edwards curves to pairing-based cryptography",

abstract = "Edwards curves have efficient scalar multiplication algorithms, and their application to pairing-based cryptography has been studied. In particular, if a pairing-friendly curve used in a pairing-based protocol is isomorphic to an Edwards curve, all the scalar multiplication appearing in the protocol can be computed efficiently. In this paper, we extend this idea to pairing-friendly curves not isomorphic but isogenous to Edwards curves, and add to pairing-friendly curves to which Edwards curves can be applied. Above all, pairing-friendly curves with smaller ρ-values provide more efficient pairing computation. Therefore, we investigate whether pairing-friendly curves with the minimal ρ-values are isogenous to Edwards curves for embedding degree up to 50. Based on the investigation, we present parameters of pairing-friendly curves with 160-bit and 256-bit security level at embedding degree 16 and 24, respectively. These curves have the minimal ρ-values and are not isomorphic but isogenous to Edwards curves, and thus our proposed method is effective for these curves.",

author = "Takanori Yasuda and Tsuyoshi Takagi and Kouichi Sakurai",

year = "2012",

doi = "10.1007/978-3-642-34117-5-2",

language = "English",

isbn = "9783642341168",

volume = "7631 LNCS",

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

pages = "19--36",

booktitle = "Advances in Information and Computer Security - 7th International Workshop on Security, IWSEC 2012, Proceedings",

note = "7th International Workshop on Security, IWSEC 2012 ; Conference date: 07-11-2012 Through 09-11-2012",

}

TY - GEN

T1 - Application of scalar multiplication of edwards curves to pairing-based cryptography

AU - Yasuda, Takanori

AU - Takagi, Tsuyoshi

AU - Sakurai, Kouichi

PY - 2012

Y1 - 2012

N2 - Edwards curves have efficient scalar multiplication algorithms, and their application to pairing-based cryptography has been studied. In particular, if a pairing-friendly curve used in a pairing-based protocol is isomorphic to an Edwards curve, all the scalar multiplication appearing in the protocol can be computed efficiently. In this paper, we extend this idea to pairing-friendly curves not isomorphic but isogenous to Edwards curves, and add to pairing-friendly curves to which Edwards curves can be applied. Above all, pairing-friendly curves with smaller ρ-values provide more efficient pairing computation. Therefore, we investigate whether pairing-friendly curves with the minimal ρ-values are isogenous to Edwards curves for embedding degree up to 50. Based on the investigation, we present parameters of pairing-friendly curves with 160-bit and 256-bit security level at embedding degree 16 and 24, respectively. These curves have the minimal ρ-values and are not isomorphic but isogenous to Edwards curves, and thus our proposed method is effective for these curves.

AB - Edwards curves have efficient scalar multiplication algorithms, and their application to pairing-based cryptography has been studied. In particular, if a pairing-friendly curve used in a pairing-based protocol is isomorphic to an Edwards curve, all the scalar multiplication appearing in the protocol can be computed efficiently. In this paper, we extend this idea to pairing-friendly curves not isomorphic but isogenous to Edwards curves, and add to pairing-friendly curves to which Edwards curves can be applied. Above all, pairing-friendly curves with smaller ρ-values provide more efficient pairing computation. Therefore, we investigate whether pairing-friendly curves with the minimal ρ-values are isogenous to Edwards curves for embedding degree up to 50. Based on the investigation, we present parameters of pairing-friendly curves with 160-bit and 256-bit security level at embedding degree 16 and 24, respectively. These curves have the minimal ρ-values and are not isomorphic but isogenous to Edwards curves, and thus our proposed method is effective for these curves.

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

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

U2 - 10.1007/978-3-642-34117-5-2

DO - 10.1007/978-3-642-34117-5-2

M3 - Conference contribution

AN - SCOPUS:84868378996

SN - 9783642341168

VL - 7631 LNCS

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

SP - 19

EP - 36

BT - Advances in Information and Computer Security - 7th International Workshop on Security, IWSEC 2012, Proceedings

T2 - 7th International Workshop on Security, IWSEC 2012

Y2 - 7 November 2012 through 9 November 2012

ER -