Parallel Collision Search with Cryptanalytic Applications

  title={Parallel Collision Search with Cryptanalytic Applications},
  author={P. V. Oorschot and Michael J. Wiener},
  journal={Journal of Cryptology},
  • P. V. Oorschot, Michael J. Wiener
  • Published 2013
  • Computer Science, Mathematics
  • Journal of Cryptology
  • Abstract. A simple new technique of parallelizing methods for solving search problems which seek collisions in pseudorandom walks is presented. This technique can be adapted to a wide range of cryptanalytic problems which can be reduced to finding collisions. General constructions are given showing how to adapt the technique to finding discrete logarithms in cyclic groups, finding meaningful collisions in hash functions, and performing meet-in-the-middle attacks such as a known-plaintext attack… CONTINUE READING
    317 Citations
    Genetic programming for improved cryptanalysis of elliptic curve cryptosystems
    • 3
    Design and Analysis of Multi-Block-Length Hash Functions
    • 5
    • PDF
    Elliptic Curve Cryptography using Computational Intelligence
    Cryptanalysis of Hash Functions
    • 6
    • PDF
    Elliptic and Hyperelliptic Curves: A Practical Security Analysis
    • 12
    • PDF


    Efficient DES Key Search
    • 100
    • Highly Influential
    Is the Data Encryption Standard a group? (Results of cycling experiments on DES)
    • 40
    • PDF
    A cryptanalytic time-memory trade-off
    • M. Hellman
    • Computer Science
    • IEEE Trans. Inf. Theory
    • 1980
    • 641
    • PDF
    RIPEMD-160: A Strengthened Version of RIPEMD
    • 495
    • Highly Influential
    • PDF
    Cryptanalysis of MD4
    • 175
    • PDF
    An Implementation of Elliptic Curve Cryptosystems Over F2155
    • 251
    • Highly Influential
    Efficient signature generation by smart cards
    • C. Schnorr
    • Mathematics, Computer Science
    • Journal of Cryptology
    • 2004
    • 2,130
    • PDF
    Cryptography and Data Security
    • 1,900