Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
From MaRDI portal
Publication:1698647
DOI10.1007/978-3-319-69453-5_18zbMath1418.94028arXiv1603.09383OpenAlexW2335111715MaRDI QIDQ1698647
Michele Mosca, Vlad Gheorghiu, Matthew Amy, Olivia Di Matteo, Alex Parent, John M. Schanck
Publication date: 16 February 2018
Full work available at URL: https://arxiv.org/abs/1603.09383
Related Items (22)
Low-gate quantum golden collision finding ⋮ On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer ⋮ Evaluation of quantum cryptanalysis on SPECK ⋮ Quantum algorithm to solve function inversion with time-space trade-off ⋮ Optimized quantum implementation of AES ⋮ Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting ⋮ Grover on \(SIMON\) ⋮ Nostradamus goes quantum ⋮ Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits ⋮ Exploring SAT for cryptanalysis: (quantum) collision attacks against 6-round SHA-3 ⋮ New constructions of collapsing hashes ⋮ Improved quantum analysis of SPECK and LowMC ⋮ Estimating quantum speedups for lattice sieves ⋮ Unnamed Item ⋮ Quantum algorithm design: techniques and applications ⋮ HILA5: on reliability, reconciliation, and error correction for Ring LWE encryption ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ A trade-off between classical and quantum circuit size for an attack against CSIDH ⋮ \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction ⋮ Grover on SM3 ⋮ Some efficient quantum circuit implementations of Camellia ⋮ New quantum circuit implementations of SM4 and SM3
Cites Work
- Unnamed Item
- Unnamed Item
- REVS: a tool for space-optimized reversible circuit synthesis
- Verified compilation of space-efficient reversible circuits
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Time/Space Trade-Offs for Reversible Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Logical Reversibility of Computation
- Selecting cryptographic key sizes
This page was built for publication: Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3