Expected Coverage of Perfect Chains in the Hellman Time Memory Trade-Off
محل انتشار: مجله محاسبات و امنیت، دوره: 3، شماره: 3
سال انتشار: 1395
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 164
فایل این مقاله در 8 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JCSE-3-3_001
تاریخ نمایه سازی: 12 دی 1400
چکیده مقاله:
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.
کلیدواژه ها:
نویسندگان
Naser Gharavi
a Faculty of Communication and Information Technology, Imam Hossein University (IHU), Iran
Abdorasool Mirghadri
a Faculty of Communication and Information Technology, Imam Hossein University (IHU), Iran
Mohammad Abdollahi Azgomi
Iran University of Science and Technology (IUST), Iran
Sayyed Mousavi
Shahid Bahonar University of Kerman, Kerman, Iran