Parallel Collision Search with Application to Hash Functions and Discrete Logarithms

@inproceedings{Oorschot1994ParallelCS,
  title={Parallel Collision Search with Application to Hash Functions and Discrete Logarithms},
  author={Paul C. van Oorschot and Michael J. Wiener},
  booktitle={ACM Conference on Computer and Communications Security},
  year={1994}
}
Current techniques for collision search with feasible memory requirements involve pseudo-random walks through some space where one must wait for the result of the current step before the next step can begin. These techniques are serial in nature, and direct parallelization is inefficient. We present a simple new method of parallelizing collision searches that greatly extends the reach of practical attacks. The new method is illustrated with applications to hash functions and discrete logarithms… CONTINUE READING

Citations

Publications citing this paper.

FILTER CITATIONS BY YEAR

1994
2018

CITATION STATISTICS

  • 6 Highly Influenced Citations

  • Averaged 3 Citations per year over the last 3 years

Similar Papers

Loading similar papers…