Abstract
This work proposes a new cryptanalytic non-probabilistic trade-off
for unsalted hashes. It presents the main cryptanalytic trade-offs, making a
comparison with the proposed method. Although the number of hash operations
to recover an element is high compared with the traditional methods, the new
method has the advantage of guaranteed success on the recovery of hashes,
minimal and sequential disk read operations, unlike the existing probabilistic
trade-offs.
for unsalted hashes. It presents the main cryptanalytic trade-offs, making a
comparison with the proposed method. Although the number of hash operations
to recover an element is high compared with the traditional methods, the new
method has the advantage of guaranteed success on the recovery of hashes,
minimal and sequential disk read operations, unlike the existing probabilistic
trade-offs.
Original language | English |
---|---|
Title of host publication | XVI Simposio Brasileiro em Seguranca da Informacao e de Sistemas Computacionais |
Pages | 198 |
Number of pages | 211 |
Publication status | Published - 1 Nov 2016 |
Keywords
- Hash table
- Algorithms
- Security
- Rainbow Tables