An experiment on DES statistical cryptanalysis

Linear cryptanalysis and differential cryptanalysis are the most important methods of attack against block ciphers. Their efficiency have been demonstrated against several ciphers, including the Data Encryption Standard. We prove that both of them can be considered, improved and joined in a more general statistical framework. We also show that the very same results as those obtained in the case of DES can be found without any linear analysis and we slightly improve them into an attack with theoretical complexity 2<sup>42.9</sup> We can apply another statistical attack-the ?<sup>2</sup> cryptanalysis-on the same characteristics without a definite idea of what happens in the encryption process. It appears to be roughly as efficient as both differential and linear cryptanalysis. We propose a new heuristic method to find good characteristics. It has found an attack against DES absolutely equivalent to M. Matsui's (1994) one by following a distinct path.

Published in:
ACM Conference on Computer and Communications Security, 139-147
Presented at:
ACM Conference on Computer and Communications Security, New Delhi, India

 Record created 2007-01-18, last modified 2019-12-05

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)