Bicliques with Minimal Data and Time Complexity for AES

Andrey Bogdanov, Donghoon Chang, Mohona Ghosh, Somitra Kumar Sanadhya

Abstract: In this paper, we re-evaluate the security-bound of full round AES against biclique attack. Under some reasonable restrictions, we exhaustively analyze the most promising class of biclique cryptanalysis as applied to AES through a computer-assisted search and find optimal attacks towards lowest computational and data complexities: