| تعداد نشریات | 43 |
| تعداد شمارهها | 1,808 |
| تعداد مقالات | 14,729 |
| تعداد مشاهده مقاله | 39,906,723 |
| تعداد دریافت فایل اصل مقاله | 15,484,142 |
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 | ||
|
آمار تعداد مشاهده مقاله: 1,090 تعداد دریافت فایل اصل مقاله: 401 |
||