Paper 2008/076 Original: eprint.iacr.org/2008/076 ↗
Results from a Search for the Best Linear Approximation of a Block Cipher
Abstract
In this paper, we investigate the application of an algorithm to find the best linear approximation of a basic Substitution-Permutation Network block cipher. The results imply that, while it is well known that the S-box used for the Advanced Encryption Standard has good nonlinear properties, it is straightforward to randomly select other S-boxes which are able to provide a similar level of security, as indicated by the exact bias of the best linear approximation found by the algorithm, rather than a simple upper bound on the maximum bias.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2008-02-27: last updated
- 2008-02-27: published
- Short URL
- https://ia.cr/2008/076
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/076,
author = {Kashif Ali and Howard M. Heys},
title = {Results from a Search for the Best Linear Approximation of a Block Cipher},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/076},
year = {2008},
url = {https://eprint.iacr.org/2008/076}
}