An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication

Md Al Amin Khandaker; Hirotaka Ono; Yasuyuki Nogami; Masaaki Shirase; Sylvain Duquesne

doi:10.1007/978-3-319-53177-9_11

An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication

Md Al Amin Khandaker, Hirotaka Ono, Yasuyuki Nogami, Masaaki Shirase, Sylvain Duquesne

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

1 Citation (Scopus)

Abstract

Acceleration of a pairing calculation of an Ate-based pairing such as Optimal Ate pairing depends not only on the optimization of Miller algorithm’s loop parameter but also on efficient elliptic curve arithmetic operation and efficient final exponentiation. Some recent works have shown the implementation of Optimal Ate pairing over Kachisa- Schaefer-Scott (KSS) curve of embedding degree 18. Pairing over KSS curve is regarded as the basis of next generation security protocols. This paper has proposed a pseudo 12-sparse multiplication to accelerate Miller’s loop calculation in KSS curve by utilizing the property of rational point groups. In addition, this papers has showed an enhancement of the elliptic curve addition and doubling calculation in Miller’s algorithm by applying implicit mapping of its sextic twisted isomorphic group. Moreover this paper has implemented the proposal with recommended security parameter settings for KSS curve at 192 bit security level. The simulation result shows that the proposed pseudo 12-sparse multiplication gives more efficient Miller’s loop calculation of an Optimal Ate pairing operation along with recommended parameters than pairing calculation without sparse multiplication.

Original language	English
Title of host publication	Information Security and Cryptology – ICISC 2016 - 19th International Conference, Revised Selected Papers
Editors	Seokhie Hong, Jong Hwan Park
Publisher	Springer Verlag
Pages	208-219
Number of pages	12
ISBN (Print)	9783319531762
DOIs	https://doi.org/10.1007/978-3-319-53177-9_11
Publication status	Published - 2017
Event	19th International Conference on Information Security and Cryptology, ICISC 2016 - Seoul, Korea, Republic of Duration: Nov 30 2016 → Dec 2 2016

Publication series

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

Other

Other	19th International Conference on Information Security and Cryptology, ICISC 2016
Country/Territory	Korea, Republic of
City	Seoul
Period	11/30/16 → 12/2/16

Keywords

KSS curve
Optimal Ate pairing
Sparse multiplication

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-319-53177-9_11

Cite this

Khandaker, M. A. A., Ono, H., Nogami, Y., Shirase, M., & Duquesne, S. (2017). An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication. In S. Hong, & J. H. Park (Eds.), Information Security and Cryptology – ICISC 2016 - 19th International Conference, Revised Selected Papers (pp. 208-219). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10157 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-53177-9_11

An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication. / Khandaker, Md Al Amin; Ono, Hirotaka; Nogami, Yasuyuki et al.

Information Security and Cryptology – ICISC 2016 - 19th International Conference, Revised Selected Papers. ed. / Seokhie Hong; Jong Hwan Park. Springer Verlag, 2017. p. 208-219 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10157 LNCS).

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

Khandaker, MAA, Ono, H, Nogami, Y, Shirase, M & Duquesne, S 2017, An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication. in S Hong & JH Park (eds), Information Security and Cryptology – ICISC 2016 - 19th International Conference, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10157 LNCS, Springer Verlag, pp. 208-219, 19th International Conference on Information Security and Cryptology, ICISC 2016, Seoul, Korea, Republic of, 11/30/16. https://doi.org/10.1007/978-3-319-53177-9_11

Khandaker MAA, Ono H, Nogami Y, Shirase M, Duquesne S. An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication. In Hong S, Park JH, editors, Information Security and Cryptology – ICISC 2016 - 19th International Conference, Revised Selected Papers. Springer Verlag. 2017. p. 208-219. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-53177-9_11

