VSH, an Efficient and Provable Collision Resistant Hash Function

@inproceedings{Contini2005VSHAE,
  title={VSH, an Efficient and Provable Collision Resistant Hash Function},
  author={Scott Contini and Arjen K. Lenstra and Ron Steinfeld},
  booktitle={IACR Cryptology ePrint Archive},
  year={2005}
}
We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of very smooth numbers modulo an S-bit composite. By very smooth, we mean that the smoothness bound is some fixed polynomial function of S. We argue that finding collisions for VSH has the same asymptotic complexity as factoring using the Number Field Sieve factoring algorithm, i.e., subexponential in S. VSH is theoretically… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 81 CITATIONS, ESTIMATED 98% COVERAGE

Post-Quantum Cryptography

  • Lecture Notes in Computer Science
  • 2018
VIEW 5 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Design and analysis of cryptographic algorithms

VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Interpreting Hash Function Security Proofs

  • ProvSec
  • 2010
VIEW 14 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Finding Preimages of Multiple Passwords Secured with VSH

  • 2009 International Conference on Availability, Reliability and Security
  • 2009
VIEW 9 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Hash Functions from Sigma Protocols and Improvements to VSH

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

How Risky is the Random-Oracle Model?

  • IACR Cryptology ePrint Archive
  • 2008
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2005
2018

CITATION STATISTICS

  • 17 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 15 REFERENCES

A Design Principle for Hash Functions

  • CRYPTO
  • 1989
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Are 'Strong' Primes Needed for RSA

  • IACR Cryptology ePrint Archive
  • 2001
VIEW 1 EXCERPT

and C

R. Crandal
  • Pomerance. Prime numbers: a Computational Perspective, New York,
  • 2001

Jr

A. K. Lenstra, H. W. Lenstr
  • The Development of the Number Field Sieve, Berlin,
  • 1993