Difference between revisions of "VSH"
From The ECRYPT Hash Function Website
(→Spezification) |
|||
Line 45: | Line 45: | ||
=== Others === | === Others === | ||
+ | |||
+ | <bibtex> | ||
+ | @inproceedings{indocryptSaarinen06, | ||
+ | author = {Markku-Juhani Olavi Saarinen}, | ||
+ | title = {Security of VSH in the Real World}, | ||
+ | booktitle = {INDOCRYPT}, | ||
+ | year = {2006}, | ||
+ | pages = {95-103}, | ||
+ | url = {http://dx.doi.org/10.1007/11941378_8}, | ||
+ | editor = {Rana Barua and Tanja Lange}, | ||
+ | publisher = {Springer}, | ||
+ | series = {LNCS}, | ||
+ | volume = {4329}, | ||
+ | isbn = {3-540-49767-6}, | ||
+ | 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.}, | ||
+ | } | ||
+ | </bibtex> |
Revision as of 12:14, 11 March 2008
Contents
1 Specification
Scott Contini, Arjen Lenstra, Ron Steinfeld - VSH, an Efficient and Provable Collision Resistant Hash Function
- ,2005
- http://csrc.nist.gov/groups/ST/hash/documents/LENSTRA_vsh.pdf
BibtexAuthor : Scott Contini, Arjen Lenstra, Ron Steinfeld
Title : VSH, an Efficient and Provable Collision Resistant Hash Function
In : -
Address :
Date : 2005
2 Cryptanalysis
2.1 Best Known Results
2.2 Generic Attacks
2.3 Collision Attacks
2.4 Second Preimage Attacks
2.5 Preimage Attacks
2.6 Others
Markku-Juhani Olavi Saarinen - Security of VSH in the Real World