Biclique cryptanalysis using balanced complete bipartite subgraphs

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 i...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2016-04, Vol.59 (4), p.204-206, Article 049101
Main Authors: Gong, Zheng, Liu, Shusheng, Wen, Yamin, Luo, Yiyuan, Qiu, Weidong
Format: Article
Language:English
Subjects:
AES
Computer Science
Cryptography
Graph theory
Information Systems and Communication Service
Letter
单核
子图
密码分析
密钥恢复
平衡
微分
搜索速度
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-016-5540-x