Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
arXiv:1603.09383
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. We exhibit a circuit for a pre-image attack on SHA-256 that is approximately surface code cycles deep and requires approximately logical qubits. This yields an overall cost of logical-qubit-cycles. Likewise we exhibit a SHA3-256 circuit that is approximately surface code cycles deep and requires approximately logical qubits for a total cost of, again, logical-qubit-cycles. Both attacks require on the order of queries in a quantum black-box model, hence our results suggest that executing these attacks may be as much as billion times more expensive than one would expect from the simple query analysis.
arXiv commentSame as the published version to appear in the Selected Areas of Cryptography (SAC) 2016. Comments are welcome!
References in corpus (11)
- Quantum Mechanics helps in searching for a needle in a haystack
- Surface codes: Towards practical large-scale quantum computation
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Amplitude Amplification and Estimation
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Quantum circuits of T-depth one
- Surface code implementation of block code state distillation
- Verified compilation of space-efficient reversible circuits
- Reversible circuit compilation with space constraints
- Applying Grover's algorithm to AES: quantum resource estimates