1
a Faculty of Communication and Information Technology, Imam Hossein University (IHU), Iran
2
Iran University of Science and Technology (IUST), Iran
3
Shahid Bahonar University of Kerman, Kerman, Iran
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.
Gharavi, N. Hossein , Mirghadri, A. , Abdollahi Azgomi, M. and Mousavi, S. Ahmad (2016). Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off. Journal of Computing and Security, 3(3), 155-162.
MLA
Gharavi, N. Hossein, , Mirghadri, A. , , Abdollahi Azgomi, M. , and Mousavi, S. Ahmad. "Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off", Journal of Computing and Security, 3, 3, 2016, 155-162.
HARVARD
Gharavi, N. Hossein, Mirghadri, A., Abdollahi Azgomi, M., Mousavi, S. Ahmad (2016). 'Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off', Journal of Computing and Security, 3(3), pp. 155-162.
CHICAGO
N. Hossein Gharavi , A. Mirghadri , M. Abdollahi Azgomi and S. Ahmad Mousavi, "Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off," Journal of Computing and Security, 3 3 (2016): 155-162,
VANCOUVER
Gharavi, N. Hossein, Mirghadri, A., Abdollahi Azgomi, M., Mousavi, S. Ahmad Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off. Journal of Computing and Security, 2016; 3(3): 155-162.
)