Selecting Cryptographic Key Sizes
By A. Lenstra, E. Verheul. Journal of Cryptology, 2000
1,188 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Information Systems
View Paper: https://www.semanticscholar.org/paper/2b6d281baa0849862ab72026f546643518fa1062
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Brent Waters
- Dan Boneh
- Shai Halevi
- Craig Gentry
- Michael Naehrig
- Amit Sahai
- Chris Peikert
- Jean-Pierre Hubaux
In Information Systems
- Jean-Pierre Hubaux
- Shai Halevi
- Dan Boneh
- Jonathan Katz
- Pil Joong Lee
- Chris Peikert
- Michael Naehrig
- Adrian Perrig
Citations in the corpus
- Public Key Cryptography in Sensor Networks - Revisited (2004, methodology): “For Rabin's Scheme we selected an operand size of 512 bits, which according to Lenstra and Verheul [13] provides a security level of around 60 bits.”
- L1 - An Intermediate Language for Mixed-Protocol Secure Computation (2011, background): “The bit length of cryptographic keys and ciphertexts is lower bound by computationally difficult problems [25].”
- A Lightweight RFID Protocol to protect against Traceability and Cloning attacks (2005, background): “However, this type of attack does not work if hash function and the size of the key is selected carefully [16].”
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2019, background): “[61] A.”
- ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks (2003, background): “bit key length [17]) to resist a 1-day cryptanalysis with hardware cost ranging from $50,000,000 to $250,000,000.”
- A PUF taxonomy (2019, neutral): “26,27”
- Elliptic Curve Cryptography in Practice (2014, background): “More than 25 years after their introduction to cryptography, the practical benefits of using elliptic curves are well-understood: they offer smaller key sizes [34] and more efficient implementations [6] at the same security level as other widely deployed schemes such as RSA [44].”
- A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography (2004, background): “Meanwhile, recommendations for ECC’s parameters abound, among academics [62], among corporations [63], and within government [41], [47].”
- Chosen-Ciphertext Security from Identity-Based Encryption (2004, background): “) 80-bit security for the latter is obtained by setting q6 ≈ 21024 [44, 1] (specifically, our numbers throughout this discussion are taken from [1, Table 2]).”
- MiniSec: A Secure Sensor Network Communication Architecture (2007, methodology): “Furthermore, we use 80-bit symmetric keys, since Lenstra and Verheul recommended that such keys are considered to be secure until 2012, even against resourceful adversaries [ 13 ].”
- Securing vehicular ad hoc networks (2007, background): “A prominent candidate for playing this role is Elliptic Curve Cryptography (ECC) with keys of 224 bits (28 bytes) and signature sizes of 56 bytes, resulting in a security level roughly equivalent to RSA 2048 according to [25].”