License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09031.18
URN: urn:nbn:de:0030-drops-19471
Go to the corresponding Portal

Dunkelman, Orr ; Biham, Eli

The SHAvite-3 - A New Hash Function

09031.DunkelmanOrr.Paper.1947.pdf (0.3 MB)


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).

BibTeX - Entry

  author =	{Dunkelman, Orr and Biham, Eli},
  title =	{{The SHAvite-3 - A New Hash Function}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--39},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9031},
  editor =	{Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-19471},
  doi =		{10.4230/DagSemProc.09031.18},
  annote =	{Keywords: SHAvite-3, SHA-3, hash function}

Keywords: SHAvite-3, SHA-3, hash function
Collection: 09031 - Symmetric Cryptography
Issue Date: 2009
Date of publication: 30.03.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI