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

TitleEfficient Final Exponentiation for Pairings on Several Curves Resistant to Special TNFS
Publication TypeConference Paper
Year of Publication2021
AuthorsNanjo, Yuki, Shirase, Masaaki, Kodera, Yuta, Kusaka, Takuya, Nogami, Yasuyuki
Conference Name2021 Ninth International Symposium on Computing and Networking (CANDAR)
Date Publishednov
KeywordsCosts, cryptography, elliptic curve, Elliptic curve cryptography, Elliptic curves, exponentiation, Identity-based encryption, pairing-based cryptography, Poles and towers, pubcrawl, resilience, Resiliency, Resistance, Scalability, special TNFS
AbstractPairings 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.
DOI10.1109/CANDAR53791.2021.00014
Citation Keynanjo_efficient_2021