Finding preimages of multiple passwords secured with VSH

Kimmo Halunen, Pauli Rikula, Juha Röning

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

1 Citation (Scopus)

Abstract

In this paper we present an improvement to the preimage attacks on Very Smooth Hash (VSH) function. VSH was proposed as a collision resistant hash function by Contini et al., but it has been found lacking in preimage resistance by Saarinen. With our method, we show how to find preimages of multiple passwords secured by VSH. We also demonstrate that our method is faster in finding preimages of multiple passwords than the methods proposed earlier. We tested the methods with five, ten and fifty randomised alphanumeric passwords. The results show that our method is many times faster than the original method of Saarinen and almost three times faster than the improved method proposed by Halunen et al. Furthermore, we argue that the methods presented previously and our method are essentially the only significantly different methods derivable from Saarinen's work.

Original languageEnglish
Title of host publicationInternational Conference on Availability, Reliability and Security, ARES 2009
PublisherInstitute of Electrical and Electronic Engineers IEEE
Pages499-503
Number of pages5
ISBN (Electronic)978-0-7695-3564-7
ISBN (Print)978-1-4244-3572-2
DOIs
Publication statusPublished - 12 Oct 2009
MoE publication typeNot Eligible
EventInternational Conference on Availability, Reliability and Security, ARES 2009 - Fukuoka, Japan
Duration: 16 Mar 200919 Mar 2009

Conference

ConferenceInternational Conference on Availability, Reliability and Security, ARES 2009
CountryJapan
CityFukuoka
Period16/03/0919/03/09

Fingerprint

Hash functions

Keywords

  • Hash function
  • preimage attack
  • VSH
  • password security

Cite this

Halunen, K., Rikula, P., & Röning, J. (2009). Finding preimages of multiple passwords secured with VSH. In International Conference on Availability, Reliability and Security, ARES 2009 (pp. 499-503). [5066516] Institute of Electrical and Electronic Engineers IEEE. https://doi.org/10.1109/ARES.2009.25
Halunen, Kimmo ; Rikula, Pauli ; Röning, Juha. / Finding preimages of multiple passwords secured with VSH. International Conference on Availability, Reliability and Security, ARES 2009. Institute of Electrical and Electronic Engineers IEEE, 2009. pp. 499-503
@inproceedings{4b86be9ad5a94f2484025f0637964159,
title = "Finding preimages of multiple passwords secured with VSH",
abstract = "In this paper we present an improvement to the preimage attacks on Very Smooth Hash (VSH) function. VSH was proposed as a collision resistant hash function by Contini et al., but it has been found lacking in preimage resistance by Saarinen. With our method, we show how to find preimages of multiple passwords secured by VSH. We also demonstrate that our method is faster in finding preimages of multiple passwords than the methods proposed earlier. We tested the methods with five, ten and fifty randomised alphanumeric passwords. The results show that our method is many times faster than the original method of Saarinen and almost three times faster than the improved method proposed by Halunen et al. Furthermore, we argue that the methods presented previously and our method are essentially the only significantly different methods derivable from Saarinen's work.",
keywords = "Hash function, preimage attack, VSH, password security",
author = "Kimmo Halunen and Pauli Rikula and Juha R{\"o}ning",
year = "2009",
month = "10",
day = "12",
doi = "10.1109/ARES.2009.25",
language = "English",
isbn = "978-1-4244-3572-2",
pages = "499--503",
booktitle = "International Conference on Availability, Reliability and Security, ARES 2009",
publisher = "Institute of Electrical and Electronic Engineers IEEE",
address = "United States",

}

Halunen, K, Rikula, P & Röning, J 2009, Finding preimages of multiple passwords secured with VSH. in International Conference on Availability, Reliability and Security, ARES 2009., 5066516, Institute of Electrical and Electronic Engineers IEEE, pp. 499-503, International Conference on Availability, Reliability and Security, ARES 2009, Fukuoka, Japan, 16/03/09. https://doi.org/10.1109/ARES.2009.25

Finding preimages of multiple passwords secured with VSH. / Halunen, Kimmo; Rikula, Pauli; Röning, Juha.

International Conference on Availability, Reliability and Security, ARES 2009. Institute of Electrical and Electronic Engineers IEEE, 2009. p. 499-503 5066516.

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

TY - GEN

T1 - Finding preimages of multiple passwords secured with VSH

AU - Halunen, Kimmo

AU - Rikula, Pauli

AU - Röning, Juha

PY - 2009/10/12

Y1 - 2009/10/12

N2 - In this paper we present an improvement to the preimage attacks on Very Smooth Hash (VSH) function. VSH was proposed as a collision resistant hash function by Contini et al., but it has been found lacking in preimage resistance by Saarinen. With our method, we show how to find preimages of multiple passwords secured by VSH. We also demonstrate that our method is faster in finding preimages of multiple passwords than the methods proposed earlier. We tested the methods with five, ten and fifty randomised alphanumeric passwords. The results show that our method is many times faster than the original method of Saarinen and almost three times faster than the improved method proposed by Halunen et al. Furthermore, we argue that the methods presented previously and our method are essentially the only significantly different methods derivable from Saarinen's work.

AB - In this paper we present an improvement to the preimage attacks on Very Smooth Hash (VSH) function. VSH was proposed as a collision resistant hash function by Contini et al., but it has been found lacking in preimage resistance by Saarinen. With our method, we show how to find preimages of multiple passwords secured by VSH. We also demonstrate that our method is faster in finding preimages of multiple passwords than the methods proposed earlier. We tested the methods with five, ten and fifty randomised alphanumeric passwords. The results show that our method is many times faster than the original method of Saarinen and almost three times faster than the improved method proposed by Halunen et al. Furthermore, we argue that the methods presented previously and our method are essentially the only significantly different methods derivable from Saarinen's work.

KW - Hash function

KW - preimage attack

KW - VSH

KW - password security

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

U2 - 10.1109/ARES.2009.25

DO - 10.1109/ARES.2009.25

M3 - Conference article in proceedings

SN - 978-1-4244-3572-2

SP - 499

EP - 503

BT - International Conference on Availability, Reliability and Security, ARES 2009

PB - Institute of Electrical and Electronic Engineers IEEE

ER -

Halunen K, Rikula P, Röning J. Finding preimages of multiple passwords secured with VSH. In International Conference on Availability, Reliability and Security, ARES 2009. Institute of Electrical and Electronic Engineers IEEE. 2009. p. 499-503. 5066516 https://doi.org/10.1109/ARES.2009.25