We present a deterministic algorithm to find nonlinear S-box approximations, and a new nonlinear cryptanalytic technique; the "filtered" nonlinear attack, which achieves the lowest data complexity of any known-plaintext attack on reduced-round Serpent so far. We demonstrate that the Wrong-Key Randomization Hypothesis is not entirely valid for attacks on reduced-round Serpent which rely on linear cryptanalysis or a variant thereof, and survey the effects of this on existing attacks (including existing nonlinear attacks) on 11 and 12-round Serpent. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
McLaughlin, J., & Clark, J. A. (2013). Filtered nonlinear cryptanalysis of reduced-round serpent, and the wrong-key randomization hypothesis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8308 LNCS, pp. 120–140). Springer Verlag. https://doi.org/10.1007/978-3-642-45239-0_8
Mendeley helps you to discover research relevant for your work.