Biclique cryptanalysis using balanced complete bipartite subgraphs

作     者：Zheng GONG Shusheng LIU Yamin WEN Yiyuan LUO Weidong QIU 

作者机构：School of Computer Science South China Normal University State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences School of Mathematics and Statistics Guangdong University of Finance and Economics School of Electronics and Information Shanghai Dian Ji University School of Information Security Engineering Shanghai Jiao Tong University 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2016年第59卷第4期

页      面：208-210页

核心收录：

学科分类：11[军事学] 1105[军事学-军队指挥学] 0839[工学-网络空间安全] 08[工学] 110505[军事学-密码学] 110503[军事学-军事通信学] 

基　　金：supported by National Natural Science Foundation of China (Grant Nos. 61572028, 61300204, 61402280) Natural Science Foundation of Guangdong (Grant Nos. 2015A030313630, 2014A030313439, 2013B010406008) Distinguished Young Teachers of Guangdong (Grant No. Yq2013051) Project of Science and Technology of Guangzhou (Grant No. 2014J2200006) supported by the Ministry of Educations New Century Excellent Talents in University (Grant No. NCET-12-0358) Technology Innovation Research Program of the Shanghai Municipal Education Commission (Grant No. 12ZZ019) 

主　　题：BCBS Biclique cryptanalysis using balanced complete bipartite subgraphs MITM 

摘      要：Dear editor,At Asiacrypt 2011,Bogdanov et al.[1]formally defined the biclique cryptanalysis method and proposed the first key recovery attack on full-round AES faster than exhaustible search in single-key *** basic idea underlying the biclique cryptanalysis is to determine two independent(or interleaving)differential paths in the forward and the backward direction to construct a biclique for a