Abstract
In this paper, we present a semi-free-start collision attack on the compression function for all Twister variants with negligible complexity. We show how this compression function attack can be extended to construct collisions for Twister-512 slightly faster than brute force search. Furthermore, we present a second-preimage and preimage attack for Twister-512 with complexity of about 2384 and 2456 compression function evaluations, respectively. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Mendel, F., Rechberger, C., & Schläffer, M. (2009). Cryptanalysis of twister. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5536 LNCS, pp. 342–353). https://doi.org/10.1007/978-3-642-01957-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
