A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Low-gate Quantum Golden Collision Finding
[article]
2020
IACR Cryptology ePrint Archive
The golden collision problem asks us to nd 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
dblp:journals/iacr/JaquesS20
fatcat:nkuetroefvfzlana4xvb2p7egm