Interleaving Cryptanalytic Time-memory Trade-offs on Non-Uniform Distributions

Abstract : Cryptanalytic time-memory trade-offs (TMTO) are well-knowntools available in any security expert toolbox. They have been used tobreak ciphers such as A5/1, but their efficiency to crack passwords madethem even more popular in the security community. While symmetrickeys are generated randomly according to a uniform distribution, pass-words chosen by users are in practice far from being random, as con-firmed by recent leakage of databases. Unfortunately, the technique usedto build TMTOs is not appropriate to deal with non-uniform distribu-tions. In this paper, we introduce an efficient construction that consists inpartitioning the search set into subsets of close densities, and a strategyto explore the TMTOs associated to the subsets based on an interleavedtraversal. This approach results in a significant improvement comparedto currently used TMTOs. We experimented our approach on a classicalproblem, namely cracking 7-character NTLM Hash passwords using analphabet with 34 special characters, which resulted in a 16 × speedupover rainbow tables, which are considered as the most efficient variant oftime-memory trade-offs.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01199151
Contributor : Cédric Lauradoux <>
Submitted on : Tuesday, September 15, 2015 - 8:08:01 AM
Last modification on : Tuesday, October 8, 2019 - 3:51:30 PM

Identifiers

  • HAL Id : hal-01199151, version 1

Citation

Gildas Avoine, Xavier Carpent, Cédric Lauradoux. Interleaving Cryptanalytic Time-memory Trade-offs on Non-Uniform Distributions. European Symposium on Research in Computer Security - ESORICS 2015, Sep 2015, Vienna, Austria. ⟨hal-01199151⟩

Share

Metrics

Record views

525