IIIT-Delhi Institutional Repository

Biclique cryptanalysis of full round AES with reduced data complexity

Show simple item record

dc.contributor.author Chang, Donghoon
dc.contributor.author Ghosh, Mohona
dc.contributor.author Sanadhya, Somitra Kumar
dc.date.accessioned 2013-05-31T05:49:40Z
dc.date.available 2013-05-31T05:49:40Z
dc.date.issued 2013-05-31T05:49:40Z
dc.identifier.uri https://repository.iiitd.edu.in/jspui/handle/123456789/99
dc.description.abstract Biclique cryptanalysis was proposed by Bogdanov et al. in Asiacrypt 2011 as a new tool for cryptanalysis of block ciphers. A major hurdle in carrying out biclique cryptanalysis is that it has a very high query complexity (of the order of 288 for AES-128, 280 for AES-192 and 240 for AES-256). This naturally puts a big question mark over the practical feasibility of implementing biclique attack in real world. In this work, we re-evaluate the security of full round AES against biclique cryptanalysis. We describe an alternate biclique construction with signi cantly reduced query complexity (of the order of 224 for AES-128, 232 for AES-192 and 28 for AES-256) at the expense of a slightly increased computational cost. In our approach, we use independent biclique technique to launch a chosen ciphertext attack against AES. en_US
dc.language.iso en_US en_US
dc.relation.ispartofseries IIITD-TR-2013-001
dc.subject AES en_US
dc.subject Block ciphers en_US
dc.subject Cryptanalysis en_US
dc.subject Biclique en_US
dc.subject Meet-in-the middle en_US
dc.subject Key recovery en_US
dc.title Biclique cryptanalysis of full round AES with reduced data complexity en_US
dc.type Technical Report en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository

Advanced Search


My Account