Narrow-Bicliques: Cryptanalysis of Full IDEA

Publication: Research - peer-reviewConference article – Annual report year: 2012

View graph of relations

We apply and extend the recently introduced biclique framework to IDEA and for the first time describe an approach to noticeably speed-up key-recovery for the full 8.5 round IDEA.We also show that the biclique approach to block cipher cryptanalysis not only obtains results on more rounds, but also improves time and data complexities over existing attacks. We consider the first 7.5 rounds of IDEA and demonstrate a variant of the approach that works with practical data complexity. The conceptual contribution is the narrow-bicliques technique: the recently introduced independent-biclique approach extended with ways to allow for a significantly reduced data complexity with everything else being equal. For this we use available degrees of freedom as known from hash cryptanalysis to narrow the relevant differential trails. Our cryptanalysis is of high computational complexity, and does not threaten the practical use of IDEA in any way, yet the techniques are practically verified to a large extent.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Publication date2012
Volume7237
Pages392-410
ISSN0302-9743
DOIs
StatePublished

Conference

ConferenceEUROCRYPT 2012
CountryUnited Kingdom
CityCambridge
Period15/04/1219/04/12
Internet addresshttp://www.cs.bris.ac.uk/eurocrypt2012/
CitationsWeb of Science® Times Cited: No match on DOI

Keywords

  • Block ciphers, Bicliques, Meet-in-the-middle, IDEA, Key recovery.
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 12216207