MIBS-80的13輪不可能差分分析

付立仕; 金晨輝

doi:10.11999/JEIT150673

MIBS-80的13輪不可能差分分析

doi: 10.11999/JEIT150673

付立仕¹,
金晨輝¹

基金項(xiàng)目:

國家自然科學(xué)基金(61272488, 61402523)

計(jì)量
- 文章訪問數(shù): 1557
- HTML全文瀏覽量: 139
- PDF下載量: 356
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2015-06-04
- 修回日期: 2015-11-25
- 刊出日期: 2016-04-19

Impossible Differential Cryptanalysis on 13-round MIBS-80

FU Lishi¹,
JIN Chenhui¹

Funds:

The National Natural Science Foundation of China (61272488, 61402523)

摘要

摘要: 該文首次對13輪MIBS-80算法進(jìn)行了不可能差分分析。首先基于MIBS-80中S盒的不可能差分篩選明文對，其次通過第1輪輪密鑰與第2輪輪密鑰、第1輪輪密鑰與第13輪輪密鑰之間的制約關(guān)系進(jìn)一步篩選明文對。該文的攻擊排除掉的明文對數(shù)量是已有的不可能差分攻擊排除掉的明文對數(shù)量的218.2倍，因而同時(shí)降低了攻擊的存儲(chǔ)復(fù)雜度和時(shí)間復(fù)雜度。此外，該文多次利用查表的方法求出攻擊中涉及的密鑰，進(jìn)一步降低了攻擊所需的時(shí)間復(fù)雜度和存儲(chǔ)復(fù)雜度。最后，該文利用獨(dú)立的80 bit輪密鑰來恢復(fù)主密鑰，確保得到正確密鑰。該文的攻擊需要260.1個(gè)選擇明文，269.5次13輪加密，存儲(chǔ)量為271.2個(gè)64 bit，該結(jié)果優(yōu)于已有的不可能差分攻擊。
- 輕量級分組密碼 /
- MIBS-80算法 /
- 不可能差分分析 /
- 密鑰制約關(guān)系
Abstract: This paper presents the 13-round impossible differential cryptanalysis on MIBS-80 for the first time. Firstly, this paper filters the plaintexts based on the impossible differentia of S-box in MIBS-80. Secondly, by taking advantage of the restrict relation between key in the first round and in the second round, the restrict relation between key in the first round and in the 13th round, the number of plaintexts is further reduced. To sum up,218.2times can be eliminated as big as the number of plaintexts eliminated in former impossible attacks, therefore both the time complexity and memory complexity are saved. Besides, by looking up various tables to get the needed key bits in the attack, the time complexity and memory complexity are thereafter reduced. Finally, 80 independent key bit are used to recover the main key, which ensures that only the right key is kept. The presented attack needs260.1 chosen plaintexts,269.5 13-round encryptions and271.2 64 bit blocks, which is the best result of impossible differential attack on MIBS so far.
- Lightweight block cipher /
- MIBS-80 algorithm /
- Impossible differential cryptanalysis /
- Restrict relation between keys

HTML全文

參考文獻(xiàn)(31)

IZADI M, SADEGHIYAN B, and SADEGHIAN S. MIBS: a new light-weight block cipher[C]. CANS 2009, Ishikawa, Japan, 2009: 334-348. doi: 10.1007/978-3-642-10433-6_22.

BAY A, NAKAHARA J, and VAUDENAY S. Cryptanalysis of reduced-round MIBS block cipher[C]. CANS 2010, Malaysia, 2010: 1-19. doi: 10.1007/978-3-642-17619-7_1.

杜承航, 陳佳哲. 輕量級分組密碼算法MIBS不可能差分分析[J]. 山東大學(xué)學(xué)報(bào)(理學(xué)版), 2012, 47(7): 55-58.

DU Chenghang and CHEN Jiazhe. Impossible differential cryptanalysis of reduced-round MIBS[J]. Journal of Shandong University (Natural Science), 2012, 47(7): 55-58

楊林, 王美琴. 約簡輪的MIBS算法的差分分析[J]. 山東大學(xué)學(xué)報(bào)(理學(xué)版), 2010, 45(4): 12-15.

YANG Lin and WANG Meiqin. Differential cryptanalysis of reduced-round MIBS[J]. Journal of Shandong University (Natural Science), 2010, 45(4): 12-15.

王高麗, 王少輝. 對MIBS算法的Integral攻擊[J]. 小型微型計(jì)算機(jī)系統(tǒng), 2012, 33(4): 773-777.

WANG Gaoli, and WANG Shaohui. Integral cryptanalysis of reduced-round MIBS block cipher[J]. Journal of Chinese Computer Systems, 2012, 33(4): 773-777.

BAY A, HUANG J, and VAUDENAY S. Improved linear cryptanalysis of reduced-round MIBS[C]. The 9th International Workshop on Security, ?Hirosaki, 2014: 204-220. doi: 10.1007/978-3-319-09843-2_16.

