Cryptology ePrint Archive: Report 2016/1102

Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography

Alfred Menezes and Palash Sarkar and Shashank Singh

Abstract: In the past two years there have been several advances in Number Field Sieve (NFS) algorithms for computing discrete logarithms in finite fields $\mathbb{F}_{p^n}$ where $p$ is prime and $n > 1$ is a small integer. This article presents a concise overview of these algorithms and discusses some of the challenges with assessing their impact on keylengths for pairing-based cryptosystems.

Category / Keywords: public-key cryptography / finite fields, discrete logarithm problem, tower number field sieve, bilinear pairings

Original Publication (with minor differences): Mycrypt 2016

Date: received 23 Nov 2016, last revised 27 Dec 2016

Contact author: palash at isical ac in

Available format(s): PDF | BibTeX Citation

Version: 20161227:162950 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]