Loading...
Please wait, while we are loading the content...
Similar Documents
Pleco and Plectron – Two Provably Secure Password Hashing Algorithms
| Content Provider | CiteSeerX |
|---|---|
| Author | Fan, Xinxin Gong, Guang Zhu, Bo |
| Abstract | Password-based authentication has been widely deployed in practice due to its simplicity and efficiency. Storing pass-words and deriving cryptographic keys from passwords in a secure manner are crucial for many security systems and services. However, choices of well-studied password hashing algorithms are extremely limited, as their security require-ments and design principles are different from common cryp-tographic algorithms. In this paper, we propose two practi-cal password hashing algorithms, Pleco and Plectron. They are built upon well-understood cryptographic algo-rithms, and combine advantages of symmetric and asymmet-ric primitives. By employing the Rabin cryptosystem, we prove that the one-wayness of Pleco is at least as strong as the hard problem of integer factorization. In addition, both password hashing algorithms are designed to be sequential memory-hard, in order to thwart large-scale password crack-ing by parallel hardware, such as GPUs, FPGAs, and ASICs. Moreover, total computation and memory consumptions of Pleco and Plectron are tunable through their cost pa-rameters. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Well-understood Cryptographic Algo-rithms Cost Pa-rameters Password-based Authentication Integer Factorization Security Require-ments Combine Advantage Cryptographic Key Sequential Memory-hard Parallel Hardware Large-scale Password Crack-ing Well-studied Password Hashing Algorithm Practi-cal Password Many Security System Common Cryp-tographic Algorithm Secure Manner Total Computation Password Hashing Algorithm Rabin Cryptosystem Provably Secure Password Hashing Algorithm Asymmet-ric Primitive |
| Content Type | Text |
