Abstract
In the past two years there have been several advances in Number Field Sieve (NFS) algorithms for computing discrete logarithms in finite fields Fpnwhere 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.
Cite
CITATION STYLE
Menezes, A., Sarkar, P., & Singh, S. (2017). Challenges with assessing the impact of nfs advances on the security of pairing-based cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10311 LNCS, pp. 83–108). Springer Verlag. https://doi.org/10.1007/978-3-319-61273-7_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
