作者: Biaoshuai Tao , Hongjun Wu
DOI: 10.1007/978-3-319-19962-7_3
关键词:
摘要: Biclique attack is currently the only key-recovery on full AES with a single key. Bogdanov et al. applied it to all three versions of by constructing bicliques size \(2^8\times 2^8\) and reducing number S-boxes computed in matching phase. Their results were improved later better selections differential characteristics biclique construction. In this paper, we improve increasing \(2^{16}\times 2^{16}\). We have each following versions: AES-128 time complexity \(2^{126.13}\) data \(2^{56}\), AES-128 \(2^{126.01}\) \(2^{72}\), AES-192 \(2^{189.91}\) \(2^{48}\), and AES-256 \(2^{254.27}\) \(2^{40}\).