← Back to papers
Estimating the Cost of Generic Quantum Pre-image Attacks on SHA-2 and SHA-3
M. Amy, O. D. Matteo, Vlad Gheorghiu, M. Mosca, A. Parent, John M. Schanck·March 30, 2016·DOI: 10.1007/978-3-319-69453-5_18
PhysicsComputer ScienceMathematics
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
We investigate the cost of Grover’s quantum search algorithm when used in the context of pre-image attacks on the SHA-2 and SHA-3 families of hash functions. Our cost model assumes that the attack is run on a surface code based fault-tolerant quantum computer. Our estimates rely on a time-area metric that costs the number of logical qubits times the depth of the circuit in units of surface code cycles. As a surface code cycle involves a significant classical processing stage, our cost estimates allow for crude, but direct, comparisons of classical and quantum algorithms.