Abstract:Mixed Operation based Ciphers (MOC) attract cryptographers owing to their high security and high efficiency on both software and hardware platforms. As a basic principle of cryptosystem design, completeness refers to that every output bit contains the information of every input bit. This paper presents a universal algorithm of completeness analysis against MOC. Based on the algorithm, a method of constructing impossible differential distinguishers utilizing completeness is proposed. This method constructs heavy weight impossible differential distinguishers directly with high efficiency. The method can provide theory and technology direction for the construction of impossible differential distinguishers. Then, this paper analysis SIMON and SPECK with this method and introduces all the longest impossible differential distinguishers of SIMON currently public and new impossible differential distinguishers of SPECK.
李俊志, 关杰. 一种基于完全性的不可能差分区分器构造方法[J]. 电子与信息学报, 2018, 40(2): 430-437.
LI Junzhi, GUAN Jie . A Method of Constructing Impossible Differential Distinguishers Based on Completeness. JEIT, 2018, 40(2): 430-437.
FU Lishi and JIN Chenhui. Impossible differential cryptanalysis on 13-round MIBS-80[J]. Journal of Electronics & Information Technology, 2016, 38(4): 848-855. doi: 10.11999/JEIT150673.
TANG Xuehai, LI Chao, WANG Meiyi, et al. Impossible differential attack on 3D cipher[J]. Journal of Electronics & Information Technology, 2010, 32(10): 2516-2520. doi: 10.3724/SP.J.1146.2009.01375.
[4]
张凯. 基于混合运算密码模型的安全性研究[D]. [博士论文], 信息工程大学, 2016.
ZHANG Kai. Research on the security evaluation against mixed operation based cipher model[D]. [Ph.D. dissertation], Information Engineering University, 2016.
[5]
HONG D, SUNG J, HONG S, et al. HIGHT: A new block cipher suitable for low-resource device[C]. International Workshop on Cryptographic Hardware and Embedded Systems, Yokohama, 2006: 46-59. doi: 10.1007/11894063_4.
[6]
BEAULIEU R, TREATMAN-CLARK S, SHORS D, et al. The SIMON and SPECK lightweight block ciphers[C]. 2015 52nd ACM/EDAC/IEEE Design Automation Conference (DAC), Texas, 2015: 1-6. doi: 10.1145/2744769.2747946.
[7]
BIHAM E, BIRYUKOV A, and SHAMIR A. Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials [C]. International Conference on the Theory and Applications of Cryptographic Techniques, Prague, Czech, 1999: 12-23. doi: 10.1007/3-540-48910-X_2.
[8]
National Security Agency. Skipjack and KEA algorithm specifications, Version 2.0.[OL]. http: scrc.nist.gov/ Crypto Toolkit/skipjack/skipjack-kea.htm. 1998.
[9]
BIHAM E, DUNKELMAN O, and KELLER N. Related-key impossible differential attacks on 8-round AES-192[C]. Topics in Cryptology-CT-RSA 2006, The Cryptographers' Track at the RSA Conference 2006, San Jose, CA, USA, 2006: 21-33. doi: 10.1007/11605805_2.
[10]
CHEN J, WANG M, and PRENEEL B. Impossible differential cryptanalysis of the lightweight block ciphers TEA, XTEA and HIGHT[C]. International Conference on Cryptology in Africa. Ifrance, Morocco, 2012: 117-137. doi: 10.1007/978-3-642-31410-0_8.
[11]
SUN Siwei, HU Lei, WANG Peng, et al. Automatic security evaluation and (related-key) differential characteristic search: Application to SIMON, PRESENT, LBlock, DES(L) and other bit-oriented block ciphers[C]. International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, 2014: 158-178. doi: 10.1007 /978-3-662-45611-8_9.
[12]
CUI Ting, JIA Keting, FU Kai, et al. New automatic search tool for impossible differentials and zero-correlation linear approximations[OL]. http://eprint.iacr.org/2016/689.pdf. 2017.04.
LI Junzhi. Algebraic properties and applications on three non-linear feedback models[D]. [Master. dissertation], Information Engineering University, 2015.