Secure and efficient pairing at 256-Bit security level

Yutaro Kiyomura, Akiko Inoue, Yuto Kawahara, Masaya Yasuda, Tsuyoshi Takagi, Tetsutaro Kobayashi

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

9 被引用数 (Scopus)

抄録

At CRYPTO 2016, Kim and Barbulescu proposed an efficient number field sieve (NFS) algorithm for the discrete logarithm problem (DLP) in a finite field. The security of pairing-based cryptography (PBC) is based on the difficulty in solving the DLP. Hence, it has become necessary to revise the bitlength that the DLP is computationally infeasible against the efficient NFS algorithms. The timing of the main operations of PBC (i.e. pairing, scalar multiplication on the elliptic curves, and exponentiation on the finite field) generally becomes slower as the bitlength becomes longer, so it has become increasingly important to compute the main operations of PBC more efficiently. To choose a suitable pairing-friendly curve from among various pairing-friendly curves is one of the factors that affect the efficiency of computing the main operations of PBC. We should implement the main operations of PBC and compare the timing among some pairing-friendly curves in order to choose the suitable pairing-friendly curve precisely. In this paper, we focus on the five candidate pairing-friendly curves from the Barreto- Lynn-Scott (BLS) and Kachisa-Schaefer-Scott (KSS) families as the 256- bit secure pairing-friendly curves and show the following two results; (1) the revised bitlength that the DLP is computationally infeasible against the efficient NFS algorithms for each candidate pairing-friendly curve, (2) the suitable pairing-friendly curve by comparing the timing of the main operations of PBC among the candidate pairing-friendly curves using the revised bitlength.

本文言語英語
ホスト出版物のタイトルApplied Cryptography and Network Security - 15th International Conference, ACNS 2017, Proceedings
編集者Dieter Gollmann, Atsuko Miyaji, Hiroaki Kikuchi
出版社Springer Verlag
ページ59-79
ページ数21
ISBN(印刷版)9783319612034
DOI
出版ステータス出版済み - 2017
イベント15th International Conference on Applied Cryptography and Network Security, ACNS 2017 - Kanazawa, 日本
継続期間: 7月 10 20177月 12 2017

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10355 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他15th International Conference on Applied Cryptography and Network Security, ACNS 2017
国/地域日本
CityKanazawa
Period7/10/177/12/17

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Secure and efficient pairing at 256-Bit security level」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル