Difference between revisions of "HAS-V"

Revision as of 15:10, 11 March 2008

Nan Kyoung Park, Joon Ho Hwang, Pil Joong Lee - HAS-V: A New Hash Function with Variable Output Length

Selected Areas in Cryptography 2012:202-216,2000

Author : Nan Kyoung Park, Joon Ho Hwang, Pil Joong Lee
Title : HAS-V: A New Hash Function with Variable Output Length
In : Selected Areas in Cryptography -
Address :
Date : 2000

Florian Mendel, Vincent Rijmen - Weaknesses in the HAS-V Compression Function

ICISC 4817:335-345,2007

Author : Florian Mendel, Vincent Rijmen
Title : Weaknesses in the HAS-V Compression Function
In : ICISC -
Address :
Date : 2007

@@ Line 48: / Line 48: @@
 === Others ===
+<bibtex>
+@inproceedings{iciscMendelR07a,
+  author    = {Florian Mendel and Vincent Rijmen},
+  title     = {Weaknesses in the HAS-V Compression Function},
+  booktitle = {ICISC},
+  year      = {2007},
+  pages     = {335-345},
+  url        = {http://dx.doi.org/10.1007/978-3-540-76788-6_27},
+  editor    = {Kil-Hyun Nam and Gwangsoo Rhee},
+  publisher = {Springer},
+  series    = {LNCS},
+  volume    = {4817},
+  isbn      = {978-3-540-76787-9},
+  abstract  = {HAS-V is a cryptographic hash function which processes 1024-bit message blocks and produces a hash value of variable length. The design of the hash function is based on design principles of the MD4 family. Recently, weaknesses have been shown in members of this family. Therefore, the analysis of the HAS-V hash function is of great interest. To the best of our knowledge this is the first article that investigates the security of the HAS-V hash function. In this article, we point out several structural weaknesses in HAS-V which lead to pseudo-collision attacks on HAS-V with tailored output. Furthermore, we show that (second) preimages can be found for HAS-V with a complexity of about 2^{162} hash computations.},
+}
+</bibtex>