劉超, 廖福成, 衛(wèi)宏儒. 對MIBS算法的中間相遇攻擊[J]. 內(nèi)蒙古大學(xué)學(xué)報(bào)(自然科學(xué)版), 2013, 44(3): 308-315.

LIU Chao, LIAO Fucheng, and WEI Hongru. Meet-in- the-middle attacks on MIBS[J]. Journal of Inner Mongolia University (Natural Science), 2013, 44(3): 308-315.

栗許, 關(guān)杰. 對輕量級密碼算法MIBS的零相關(guān)線性分析[J]. 信息工程大學(xué)學(xué)報(bào), 2015, 16(1): 20-24.

LI Xu and GUAN Jie. Zero correlation linear cryptanalysis of lightweight block cipher MIBS[J]. Journal of Information Engineering University, 2015, 16(1): 20-24.

陳平, 廖福成, 衛(wèi)宏儒. 對輕量級密碼算法MIBS的相關(guān)密鑰不可能差分攻擊[J]. 通信學(xué)報(bào), 2014, 35(2): 190-193.

CHEN Ping, LIAO Fucheng, and Wei Hongru. Related-key impossible differential attack on a lightweight block cipher MIBS[J]. Journal on Communications, 2014, 35(2): 190-193.

KNUDSEN L. DEALA 128-bit block cipher[R]. Technical Report 151, Department of Informatics, University of Bergen, Bergen, Norway, 1998.

BIHAM E, BIRYUKOV A, and SHAMIR A. Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials[C]. Advances in CryptologEUROCRYPT'99, Prague, 1999: 2-23. doi: 10.1007/3-540-48910-X_2.

胡弘堅(jiān), 金晨輝, 李信然. 改進(jìn)的 7 輪 AES-128 的不可能差分攻擊[J]. 密碼學(xué)報(bào), 2015, 2(1): 92-100. doi: 10.13868/j. vcnki.jcr.000063.

HU Hongjian, JIN Chenhui, and LI Xinran. Improved impossible differential attack on 7-round AES-128[J]. Journal of Cryptologic Research, 2015, 2(1): 92-100. doi: 10.13868 /j.vcnki.jcr.000063.

LI Xinran, FU Fangwei, and GUANG Xi. Multiple impossible differential cryptanalysis on reduced FOX[J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015, E98-A(3): 906-911. doi: 10.1587/transfun.E98.A.906.

GUO Rui and JIN Chenhui. Impossible differential cryptanalysis on Lai-Massey scheme[J]. ETRI Journal, 2014, 36(6): 1032-1040. doi: 10.4218/etrij.14.0113.1335.

WU Wenling, ZHANG Wentao, and FENG Dengguo. Impossible differential cryptanalysis of reduced-round ARIA and Camellia[J]. Journal of Computer Science and Technology, 2007, 22(3): 449-456. doi: 10.1007/s11390-007- 9056-0.

WU Wenling, ZHANG Lei, and ZHANG Wentao. Improved impossible differential cryptanalysis of reduced-round Camellia[C]. Selected Areas in Cryptography16th Annual International Workshop, SAC 2009, Calgary, Canada, 2009: 442-456. doi: 10.1007/978-3-642-04159-4_29.

MALA H, DAKHILALIAN M, RIJMEN V, et al. Improved impossible differential cryptanalysis of 7-round AES-128[C]. The 11th International Conference on Cryptology, Hyderabad, India, 2010: 282-291. doi: 10.1007/978-3-642- 17401-8_20.

LIU Ya, GU Dawu, and LIU Zhiqiang. Improved results on impossible differential cryptanalysis of reduced-round Camellia-192/256[J]. Journal of Systems and Software, 2012, 85(11): 2451-2458. doi: 10.1016/j.jss.2012.05.051.

BAI Dongxia and LI Leibo. New impossible differential attacks on Camellia[C]. International Conference on Information Security Practice and Experience 2012, Hangzhou, 2012: 80-96. doi: 10.1007/978-3-642-29101-2_6.

張慶貴. 不可能差分攻擊中的明文對篩選方法[J]. 計(jì)算機(jī)工程, 2010, 36(2): 127-129.

ZHANG Qinggui. Plaintext pair sieve methods in impossible differential attack[J]. Computer Engineering, 2010, 36(2): 127-129.

BOURA C, NAYA PLASENCIA M, and SUDER V. Scrutinizing and improving impossible differential attacks: applications to CLEFIA, Camellia, LBlock and Simon (Full Version)[C]. Advances in Cryptology20th Annual International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, 2014: 179-199. doi: 10.1007/978-3-662-45611-8_10.

謝作敏, 陳少真, 魯林真. 11輪3D密碼的不可能差分攻擊[J]. 電子與信息學(xué)報(bào), 2014, 36(5): 1215-1220. doi: 10.3724/SP.J. 1146.2013.00948.

XIE Zuomin, CHEN Shaozhen, and LU Linzhen. Impossible differential cryptanalysis of 11-round 3D cipher[J]. Journal of Electronics Information Technology, 2014, 36(5): 1215-1220. doi: 10.3724/SP.J.1146.2013.00948.

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問統(tǒng)計(jì)