Low-Gate Quantum Golden Collision Finding

• Published in: Selected Areas in Cryptography pp. 329 - 359
• Main Authors: Jaques, Samuel, Schrottenloher, André
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Golden collision search; Quantum cryptanalysis; Quantum walks; SIKE
• ISBN: 9783030816513; 3030816516
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-81652-0_13

The golden collision problem asks us to find a single, special collision among the outputs of a pseudorandom function. This generalizes meet-in-the-middle problems, and is thus applicable in many contexts, such as cryptanalysis of the NIST post-quantum candidate SIKE. The main quantum algorithms for this problem are memory-intensive, and the costs of quantum memory may be very high. The quantum circuit model implies a linear cost for random access, which annihilates the exponential advantage of the previous quantum collision-finding algorithms over Grover’s algorithm or classical van Oorschot-Wiener. Assuming that quantum memory is costly to access but free to maintain, we provide new quantum algorithms for the golden collision problem with high memory requirements but low gate costs. Under the assumption of a two-dimensional connectivity layout, we provide better quantum parallelization methods for generic and golden collision finding. This lowers the quantum security of the golden collision and meet-in-the-middle problems, including SIKE.