Name
Title | ||
|---|---|---|
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 F-pn 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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-61273-7_5 | PARADIGMS IN CRYPTOLOGY - MYCRYPT 2016: MALICIOUS AND EXPLORATORY CRYPTOLOGY |
DocType | Volume | ISSN |
Conference | 10311 | 0302-9743 |
Citations | PageRank | References |
2 | 0.36 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alfred J. Menezes | 1 | 156 | 31.46 |
| Palash Sarkar | 2 | 1505 | 130.85 |
| Shashank Singh | 3 | 22 | 2.45 |