Quantum multicollision-finding algorithm
From MaRDI portal
Recommendations
Cited in
(20)- An Improved Claw Finding Algorithm Using Quantum Walk
- On subset-resilient hash function families
- Finding many collisions via reusable quantum walks. Application to lattice sieving
- Quantum algorithms for the \(k\)-XOR problem
- On finding quantum multi-collisions
- Low-gate quantum golden collision finding
- Quantum algorithm for the collisionless Boltzmann equation
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions
- Quantum algorithm for the multicollision problem
- Quantum attacks on some Feistel block ciphers
- Quantum collision-resistance of non-uniformly distributed functions
- Triangulating rebound attack on AES-like hashing
- On quantum secure compressing pseudorandom functions
- Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms
- Improved quantum multicollision-finding algorithm
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Quantum collision-finding in non-uniform random functions
- Quantum lower bounds for the collision and the element distinctness problems
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)