HAS-V

From The ECRYPT Hash Function Website

Jump to: navigation, search

Contents

1 Specification

  • digest size: 128 - 320 bits
  • max. message length: < 264 bits
  • compression function: 1024-bit message block, 320-bit chaining variable
  • Specification:

Nan Kyoung Park, Joon Ho Hwang, Pil Joong Lee - HAS-V: A New Hash Function with Variable Output Length
In Proceedings of Selected Areas in Cryptography, LNCS 2012, pp. 202-216, Springer, 2000
[Electronic Edition] [Bibtex]
Author : Nan Kyoung Park, Joon Ho Hwang, Pil Joong Lee
Title : HAS-V: A New Hash Function with Variable Output Length
In : In Proceedings of Selected Areas in Cryptography -
[Abstract]

2 Cryptanalysis

2.1 Best Known Results

Mendel and Rijmen show weaknesses in the compression function of HAS-V. They present pseudo-collisions for HAS-V for all output sizes. Furthermore, they show a preimage and second preimage attack on HAS-V (with output size >160) with complexity of about 2162 compression function evaluations.


2.2 Generic Attacks


2.3 Collision Attacks


2.4 Second Preimage Attacks


2.5 Preimage Attacks


2.6 Others

Florian Mendel, Vincent Rijmen - Weaknesses in the HAS-V Compression Function
In Proceedings of ICISC, LNCS 4817, pp. 335-345, Springer, 2007
[Electronic Edition] [Bibtex]
Author : Florian Mendel, Vincent Rijmen
Title : Weaknesses in the HAS-V Compression Function
In : In Proceedings of ICISC -
[Abstract]
Personal tools