Search
 
loader loading subjects...
cover
Coding Theory and Hash Function Design - A Case Study: The Lane Hash Function
Sebastiaan Indesteege, Bart Preneel
63 - 68
10.3233/978-1-60750-002-5-63
NATO Science for Peace and Security Series - D: Information and Communication Security
Volume 23: Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes
Abstract

We illustrate how coding theory was applied in the design of the cryptographic hash function LANE [8]. The generic structure of the LANE compression function could potentially be vulnerable to a class of meet-in-the-middle attacks. While difficult to avoid at first sight, restating the problem in the domain of error correcting codes naturally leads to a simple and elegant solution. This ensures that these attacks do not apply to LANE.

$35.00 / €27.50 / £22.00
Add PDF to cart