An efficient quantum collision search algorithm and implications on symmetric cryptography
From MaRDI portal
Publication:1703922
DOI10.1007/978-3-319-70697-9_8zbMath1380.81085OpenAlexW2768789137MaRDI QIDQ1703922
María Naya-Plasencia, André Schrottenloher, André Chailloux
Publication date: 8 March 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70697-9_8
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (28)
Quantum collision attacks on reduced SHA-256 and SHA-512 ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound ⋮ The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3 ⋮ Low-gate quantum golden collision finding ⋮ On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer ⋮ Quantum reversible circuit of AES-128 ⋮ Efficient quantum algorithms related to autocorrelation spectrum ⋮ Quantum attacks on some Feistel block ciphers ⋮ Improved attacks against reduced-round Whirlwind ⋮ Finding many collisions via reusable quantum walks. Application to lattice sieving ⋮ Triangulating rebound attack on AES-like hashing ⋮ 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 ⋮ Quantum time/memory/data tradeoff attacks ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Quantum search for scaled hash function preimages ⋮ Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms ⋮ Quantum collision attacks on AES-like hashing with low quantum random access memories ⋮ Quantum attacks on sum of Even-Mansour pseudorandom functions ⋮ Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2 ⋮ Quantum algorithms for learning Walsh spectra of multi-output Boolean functions ⋮ Some efficient quantum circuit implementations of Camellia ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions ⋮ On subset-resilient hash function families ⋮ Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
This page was built for publication: An efficient quantum collision search algorithm and implications on symmetric cryptography
