Distinguishing and Key-recovery Attacks against Wheesht
Anne Canteaut, Gaëtan Leurent · HAL (Le Centre pour la Communication Scientifique Directe) · 2014
Wheesht is one of the candidates to the CAESAR competition. In this note we present several attacks on Wheesht, showing that it is far from the advertised security level of 256 bits. In particular we describe a distinguishing attack with $2^{70.3}$ known plaintext words for any number of rounds of Wheesht, and a key-recovery attack (recovering the encryption key) for versions of Wheesht with a single finalization round with very little data and time complexity $2^{192}$.