An efficient quantum collision search algorithm and implications on symmetric cryptography
From MaRDI portal
Recommendations
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Low-communication parallel quantum multi-target preimage search
- Breaking symmetric cryptosystems using quantum period finding
- Low-gate quantum golden collision finding
- Quantum multicollision-finding algorithm
Cited in
(46)- Quantum algorithms for the \(k\)-XOR problem
- Quantum reversible circuit of AES-128
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Exploiting preprocessing for quantum search to break parameters for \(\mathcal{MQ}\) cryptosystems
- Low-communication parallel quantum multi-target preimage search
- 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
- Quantum collision attacks on reduced SHA-256 and SHA-512
- The cost to break SIKE: a comparative hardware-based analysis with AES and SHA-3
- On forging SPHINCS\textsuperscript{+}-Haraka signatures on a fault-tolerant quantum computer
- Towards quantum large-scale password guessing on real-world distributions
- Efficient quantum algorithms related to autocorrelation spectrum
- Quantum attacks on some Feistel block ciphers
- Quantum attacks on sum of Even-Mansour pseudorandom functions
- 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
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
- Collision resistance of the OAM-based quantum hashing
- 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 attacks on hash constructions with low quantum random access memory
- On quantum secure compressing pseudorandom functions
- Improved quantum algorithms for the k-XOR problem
- CryptAttackTester: high-assurance attack analysis
- Guess-and-determine rebound: applications to key collisions on \textsf{AES}
- Constructing quantum implementations with the minimal T-depth or minimal width and their applications
- (Multi-key) quantum analysis of masked Even-Mansour with applications to offset public permutation and Elephant
- Mind the bad norms. Revisiting compressed oracle-based quantum indistinguishability proofs
- Reducing the number of qubits in solving LWE
- Quantum security of Trojan message attacks on Merkle-Damgård hash construction
- Quantum security of the Legendre PRF
- SoK: how (not) to design and implement post-quantum cryptography
- Low-gate quantum golden collision finding
- Improvements to quantum search techniques for block-ciphers, with applications to AES
This page was built for publication: An efficient quantum collision search algorithm and implications on symmetric cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703922)
