Difference between revisions of "LASH-n"

From The ECRYPT Hash Function Website
(Collision Attacks)
(Best Known Results)
 
Line 23: Line 23:
  
 
=== Best Known Results ===
 
=== Best Known Results ===
 +
LASH-n is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2<sup>(4n/11)</sup> and preimage attacks as fast as 2<sup>(4n/7)</sup>.
  
 
----
 
----

Latest revision as of 11:34, 10 November 2008

1 Specification

  • digest size: 160,256,384,512 bits
  • max. message length: arbitrary length
  • compression function: 640,1024,1536,2048-bit message blocks and 640,1024,1536,2048-bit state size

Kamel Bentahar, Dan Page, Markku-Juhani O. Saarinen, Joseph H. Silverman, Nigel Smart - LASH

,2006
http://csrc.nist.gov/groups/ST/hash/documents/SAARINEN_lash4-1_ORIG.pdf
Bibtex
Author : Kamel Bentahar, Dan Page, Markku-Juhani O. Saarinen, Joseph H. Silverman, Nigel Smart
Title : LASH
In : -
Address :
Date : 2006

2 Cryptanalysis

2.1 Best Known Results

LASH-n is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4n/11) and preimage attacks as fast as 2(4n/7).


2.2 Generic Attacks


2.3 Collision Attacks

Ron Steinfeld, Scott Contini, Krystian Matusiewicz, Josef Pieprzyk, Jian Guo, San Ling, Huaxiong Wang - Cryptanalysis of LASH

FSE 5086:207-223,2008
http://dx.doi.org/10.1007/978-3-540-71039-4_13
Bibtex
Author : Ron Steinfeld, Scott Contini, Krystian Matusiewicz, Josef Pieprzyk, Jian Guo, San Ling, Huaxiong Wang
Title : Cryptanalysis of LASH
In : FSE -
Address :
Date : 2008

2.4 Second Preimage Attacks


2.5 Preimage Attacks


2.6 Others