Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Indesteege, Sebastiaan; Andreeva, Elena; De Cannière, Christophe; Dunkelman, Orr; Käsper, Emilia; Nikova, Svetla; Preneel, Bart; Tischhauser, Elmar License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-19523

; ; ; ; ; ; ;

The Lane hash function



We propose the cryptographic hash function Lane as a candidate for the SHA-3 competition organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation.

BibTeX - Entry

  author =	{Sebastiaan Indesteege and Elena Andreeva and Christophe De Canni{\`e}re and Orr Dunkelman and Emilia K{\"a}sper and Svetla Nikova and Bart Preneel and Elmar Tischhauser},
  title =	{The Lane hash function},
  booktitle =	{Symmetric Cryptography },
  year =	{2009},
  editor =	{Helena Handschuh and Stefan Lucks and Bart Preneel and Phillip Rogaway},
  number =	{09031},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Lane, SHA-3 candidate, hash function}

Keywords: Lane, SHA-3 candidate, hash function
Seminar: 09031 - Symmetric Cryptography
Issue date: 2009
Date of publication: 30.03.2009

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