Cryptology ePrint Archive: Report 2017/139

Revisiting AES Related-Key Differential Attacks with Constraint Programming

David Gérault and Pascal Lafourcade and Marine Minier and Christine Solnon

Abstract: The Advanced Encryption Standard (AES) is one of the most studied symmetric encryption schemes. During the last years, several attacks have been discovered in different adversary models. In this paper, we focus on related-key differential attacks, where the adversary may introduce differences in plaintext pairs and also in keys. We show that Constraint Programming (CP) can be used to model these attacks, and that it allows us to efficiently find all optimal related-key differential characteristics for AES-128, AES-192 and AES-256. In particular, we improve the best related-key differential for the whole AES-256 and give the best related-key differential on 10 rounds of AES-192, which is the differential trail with the longest path. Those results allow us to improve existing related-key distinguishers, basic related-key attacks and $q$-multicollisions on AES-256.

Category / Keywords: secret-key cryptography / AES, Constraint Programming, Related Key differential

Date: received 15 Feb 2017, last revised 2 Jul 2018

Contact author: marine minier at loria fr

Available format(s): PDF | BibTeX Citation

Version: 20180702:084523 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]