Password-based key derivation functions (KDFs) are used to generate secure keys of arbitrary length implemented in many security-related systems. The strength of these KDFs is the ability to provide countermeasures against brute-force/dictionary attacks. One of the most implemented KDFs is PBKDF2. In order to slow attackers down, PBKDF2 uses a salt and introduces computational intensive operations based on an iterated pseudorandom function. Since passwords are widely used to protect personal data and to authenticate users to access specific resources, if an application uses a small iteration count value, the strength of PBKDF2 against attacks performed on low-cost commodity hardware may be reduced. In this paper we introduce the cryptographic algorithms involved in the key derivation process, describing the optimization techniques used to speed up PBKDF2-HMAC-SHA1 in a GPU/CPU context. Finally, a testing activity has been executed on consumer-grade hardware, and experimental results are reported.
Understanding Optimizations and Measuring Performances of PBKDF2 / A.F. Iuorio, A. Visconti (LECTURE NOTES ON DATA ENGINEERING AND COMMUNICATIONS TECHNOLOGIES). - In: 2nd International Conference on Wireless Intelligent and Distributed Environment for Communication / [a cura di] I. Woungang, S.K. Dhurandher. - [s.l] : Springer, 2019. - ISBN 9783030114367. - pp. 101-114 (( Intervento presentato al 2. convegno International Conference on Wireless Intelligent and Distributed Environment for Communication tenutosi a Toronto nel 2018.
|Titolo:||Understanding Optimizations and Measuring Performances of PBKDF2|
|Parole Chiave:||passwords; PBKDF2; HMAC-SHA1; optimizations; CPU-intensive operations; performance testing|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2019|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-030-11437-4_8|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|