Paper 2016/1102 Original: eprint.iacr.org/2016/1102 ↗
Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2016-12-27: last updated
- 2016-11-23: published
- Short URL
- https://ia.cr/2016/1102
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2016/1102,
author = {Alfred Menezes and Palash Sarkar and Shashank Singh},
title = {Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/1102},
year = {2016},
url = {https://eprint.iacr.org/2016/1102}
}