Cryptanalysis of the 10-round hash and full compression function of SHAvite-3-512

N/ACitations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we analyze the SHAvite-3-512 hash function, as proposed and tweaked for round 2 of the SHA-3 competition. We present cryptanalytic results on 10 out of 14 rounds of the hash function SHAvite-3-512, and on the full 14 round compression function of SHAvite-3-512. We show a second preimage attack on the hash function reduced to 10 rounds with a complexity of 2497 compression function evaluations and 216 memory. For the full 14-round compression function, we give a chosen counter, chosen salt preimage attack with 2384 compression function evaluations and 2128 memory (or complexity 2448 without memory), and a collision attack with 2192 compression function evaluations and 2128 memory. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Gauravaram, P., Leurent, G., Mendel, F., Naya-Plasencia, M., Peyrin, T., Rechberger, C., & Schläffer, M. (2010). Cryptanalysis of the 10-round hash and full compression function of SHAvite-3-512. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6055 LNCS, pp. 419–436). https://doi.org/10.1007/978-3-642-12678-9_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free