Khandaker, Md Al Amin ; Ono, Hirotaka ; Nogami, Yasuyuki et al. / An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication. Information Security and Cryptology – ICISC 2016 - 19th International Conference, Revised Selected Papers. editor / Seokhie Hong ; Jong Hwan Park. Springer Verlag, 2017. pp. 208-219 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{95531f6e2c204131b81ac9a0887c6519,

title = "An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication",

abstract = "Acceleration of a pairing calculation of an Ate-based pairing such as Optimal Ate pairing depends not only on the optimization of Miller algorithm{\textquoteright}s loop parameter but also on efficient elliptic curve arithmetic operation and efficient final exponentiation. Some recent works have shown the implementation of Optimal Ate pairing over Kachisa- Schaefer-Scott (KSS) curve of embedding degree 18. Pairing over KSS curve is regarded as the basis of next generation security protocols. This paper has proposed a pseudo 12-sparse multiplication to accelerate Miller{\textquoteright}s loop calculation in KSS curve by utilizing the property of rational point groups. In addition, this papers has showed an enhancement of the elliptic curve addition and doubling calculation in Miller{\textquoteright}s algorithm by applying implicit mapping of its sextic twisted isomorphic group. Moreover this paper has implemented the proposal with recommended security parameter settings for KSS curve at 192 bit security level. The simulation result shows that the proposed pseudo 12-sparse multiplication gives more efficient Miller{\textquoteright}s loop calculation of an Optimal Ate pairing operation along with recommended parameters than pairing calculation without sparse multiplication.",

keywords = "KSS curve, Optimal Ate pairing, Sparse multiplication",

author = "Khandaker, {Md Al Amin} and Hirotaka Ono and Yasuyuki Nogami and Masaaki Shirase and Sylvain Duquesne",

note = "Funding Information: This work is partially supported by the Strategic Information and Communications R&D Promotion Programme (SCOPE) of Ministry of Internal Affairs and Communications, Japan. Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 19th International Conference on Information Security and Cryptology, ICISC 2016 ; Conference date: 30-11-2016 Through 02-12-2016",

year = "2017",

doi = "10.1007/978-3-319-53177-9_11",

language = "English",

isbn = "9783319531762",

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

publisher = "Springer Verlag",

pages = "208--219",

editor = "Seokhie Hong and Park, {Jong Hwan}",

booktitle = "Information Security and Cryptology – ICISC 2016 - 19th International Conference, Revised Selected Papers",

}

TY - GEN

T1 - An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication

AU - Khandaker, Md Al Amin

AU - Ono, Hirotaka

AU - Nogami, Yasuyuki

AU - Shirase, Masaaki

AU - Duquesne, Sylvain

N1 - Funding Information: This work is partially supported by the Strategic Information and Communications R&D Promotion Programme (SCOPE) of Ministry of Internal Affairs and Communications, Japan. Publisher Copyright: © Springer International Publishing AG 2017.

PY - 2017

Y1 - 2017

N2 - Acceleration of a pairing calculation of an Ate-based pairing such as Optimal Ate pairing depends not only on the optimization of Miller algorithm’s loop parameter but also on efficient elliptic curve arithmetic operation and efficient final exponentiation. Some recent works have shown the implementation of Optimal Ate pairing over Kachisa- Schaefer-Scott (KSS) curve of embedding degree 18. Pairing over KSS curve is regarded as the basis of next generation security protocols. This paper has proposed a pseudo 12-sparse multiplication to accelerate Miller’s loop calculation in KSS curve by utilizing the property of rational point groups. In addition, this papers has showed an enhancement of the elliptic curve addition and doubling calculation in Miller’s algorithm by applying implicit mapping of its sextic twisted isomorphic group. Moreover this paper has implemented the proposal with recommended security parameter settings for KSS curve at 192 bit security level. The simulation result shows that the proposed pseudo 12-sparse multiplication gives more efficient Miller’s loop calculation of an Optimal Ate pairing operation along with recommended parameters than pairing calculation without sparse multiplication.

AB - Acceleration of a pairing calculation of an Ate-based pairing such as Optimal Ate pairing depends not only on the optimization of Miller algorithm’s loop parameter but also on efficient elliptic curve arithmetic operation and efficient final exponentiation. Some recent works have shown the implementation of Optimal Ate pairing over Kachisa- Schaefer-Scott (KSS) curve of embedding degree 18. Pairing over KSS curve is regarded as the basis of next generation security protocols. This paper has proposed a pseudo 12-sparse multiplication to accelerate Miller’s loop calculation in KSS curve by utilizing the property of rational point groups. In addition, this papers has showed an enhancement of the elliptic curve addition and doubling calculation in Miller’s algorithm by applying implicit mapping of its sextic twisted isomorphic group. Moreover this paper has implemented the proposal with recommended security parameter settings for KSS curve at 192 bit security level. The simulation result shows that the proposed pseudo 12-sparse multiplication gives more efficient Miller’s loop calculation of an Optimal Ate pairing operation along with recommended parameters than pairing calculation without sparse multiplication.

KW - KSS curve

KW - Optimal Ate pairing

KW - Sparse multiplication

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

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

U2 - 10.1007/978-3-319-53177-9_11

DO - 10.1007/978-3-319-53177-9_11

M3 - Conference contribution

AN - SCOPUS:85012992017

SN - 9783319531762

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

SP - 208

EP - 219

BT - Information Security and Cryptology – ICISC 2016 - 19th International Conference, Revised Selected Papers

A2 - Hong, Seokhie

A2 - Park, Jong Hwan

PB - Springer Verlag

T2 - 19th International Conference on Information Security and Cryptology, ICISC 2016

Y2 - 30 November 2016 through 2 December 2016

ER -

An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this