VSH, an Efficient and Provable Collision Resistant Hash Function

VSH, an Efficient and Provable Collision Resistant Hash Function

Cached

Download Links

by Scott Contini , Arjen K. Lenstra , Ron Steinfeld

Citations:

BibTeX

@MISC{Contini_vsh,an,
    author = {Scott Contini and Arjen K. Lenstra and Ron Steinfeld},
    title = {VSH, an Efficient and Provable Collision Resistant Hash Function},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

(slides)

Citations

711	A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
231	A design principle for hash functions - Damgård - 1989
175	Introduction to analytic and probabilistic number theory. Translated from the 2nd French ed - Tenenbaum - 1995
138	One way hash functions and DES - Merkle
127	Signature schemes based on the strong RSA assumption - Cramer, Shoup
119	Prime Numbers - A Computational Perspective - Crandall, Pomerance - 2000
113	Designated verifier proofs and their applications - Jakobsson, Sako, et al. - 1996
112	Efficient generation of shared rsa keys - Boneh, Franklin
108	The development of the number field sieve - Lenstra, Lenstra - 1993
78	The XTR public key system - Lenstra, Verheul - 2000
69	D.: A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost - Bellare, Micciancio - 1997
49	T.: Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance - Rogaway, Shrimpton
37	A new public-key cryptosystem - Naccache, Stern - 1997
35	Improved Online/Offline Signature Schemes - Shamir, Tauman - 2001
27	Modifications to the number field sieve - Coppersmith - 1993
27	Factoring Integers and Computing Discrete Logarithms via Diophantine Approximations - Schnorr - 1991
22	Torus-based cryptography - Rubin, Silverberg
19	Collision-free hash functions and public key signature schemes - Damg˚ard - 1987
19	The composite discrete logarithm and secure authentication - Pointcheval - 2000
16	Efficient extension of standard Schnorr/RSA signatures into universal designated verifier signatures - Steinfeld, Wang, et al. - 2004
9	Factoring estimates for a 1024-bit RSA modulus - Lenstra, Tromer, et al. - 2003
2	Are ‘strong’ primes needed for RSA. Report 2001/007, Cryptology ePrint Archive - Rivest, Silverman - 2001
1	Crypto++ 5.2.1 Benchmarks. Available at http://www.eskimo.com/~weidai/benchmarks.html - Dai
1	Method # small primes S b # products Megabyte/second 1024 Basic VSH 152 1234 1 n/a 0.355 1024 1318 1 n/a 0.419 - unknown authors