In this paper we introduce new concepts that help read and understand low-weight differential trails in Keccak. We then propose efficient techniques to exhaustively generate all 3-round trails in its largest permutation below a given weight. This allows us to prove that any 6-round differential trail in Keccak-f[1600] has weight at least 74. In the worst-case diffusion scenario where the mixing layer acts as the identity, we refine the lower bound to 82 by systematically constructing trails using a specific representation of states. © 2012 Springer-Verlag.
CITATION STYLE
Daemen, J., & Van Assche, G. (2012). Differential propagation analysis of Keccak. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7549 LNCS, pp. 422–441). https://doi.org/10.1007/978-3-642-34047-5_24
Mendeley helps you to discover research relevant for your work.