Performance of Password Guessing Enumerators Under Cracking Conditions - ICT Systems Security and Privacy Protection Access content directly
Conference Papers Year : 2019

Performance of Password Guessing Enumerators Under Cracking Conditions

Abstract

In this work, we aim to measure the impact of hash functions on the password cracking process. This brings us to measure the performance of password enumerators, how many passwords they find in a given period of time. We propose a performance measurement methodology for enumerators, which integrates the success rate and the speed of the whole password cracking process. This performance measurement required us to develop advanced techniques to solve measurement challenges that were not mentioned before. The experiments we conduct show that software-optimized enumerators like John The Ripper-Markov and the bruteforce perform well when attacking fast hash functions like SHA-1. Whereas enumerators like OMEN and PCFG-based algorithm perform the best when attacking slow hash functions like bcrypt or Ar-gon2. Using this approach, we realize a more in-depth measurement of the enumerators performance, considering quantitatively the trade-off between the enumerator choice and the speed of the hash function. We conclude that software-optimized enumerators and tools must implement academic methods in the future.
Fichier principal
Vignette du fichier
ifipsec.pdf (289.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02060091 , version 1 (18-03-2019)

Licence

Attribution

Identifiers

Cite

Mathieu Valois, Patrick Lacharme, Jean-Marie Le Bars. Performance of Password Guessing Enumerators Under Cracking Conditions. ICT Systems Security and Privacy Protection - IFIP SEC, Gurpreet Dhillon, Jun 2019, Lisbonne, Portugal. pp.67-80, ⟨10.1007/978-3-030-22312-0_5⟩. ⟨hal-02060091⟩
127 View
802 Download

Altmetric

Share

Gmail Facebook X LinkedIn More