Security of VSH in the real world

Authors:
Markku-Juhani O. Saarinen
Affiliations:
Information Security Group, Royal Holloway, University of London, Egham, Surrey, UK
Venue:
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Year:
2006

Citing 0
Cited 7

The State of Hash Functions and the NIST SHA-3 Competition

Information Security and Cryptology
Linearization attacks against syndrome based hashes

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
How to build a hash function from any collision-resistant function

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Whirlwind: a new cryptographic hash function

Designs, Codes and Cryptography
Preimage attacks against variants of very smooth hash

IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Interpreting hash function security proofs

ProvSec'10 Proceedings of the 4th international conference on Provable security
The first 30 years of cryptographic hash functions and the NIST SHA-3 competition

CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In Eurocrypt 2006, Contini, Lenstra, and Steinfeld proposed a new hash function primitive, VSH, very smooth hash. In this brief paper we offer commentary on the resistance of VSH against some standard cryptanalytic attacks, including preimage attacks and collision search for a truncated VSH. Although the authors of VSH claim only collision resistance, we show why one must be very careful when using VSH in cryptographic engineering, where additional security properties are often required.