Quantum multicollision-finding algorithm
From MaRDI portal
Recommendations
Cited in
(21)- Quantum algorithms for the \(k\)-XOR problem
- Quantum collision-finding in non-uniform random functions
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Quantum algorithm for the multicollision problem
- Quantum algorithm to find invariant linear structure of MD hash functions
- On subset-resilient hash function families
- Optimal merging in quantum k-xor and k-sum algorithms
- Quantum attacks on some Feistel block ciphers
- On finding quantum multi-collisions
- Improved quantum multicollision-finding algorithm
- Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms
- Quantum collision-resistance of non-uniformly distributed functions
- Quantum lower bounds for the collision and the element distinctness problems
- An Improved Claw Finding Algorithm Using Quantum Walk
- Finding many collisions via reusable quantum walks. Application to lattice sieving
- Triangulating rebound attack on AES-like hashing
- On quantum secure compressing pseudorandom functions
- Mind the bad norms. Revisiting compressed oracle-based quantum indistinguishability proofs
- Quantum algorithm for the collisionless Boltzmann equation
- Low-gate quantum golden collision finding
This page was built for publication: Quantum multicollision-finding algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1703921)