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
DOI:
URN: urn:nbn:de:0030-drops-19523
URL:

; ; ; ; ; ; ;

The Lane hash function

pdf-format:


Abstract

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

@InProceedings{indesteege_et_al:DagSemProc.09031.16,
  author =	{Indesteege, Sebastiaan and Andreeva, Elena and De Canni\`{e}re, Christophe and Dunkelman, Orr and K\"{a}sper, Emilia and Nikova, Svetla and Preneel, Bart and Tischhauser, Elmar},
  title =	{{The Lane hash function}},
  booktitle =	{Symmetric Cryptography},
  pages =	{1--14},
  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 =		{https://drops.dagstuhl.de/opus/volltexte/2009/1952},
  URN =		{urn:nbn:de:0030-drops-19523},
  doi =		{10.4230/DagSemProc.09031.16},
  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