A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Improved Top-Down Techniques in Differential Cryptanalysis
[chapter]
2015
Lecture Notes in Computer Science
The fundamental problem of differential cryptanalysis is to find the highest entries in the Difference Distribution Table ( DDT ) of a given mapping F over n-bit values, and in particular to find the highest diagonal entries which correspond to the best iterative characteristics of F . The standard bottom-up approach to this problem is to consider all the internal components of the mapping along some differential characteristic, and to multiply their transition probabilities. However, this can
doi:10.1007/978-3-319-22174-8_8
fatcat:7vrlssyjr5bsrllghs2ebmggky