The SHAvite-3 Hash Function

Eli Biham, Orr Dunkelman

Research output: Contribution to journalConference articlepeer-review


In this document 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).

Original languageEnglish
JournalDagstuhl Seminar Proceedings
StatePublished - 2009
Externally publishedYes
EventSymmetric Cryptography 2009 - Wadern, Germany
Duration: 11 Jan 200916 Jan 2009

Bibliographical note

Publisher Copyright:
© 2009 Dagstuhl Seminar Proceedings. All rights reserved.

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Control and Systems Engineering


Dive into the research topics of 'The SHAvite-3 Hash Function'. Together they form a unique fingerprint.

Cite this