You are looking at a specific version 20080227:044120 of this paper. See the latest version.

Paper 2008/076

Results from a Search for the Best Linear Approximation of a Block Cipher

Kashif Ali and Howard M. Heys

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
Published elsewhere. Unpublished except as Masters thesis of 1st author.
Keywords
block cipherslinear cryptanalysis
Contact author(s)
howard @ engr mun ca
History
2008-02-27: received
Short URL
https://ia.cr/2008/076
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.