The SHAvite-3 - A New Hash Function

Dunkelman, Orr; Biham, Eli

doi:10.4230/DagSemProc.09031.18

Document

The SHAvite-3 - A New Hash Function

Authors Orr Dunkelman, Eli Biham

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 9031
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2009-03-30

PDF

File

PDF

DagSemProc.09031.18.pdf

Filesize: 302 kB
39 pages

Document Identifiers

DOI: 10.4230/DagSemProc.09031.18
URN: urn:nbn:de:0030-drops-19471

Subject Classification

Keywords

SHAvite-3
SHA-3
hash function

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

In this work we present SHAvite-3, a secure and efficient hash 
function based on the HAIFA construction
and the AES building blocks. SHAvite-3 uses a well understood set of primitives
such as a Feistel block cipher which iterates a round function based on the
AES round. SHAvite-3's compression functions are secure against cryptanalysis,
while the selected mode of iteration offers maximal security against
black box attacks on the hash function. SHAvite-3 is both
fast and resource-efficient, making it suitable for a wide range of
environments, ranging from 8-bit platforms to 64-bit platforms (and beyond).

Cite As Get BibTex

Orr Dunkelman and Eli Biham. The SHAvite-3 - A New Hash Function. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 9031, pp. 1-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/DagSemProc.09031.18

Author Details

Orr Dunkelman

Eli Biham

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail