The Lane hash function Extended Abstract

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

The Lane hash function Extended Abstract

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

Research output: Contribution to journal › Conference article › peer-review

Abstract

In this document, we propose the cryptographic hash function Lane as a candidate for the SHA-3 competition [11] organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher [3, 9] are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation. We give the specification of Lane, and the rationale behind the important design choices. For a more extended specification, security analysis and a discussion of the implementation aspects, we refer to the Lane submission document [6].

Original language	English
Journal	Dagstuhl Seminar Proceedings
Volume	9031
State	Published - 2009
Externally published	Yes
Event	Symmetric Cryptography 2009 - Wadern, Germany Duration: 11 Jan 2009 → 16 Jan 2009

Bibliographical note

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

Keywords

Lane
SHA-3 candidate
hash function

ASJC Scopus subject areas

Software
Hardware and Architecture
Control and Systems Engineering

Cite this

@article{03554c6c9edd41f9a188e5d8f44766ed,

title = "The Lane hash function Extended Abstract",

abstract = "In this document, we propose the cryptographic hash function Lane as a candidate for the SHA-3 competition [11] organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher [3, 9] are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation. We give the specification of Lane, and the rationale behind the important design choices. For a more extended specification, security analysis and a discussion of the implementation aspects, we refer to the Lane submission document [6].",

keywords = "Lane, SHA-3 candidate, hash function",

author = "Sebastiaan Indesteege and Elena Andreeva and {De Canni{\`e}re}, Christophe and Orr Dunkelman and Emilia K{\"a}sper and Svetla Nikova and Bart Preneel and Elmar Tischhauser",

year = "2009",

language = "English",

volume = "9031",

journal = "Dagstuhl Seminar Proceedings",

issn = "1862-4405",

}

TY - JOUR

T1 - The Lane hash function Extended Abstract

AU - Indesteege, Sebastiaan

AU - Andreeva, Elena

AU - De Cannière, Christophe

AU - Dunkelman, Orr

AU - Käsper, Emilia

AU - Nikova, Svetla

AU - Preneel, Bart

AU - Tischhauser, Elmar

PY - 2009

Y1 - 2009

N2 - In this document, we propose the cryptographic hash function Lane as a candidate for the SHA-3 competition [11] organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher [3, 9] are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation. We give the specification of Lane, and the rationale behind the important design choices. For a more extended specification, security analysis and a discussion of the implementation aspects, we refer to the Lane submission document [6].

AB - In this document, we propose the cryptographic hash function Lane as a candidate for the SHA-3 competition [11] organised by NIST. Lane is an iterated hash function supporting multiple digest sizes. Components of the AES block cipher [3, 9] are reused as building blocks. Lane aims to be secure, easy to understand, elegant and flexible in implementation. We give the specification of Lane, and the rationale behind the important design choices. For a more extended specification, security analysis and a discussion of the implementation aspects, we refer to the Lane submission document [6].

KW - Lane

KW - SHA-3 candidate

KW - hash function

UR - http://www.scopus.com/inward/record.url?scp=85175233236&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:85175233236

SN - 1862-4405

VL - 9031

JO - Dagstuhl Seminar Proceedings

JF - Dagstuhl Seminar Proceedings

T2 - Symmetric Cryptography 2009

Y2 - 11 January 2009 through 16 January 2009

ER -

The Lane hash function Extended Abstract

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this