Efficient Final Exponentiation for Pairings on Several Curves Resistant to Special TNFS

Yuki Nanjo, Masaaki Shirase, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami

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

Abstract

Pairings on elliptic curves are exploited for pairing-based cryptography, e.g., ID-based encryption and group signature authentication. For secure cryptography, it is important to choose the curves that have resistance to a special variant of the tower number field sieve (TNFS) that is an attack for the finite fields. However, for the pairings on several curves with embedding degree k=\{10,11,13,14\} resistant to the special TNFS, efficient algorithms for computing the final exponentiation constructed by the lattice-based method have not been provided. For these curves, the authors present efficient algorithms with the calculation costs in this manuscript.

Original languageEnglish
Title of host publicationProceedings - 2021 9th International Symposium on Computing and Networking, CANDAR 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages48-55
Number of pages8
ISBN (Electronic)9781665442466
DOIs
Publication statusPublished - 2021
Event9th International Symposium on Computing and Networking, CANDAR 2021 - Virtual, Online, Japan
Duration: Nov 23 2021Nov 26 2021

Publication series

NameProceedings - 2021 9th International Symposium on Computing and Networking, CANDAR 2021

Conference

Conference9th International Symposium on Computing and Networking, CANDAR 2021
Country/TerritoryJapan
CityVirtual, Online
Period11/23/2111/26/21

Keywords

  • elliptic curve
  • Pairing-based cryptography
  • special TNFS

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Efficient Final Exponentiation for Pairings on Several Curves Resistant to Special TNFS'. Together they form a unique fingerprint.

Cite this