Paper 2016/652 Original: eprint.iacr.org/2016/652 ↗
Automatic Search for a Maximum Probability Differential Characteristic in a Substitution-Permutation Network
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2016-06-24: last updated
- 2016-06-24: published
- Short URL
- https://ia.cr/2016/652
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2016/652,
author = {Arnaud BANNIER and Nicolas BODIN and Eric FILIOL},
title = {Automatic Search for a Maximum Probability Differential Characteristic in a Substitution-Permutation Network},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/652},
year = {2016},
url = {https://eprint.iacr.org/2016/652}
}