PKCS #5: Password-Based Cryptography Specification Version 2.0
By B. Kaliski. Request for Comments, 2000
425 citations recorded by the source corpus.
This memo represents a republication of PKCS #5 v2.0 from RSA Laboratories' Public-Key Cryptography Standards (PKCS) series, and change control is retained within the PKCS process. The body of this document, except for the security considerations section, is taken directly from that specification.
Subfields: Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/3fc51983c4f9bb91d0a17fff969af50695d76bee
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Vision and Pattern Recognition
- Michael Backes
- Joseph Bonneau
- Cormac Herley
- P. V. Oorschot
- Stefan Lucks
- Jon Callas
- Jean-Pierre Hubaux
- Levente Buttyán
Citations in the corpus
- Guessing human-chosen secrets (2012, methodology): “Provos and Mazières implemented the second approach with bcrypt() in 1999 using a parameterised iteration count [239]; this approach has been widely adopted and was standardised as the PasswordBased Key Derivation Function (PBKDF2) in 2000 [163].”
- The Skein Hash Function Family (2009, methodology): “The most commonly used PBKDFs [45, 3] use repeated hash function computations.”
- The Quest to Replace Passwords: A Framework for Comparative Evaluation of Web Authentication Schemes (2012, background): “This work grew out of the Related Work section of Pico [8].”
- Stack Overflow Considered Harmful? The Impact of Copy&Paste on Android Application Security (2017, background): “• Snippets that contain up-to-date and strong algorithms for symmetric cryptography [12], [13], sufficiently large keys for RSA or elliptic curve cryptography [14], [15] or secure random number generation [3].”