The Lane hash function

Indesteege, Sebastiaan; Andreeva, Elena; De Cannière, Christophe; Dunkelman, Orr; Käsper, Emilia; Nikova, Svetla; Preneel, Bart; Tischhauser, Elmar

doi:10.4230/DagSemProc.09031.16

Document

The Lane hash function

Authors Sebastiaan Indesteege, Elena Andreeva, Christophe De Cannière, Orr Dunkelman, Emilia Käsper, Svetla Nikova, Bart Preneel, Elmar Tischhauser

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.16.pdf

Filesize: 174 kB
14 pages

Document Identifiers

DOI: 10.4230/DagSemProc.09031.16
URN: urn:nbn:de:0030-drops-19523

Subject Classification

Keywords

Lane
SHA-3 candidate
hash function

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Sebastiaan Indesteege, Elena Andreeva, Christophe De Cannière, Orr Dunkelman, Emilia Käsper, Svetla Nikova, Bart Preneel, and Elmar Tischhauser. The Lane hash function. In Symmetric Cryptography. Dagstuhl Seminar Proceedings, Volume 9031, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/DagSemProc.09031.16

Author Details

Sebastiaan Indesteege

Elena Andreeva

Christophe De Cannière

Orr Dunkelman

Emilia Käsper

Svetla Nikova

Bart Preneel

Elmar Tischhauser

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