Cryptology ePrint Archive: Report 2018/1017

TNFS Resistant Families of Pairing-Friendly Elliptic Curves

Georgios Fotiadis and Elisavet Konstantinou

Abstract: Recently there has been a significant progress on the tower number field sieve (TNFS) method, reducing the complexity of the discrete logarithm problem (DLP) in finite field extensions of composite degree. These new variants of the TNFS attacks have a major impact on pairing-based cryptography and particularly on the selection of the underlying elliptic curve groups and extension fields. In this paper we revise the criteria for selecting pairing-friendly elliptic curves considering these new TNFS attacks in finite extensions of composite embedding degree. Additionally we update the criteria for finite extensions of prime degree in order to meet today’s security requirements.

Category / Keywords: public-key cryptography / Pairings, elliptic curves, pairing-friendly parameters, embedding degree, TNFS attacks

Original Publication (in the same form): Journal of Theoretical Computer Science, Elsevier (to appear)

Date: received 19 Oct 2018

Contact author: gfotiadis at aegean gr

Available format(s): PDF | BibTeX Citation

Version: 20181024:173411 (All versions of this report)

Short URL: ia.cr/2018/1017


[ Cryptology ePrint archive ]