Weaknesses in the HAS-V compression function

Authors:
Florian Mendel;Vincent Rijmen
Affiliations:
Institute for Applied Information Processing and Communications, Graz University of Technology, Graz, Austria;Institute for Applied Information Processing and Communications, Graz University of Technology, Graz, Austria
Venue:
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Year:
2007

Citing 8
Cited 12

On the security of multiple encryption

Communications of the ACM
Finding SHA-1 characteristics: general results and applications

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Cryptanalysis of the full HAVAL with 4 and 5 passes

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
A study of the MD5 attacks: insights and improvements

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Cryptanalysis of the hash functions MD4 and RIPEMD

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
How to break MD5 and other hash functions

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Collision search attack for 53-step HAS-160

ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology

MD4 is Not One-Way

Fast Software Encryption
Preimages for Reduced SHA-0 and SHA-1

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
A Preimage Attack for 52-Step HAS-160

Information Security and Cryptology --- ICISC 2008
Preimage Attack on Hash Function RIPEMD

ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Cryptanalysis of MDC-2

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Two Passes of Tiger Are Not One-Way

AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL

ISC '09 Proceedings of the 12th International Conference on Information Security
Finding Collisions for a 45-Step Simplified HAS-V

Information Security Applications
Improved preimage attack for 68-step HAS-160

ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Preimage attacks against PKC98-Hash and HAS-V

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Cryptanalysis of the 10-round hash and full compression function of SHAvite-3-512

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa

Quantified Score

Hi-index	0.00

Visualization

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 2162 hash computations.