Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512

Praveen Gauravaram, Gaëtan Leurent, Florian Mendel, Maria Naya Plasencia, Thomas Peyrin, Christian Rechberger, Martin Schläffer

    Research output: Contribution to journalConference articleResearchpeer-review

    212 Downloads (Pure)

    Abstract

    In this paper, we analyze SHAvite-3-512 hash function, as proposed 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 $2^{497}$ compression function evaluations and $2^{16}$ memory. For the full 14-round compression function, we give a chosen counter, chosen salt preimage attack with $2^{384}$ compression function evaluations and $2^{128}$ memory (or complexity $2^{448}$ without memory), and a collision attack with $2^{192}$ compression function evaluations and $2^{128}$ memory.
    Original languageEnglish
    Book seriesLecture Notes in Computer Science
    Volume6055
    Pages (from-to)419-436
    ISSN0302-9743
    Publication statusPublished - 2010
    EventThird International Conference on Cryptology in Africa - Stellenbosch, South Africa
    Duration: 3 May 20106 May 2010
    Conference number: 3

    Conference

    ConferenceThird International Conference on Cryptology in Africa
    Number3
    CountrySouth Africa
    CityStellenbosch
    Period03/05/201006/05/2010

    Keywords

    • SHAvite-3-512
    • cryptanalysis
    • (second) preimage
    • collision

    Fingerprint Dive into the research topics of 'Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512'. Together they form a unique fingerprint.

    Cite this