Welcome to the resource topic for 2016/1102
Title:
Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography
Authors: Alfred Menezes, Palash Sarkar, 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.
ePrint: https://eprint.iacr.org/2016/1102
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .