**Rotational Cryptanalysis of ARX Revisited**

*Dmitry Khovratovich and Ivica Nikolic and Josef Pieprzyk and Przemyslaw Sokolowski and Ron Steinfeld*

**Abstract: **Rotational cryptanalysis is a probabilistic attack applicable to word oriented designs that use (almost) rotation-invariant constants. It is believed that the success probability of rotational cryptanalysis against ciphers and functions based on modular additions, rotations and XORs, can be computed only by counting the number of additions. We show that this simple formula is incorrect due to the invalid Markov cipher assumption used for computing the probability. More precisely, we show that chained modular additions used in ARX ciphers do not form a Markov chain with regards to rotational analysis, thus the rotational probability cannot be computed as a simple product of rotational probabilities of individual modular additions. We provide a precise value of the probability of such chains and give a new algorithm for computing the rotational probability of ARX ciphers. We use the algorithm to correct the rotational attacks on BLAKE2 and to provide valid rotational attacks against the simplified version of Skein.

**Category / Keywords: **secret-key cryptography / rotational cryptanalysis, Markov cipher, Markov chain, Skein, BLAKE2

**Original Publication**** (with minor differences): **IACR-FSE-2015

**Date: **received 9 Feb 2015

**Contact author: **inikolic at ntu edu sg

**Available format(s): **PDF | BibTeX Citation

**Version: **20150223:214243 (All versions of this report)

**Short URL: **ia.cr/2015/095

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]