Quantum procedures for nested search problems -- with applications in cryptanalysis
From MaRDI portal
Cites work
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Breaking symmetric cryptosystems using quantum period finding
- Cryptanalysis of skipjack reduced to 31 rounds using impossible differentials
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Finding shortest lattice vectors faster using quantum search
- Grover vs. McEliece
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1759272 (Why is no real title available?)
- Implementing Grover oracles for quantum key search on AES and LowMC
- Improved algorithm and lower bound for variable time quantum search
- Improved impossible differential cryptanalysis of 7-round AES-128
- Improved key recovery attacks on reduced-round AES in the single-key setting
- Improvements to quantum search techniques for block-ciphers, with applications to AES
- Oracles with costs
- Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Quantum impossible differential attacks: applications to AES and SKINNY
- Quantum information set decoding algorithms
- Quantum lattice enumeration and tweaking discrete pruning
- Quantum search of spatial regions
- Quantum search with variable times
- Quantum-walk speedup of backtracking algorithms
- The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
- Variable time amplitude amplification and quantum algorithms for linear algebra problems
This page was built for publication: Quantum procedures for nested search problems -- with applications in cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326373)
