The new techniques include an analytical search for optimal input values in the rotational cryptanalysis, which allows to extend the outbound phase of the attack with a precomputation phase, an approach never used in any rebound-style attack before. Further we show how to combine multiple inside-out computations and neutral bits in the inbound phase of the rebound attack, and give well-defined rotational distinguishers as certificates of weaknesses for the compression functions and block ciphers.
Category / Keywords: secret-key cryptography / Skein, SHA-3, hash function, compression function, cipher, rotational cryptanalysis, rebound attack, distinguisher. Publication Info: Earlier version appears in Proceedings of Asiacrypt 2010 Date: received 20 Oct 2010 Contact author: christian rechberger at esat kuleuven be Available formats: PDF | BibTeX Citation Version: 20101025:150843 (All versions of this report) Discussion forum: Show discussion | Start new discussion