Preimage attacks against variants of very smooth hash

Kimmo Halunen, Juha Röning

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

Abstract

In this paper, we show that some new variants of the Very Smooth Hash (VSH) hash function are susceptible to similar types of preimage attacks as the original VSH. We also generalise the previous mathematical results, which have been used in the preimage attacks. VSH is a hash function based on the multiexponentiation of prime numbers modulo some large product of two primes. The security proof of VSH is based on some computational problems in number theory, which are related to the problem of factoring large integers. However, the preimage resistance of VSH has been studied and found somewhat lacking especially in password protection. There have been many different variants of VSH proposed by the original authors and others. Especially the discrete logarithm version of VSH has been proposed in order to make the hash values shorter. Further proposals have used the discrete logarithm in finite fields and elliptic curves to gain even more advantage to the hash length. Our results demonstrate that even for these new variants, the same ideas for preimage attacks can be applied as for the original VSH and they result in effective preimage attacks.

Original languageEnglish
Title of host publicationAdvances in Information and Computer Security, IWSEC 2010
EditorsI. Echizen, N. Kunihiro, R. Sasaki
PublisherSpringer
Pages251-266
Number of pages16
ISBN (Electronic)978-3-642-16825-3
ISBN (Print)978-3-642-16824-6
DOIs
Publication statusPublished - 2010
MoE publication typeNot Eligible
Event5th International Workshop on Security on Advances in Information and Computer Security, IWSEC 2010 - Kobe, Japan
Duration: 22 Nov 201024 Nov 2010

Publication series

SeriesLecture Notes in Computer Science
Volume6434
ISSN0302-9743

Conference

Conference5th International Workshop on Security on Advances in Information and Computer Security, IWSEC 2010
CountryJapan
CityKobe
Period22/11/1024/11/10

Fingerprint Dive into the research topics of 'Preimage attacks against variants of very smooth hash'. Together they form a unique fingerprint.

  • Cite this

    Halunen, K., & Röning, J. (2010). Preimage attacks against variants of very smooth hash. In I. Echizen, N. Kunihiro, & R. Sasaki (Eds.), Advances in Information and Computer Security, IWSEC 2010 (pp. 251-266). Springer. Lecture Notes in Computer Science, Vol.. 6434 https://doi.org/10.1007/978-3-642-16825-3_17