کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4950916 | 1441044 | 2017 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Ciphertext-only attack on d Ã d Hill in O(d13d)
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Hill is a classical cipher which is generally believed to be resistant against ciphertext-only attack. In this paper, by using a divide-and-conquer technique, it is first shown that Hill with dÃd key matrix over Z26 can be broken with computational complexity of O(d26d), for the English language. This is much less than the only publicly known attack, i.e., the brute-force with complexity of O(d326d2). Then by using the Chinese Remainder Theorem, it is shown that the computational complexity of the proposed attack can be reduced down to O(d13d). Using an information-theoretic approach, it is shown that the minimum ciphertext length required for a successful attack increases by a factor of about 7 and 9.8, respectively for these two attacks in comparison with the brute-force attack. This is the only serious attack on Hill since its invention in 1929.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Processing Letters - Volume 118, February 2017, Pages 25-29
Journal: Information Processing Letters - Volume 118, February 2017, Pages 25-29
نویسندگان
Shahram Khazaei, Siavash Ahmadi,