A Proposal for a Non-Probabilistic Cryptanalytic Trade-off

Abstract

This work proposes a new non-probabilistic cryptanalytic trade-off method. It reviews the main cryptanalytic trade-offs and draws a parallel with the proposed method. Although the number of hash operations needed to recover an element is high compared to traditional methods, the new method guarantees successful recovery and requires a minimal number of sequential disk reads, unlike the main probabilistic trade-offs in use.