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 Securi
• 出 处: Science China(Information Sciences)
• 发表日期: 2016年04期
• 关键词: bipartite balanced backward faster subgraph vertex formally editor underlying in

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 model.The 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

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 model. The 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