Paper 2016/1102

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

Alfred Menezes, 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. MINOR revision.Mycrypt 2016
Keywords
finite fieldsdiscrete logarithm problemtower number field sievebilinear pairings
Contact author(s)
palash @ isical ac in
History
2016-12-27: revised
2016-11-23: received
See all versions
Short URL
https://ia.cr/2016/1102
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2016/1102}},
      url = {https://eprint.iacr.org/2016/1102}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.