Provable security of block ciphers against linear cryptanalysis: a mission impossible?
(2009) Designs, Codes and Cryptography — Vol. 50, n° 3, p. 325-338 (2009)
Files
pdfdocument.pdf
Open Access - Adobe PDF
- 195.93 KB
Details
- Authors
- Abstract
- In this paper, we are concerned with the security of block ciphers against linear cryptanalysis and discuss the distance between the so-called practical security approach and the actual theoretical security provided by a given cipher. For this purpose, we present a number of illustrative experiments performed against small (i.e. computationally tractable) ciphers. We compare the linear probability of the best linear characteristic and the actual best linear probability (averaged over all keys). We also test the key equivalence hypothesis. Our experiments illustrate both that provable security against linear cryptanalysis is not achieved by present design strategies and the relevance of the practical security approach. Finally, we discuss the (im)possibility to derive actual design criteria from the intuitions underlined in these experiments.
- Affiliations
Citations
Piret, G., & Standaert, F.-X. (2009). Provable security of block ciphers against linear cryptanalysis: a mission impossible? Designs, Codes and Cryptography, 50(3), 325-338. https://doi.org/10.1007/s10623-008-9234-2 (Original work published 2009)