Abstract
We present a second preimage attack on SHAMATA-512, which is a hash function of 512-bit output and one of the first round candidates of the SHA-3 competition. The attack controls several message blocks to fix some variables of internal state and uses a meet-in-the-middle approach to find second preimages. The time complexity is about 2452.7 computations of the step function and the memory complexity is about 2451.4 blocks of 128 bits. © 2009 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Ideguchi, K., & Watanabe, D. (2009). Second preimage attack on SHAMATA-512. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5922 LNCS, pp. 169–181). https://doi.org/10.1007/978-3-642-10628-6_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
