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

NameLecture Notes in Computer Science
Volume6434
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

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

Fingerprint

Hash functions
Attack
Number theory
Discrete Logarithm
Hash Function
Security Proof
Password
Factoring
Prime number
Elliptic Curves
Galois field
Modulo
Generalise
Integer

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
Halunen, Kimmo ; Röning, Juha. / Preimage attacks against variants of very smooth hash. Advances in Information and Computer Security, IWSEC 2010. editor / I. Echizen ; N. Kunihiro ; R. Sasaki . Springer, 2010. pp. 251-266 (Lecture Notes in Computer Science, Vol. 6434 ).
@inproceedings{2d67a669819f4c2c9ab0b45c0bee283a,
title = "Preimage attacks against variants of very smooth hash",
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.",
author = "Kimmo Halunen and Juha R{\"o}ning",
year = "2010",
doi = "10.1007/978-3-642-16825-3_17",
language = "English",
isbn = "978-3-642-16824-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "251--266",
editor = "I. Echizen and N. Kunihiro and {Sasaki }, R.",
booktitle = "Advances in Information and Computer Security, IWSEC 2010",
address = "Germany",

}

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. Springer, Lecture Notes in Computer Science, vol. 6434 , pp. 251-266, 5th International Workshop on Security on Advances in Information and Computer Security, IWSEC 2010, Kobe, Japan, 22/11/10. https://doi.org/10.1007/978-3-642-16825-3_17

Preimage attacks against variants of very smooth hash. / Halunen, Kimmo; Röning, Juha.

Advances in Information and Computer Security, IWSEC 2010. ed. / I. Echizen; N. Kunihiro; R. Sasaki . Springer, 2010. p. 251-266 (Lecture Notes in Computer Science, Vol. 6434 ).

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

TY - GEN

T1 - Preimage attacks against variants of very smooth hash

AU - Halunen, Kimmo

AU - Röning, Juha

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=78650003896&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16825-3_17

DO - 10.1007/978-3-642-16825-3_17

M3 - Conference article in proceedings

SN - 978-3-642-16824-6

T3 - Lecture Notes in Computer Science

SP - 251

EP - 266

BT - Advances in Information and Computer Security, IWSEC 2010

A2 - Echizen, I.

A2 - Kunihiro, N.

A2 - Sasaki , R.

PB - Springer

ER -

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