Security of VSH in the Real World

  • Markku-Juhani O. Saarinen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4329)


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.


Hash Function Random Oracle Compression Function Modular Reduction Cryptographic Hash Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellare, M., Canetti, R., Krawczyk, H.: HMAC: Keyed-Hashing for Message Authentication. IETF RFC 2104 (1997)Google Scholar
  2. 2.
    Contini, S., Lenstra, A.K., Steinfeld, R.: VSH, an efficient and provable collision resistant hash function. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 165–182. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Coppersmith, D.: Analysis of ISO/CCITT Document X.509 Annex D. IBM Research Division, Yorktown Heights, NY (June 11, 1989)Google Scholar
  4. 4.
    RSA Laboratories. RSA-1024 Factoring Challenge Number. Available from:
  5. 5.
    Shanks, D.: Class number, a theory of factorization and genera. In: Proc. Symp. Pure Math., pp. 415–550. AMS, Providence (1979)Google Scholar
  6. 6.
    van Oorschot, P., Wiener, M.: Parallel collision search with cryptanalytic applications. Journal of Cryptology 12, 1–28 (1999)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Markku-Juhani O. Saarinen
    • 1
  1. 1.Information Security Group, Royal HollowayUniversity of LondonEgham, SurreyUK

Personalised recommendations