Concrete analysis of quantum lattice enumeration
From MaRDI portal
Publication:6595811
DOI10.1007/978-981-99-8727-6_5MaRDI QIDQ6595811
Tran Ngo, Shi Bai, Floyd B. Johnson, Tanja Lange, Maya-Iggy van Hoof
Publication date: 30 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On quantum slide attacks
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Quantum lattice enumeration and tweaking discrete pruning
- Revisiting TESLA in the quantum random oracle model
- Quantum resource estimates for computing elliptic curve discrete logarithms
- Quantum circuits for floating-point arithmetic
- Advanced lattice sieving on GPUs, with tensor cores
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum security analysis of CSIDH
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
- The general sieve kernel and new records in lattice reduction
- Estimating quantum speedups for lattice sieves
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator
- Practical, Predictable Lattice Basis Reduction
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Quantum Computation and Quantum Information
- BKZ 2.0: Better Lattice Security Estimates
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Practical Implementation of a Quantum Backtracking Algorithm
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Quantum algorithms revisited
- New directions in nearest neighbor searching with applications to lattice sieving
- Improved reversible and quantum circuits for Karatsuba-based integer multiplication.
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
- A sieve algorithm for the shortest lattice vector problem
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- On the Lattice Isomorphism Problem
- Floating-Point LLL Revisited
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- The theory of variational hybrid quantum-classical algorithms
- Algorithmic Number Theory
- On lattices, learning with errors, random linear codes, and cryptography
- Lattice Sieving via Quantum Random Walks
- Finding many collisions via reusable quantum walks. Application to lattice sieving
Related Items (1)
This page was built for publication: Concrete analysis of quantum lattice enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6595811)
