Title of article :
Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off
Author/Authors :
Hossein Gharavi, Nasser Faculty of Communication and Information Technology - Imam Hossein University (IHU) , Mirghadri, Abodorasoul Faculty of Communication and Information Technology - Imam Hossein University (IHU) , Abdollahi Azgomi, Mohammad Iran University of Science and Technology (IUST) , Mousavi, Ahmad Shahid Bahonar University of Kerman
Abstract :
Critical overlap situations in the classical Hellman’s cryptanalytic time memory trade-off method can be avoided, provided that during the precomputation phase, we generate perfect chains which are merge-free and loop-free chains. In this paper, we present asymptotic behavior of perfect chains in terms of time memory trade-off attacks. More precisely, we obtained expected values and variances for the coverage of perfect chains. We have also confirmed our theoretic outcomes with test results.
Keywords :
Time Memory Trade-Off , Perfect Chains , Random Mapping , Expected Value
Journal title :
Astroparticle Physics
