2026-09-30T22:37:41Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1952 2026-09-29T16:30:02Z ddc:004 open_access

The Lane hash function Indesteege, Sebastiaan Andreeva, Elena De Cannière, Christophe Dunkelman, Orr Käsper, Emilia Nikova, Svetla Preneel, Bart Tischhauser, Elmar Lane SHA-3 candidate 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Sebastiaan Indesteege and Elena Andreeva and Christophe De Cannière and Orr Dunkelman and Emilia Käsper and Svetla Nikova and Bart Preneel and Elmar Tischhauser 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9031, Symmetric Cryptography (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09031.16 urn:nbn:de:0030-drops-19523 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09031.16 eng https://creativecommons.org/licenses/by/4.0/legalcode