Cryptology ePrint Archive: Report 2016/652

Automatic Search for a Maximum Probability Differential Characteristic in a Substitution-Permutation Network

Arnaud BANNIER and Nicolas BODIN and Eric FILIOL

Abstract: The algorithm presented in this paper computes a maximum probability differential characteristic in a Substitution-Permutation Network (or SPN). Such characteristics can be used to prove that a cipher is practically secure against differential cryptanalysis or on the contrary to build the most effective possible attack. Running in just a few second on 64 or 128-bit SPN, our algorithm is an important tool for both cryptanalists and designers of SPN.

Category / Keywords: secret-key cryptography / Block ciphers, Cryptanalysis

Original Publication (with minor differences): HICSS-48

Date: received 23 Jun 2016

Contact author: filiol at esiea fr

Available format(s): PDF | BibTeX Citation

Note: This paper is the revised version of that presented at HICSS-48

Version: 20160624:203303 (All versions of this report)

Short URL: ia.cr/2016/652