اخبار و اعلانات

 آمار

تعداد نشریات43
تعداد شماره‌ها1,677
تعداد مقالات13,681
تعداد مشاهده مقاله31,718,522
تعداد دریافت فایل اصل مقاله12,533,035
Gharavi, Naser, Mirghadri, Abdorasool, Abdollahi Azgomi, Mohammad, Mousavi, Sayyed. (1395). Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off. سامانه مدیریت نشریات علمی دانشگاه اصفهان, 3(3), 155-162.
Naser Hossein Gharavi; Abdorasool Mirghadri; Mohammad Abdollahi Azgomi; Sayyed Ahmad Mousavi. "Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off". سامانه مدیریت نشریات علمی دانشگاه اصفهان, 3, 3, 1395, 155-162.
Gharavi, Naser, Mirghadri, Abdorasool, Abdollahi Azgomi, Mohammad, Mousavi, Sayyed. (1395). 'Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off', سامانه مدیریت نشریات علمی دانشگاه اصفهان, 3(3), pp. 155-162.
Gharavi, Naser, Mirghadri, Abdorasool, Abdollahi Azgomi, Mohammad, Mousavi, Sayyed. Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off. سامانه مدیریت نشریات علمی دانشگاه اصفهان, 1395; 3(3): 155-162.

Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off

Journal of Computing and Security
مقاله 1، دوره 3، شماره 3، مهر 2016، صفحه 155-162    اصل مقاله (557.85 K)
نویسندگان
Naser Hossein Gharavi* 1؛ Abdorasool Mirghadri1؛ Mohammad Abdollahi Azgomi2؛ Sayyed Ahmad Mousavi3
1a Faculty of Communication and Information Technology, Imam Hossein University (IHU), Iran
2Iran University of Science and Technology (IUST), Iran
3Shahid Bahonar University of Kerman, Kerman, Iran
چکیده
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.
کلیدواژه‌ها
Time Memory Trade-Off؛ Perfect Chains؛ Random Mapping؛ Expected Value
آمار
تعداد مشاهده مقاله: 893
تعداد دریافت فایل اصل مقاله: 305


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب