Cryptology ePrint Archive: Report 2013/328
Towards Finding Optimal Differential Characteristics for ARX: Application to Salsa20
Nicky Mouha and Bart Preneel
Abstract: An increasing number of cryptographic primitives are built using the ARX operations: addition modulo $2^n$, bit rotation and XOR. Because of their very fast performance in software, ARX ciphers are becoming increasingly common. However, there is currently no rigorous understanding of the security of ARX ciphers against one of the most common attacks in symmetric-key cryptography: differential cryptanalysis. In this paper, we introduce a tool to search for optimal differential characteristics for ARX ciphers. Our technique is very easy to use, as it only involves writing out simple equations for every addition, rotation and XOR operation in the cipher, and applying an off-the-shelf SAT solver. As is commonly done for ARX ciphers, our analysis assumes that the probability of a characteristic can be computed by multiplying the probabilities of each operation, and that the probability of the best characteristic is a good estimate for the probability of the corresponding differential. Using extensive experiments for
Salsa20, we find that these assumptions are not always valid. To overcome these issues, we propose a method to accurately estimate the probability of ARX differentials.
Category / Keywords: Differential cryptanalysis, ARX, Evaluation Tool, SAT solver, Salsa20
Date: received 29 May 2013, last revised 12 Nov 2013
Contact author: Nicky Mouha at esat kuleuven be
Available format(s): PDF | BibTeX Citation
Note: Updated affiliations.
Version: 20131113:001621 (All versions of this report)
Short URL: ia.cr/2013/328
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]