By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the literature, we obtain improved asymptotic quantum results for solving the shortest vector problem on lattices. With quantum computers we can provably find a shortest vector in time $2^{1.799n + o(n)}$, improving upon the classical time complexities of $2^{2.465n + o(n)}$ of Pujol and Stehl\'{e} and the $2^{2n + o(n)}$ of Micciancio and Voulgaris, while heuristically we expect to find a shortest vector in time $2^{0.286n + o(n)}$, improving upon the classical time complexity of $2^{0.337n + o(n)}$ of Laarhoven. These quantum complexities will be an important guide for the selection of parameters for post-quantum cryptosystems based on the hardn...
Quantum computers, especially those with over 10,000 qubits, pose a potential threat to current publ...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
Quantum computers are expected to break today's public key cryptography within a few decades. New cr...
By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the l...
By applying Grover’s quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris,...
The Shortest Vector Problem (SVP) is one of the mathematical foundations of lattice based cryptograp...
The lattice hortest vector problem, or lattice SVP, has gained a lot of attention in the field of qu...
International audienceThe most important computational problem on lattices is the Shortest Vector Pr...
The most important computational problem on lattices is the Shortest Vector Problem (SVP). In this p...
A fundamental computational problem is to find a shortest non-zero vector in Euclidean lattices, a p...
Lattices are very important objects in the effort to construct cryptographic primitives that are sec...
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-q...
The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in...
The hardness of finding short vectors in ideals of cyclotomic number fields (hereafter, Ideal-SVP) c...
Quantum computers, especially those with over 10,000 qubits, pose a potential threat to current publ...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
Quantum computers are expected to break today's public key cryptography within a few decades. New cr...
By applying a quantum search algorithm to various heuristic and provable sieve algorithms from the l...
By applying Grover’s quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris,...
The Shortest Vector Problem (SVP) is one of the mathematical foundations of lattice based cryptograp...
The lattice hortest vector problem, or lattice SVP, has gained a lot of attention in the field of qu...
International audienceThe most important computational problem on lattices is the Shortest Vector Pr...
The most important computational problem on lattices is the Shortest Vector Problem (SVP). In this p...
A fundamental computational problem is to find a shortest non-zero vector in Euclidean lattices, a p...
Lattices are very important objects in the effort to construct cryptographic primitives that are sec...
Lattice-based cryptography has recently emerged as a prime candidate for efficient and secure post-q...
The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in...
The hardness of finding short vectors in ideals of cyclotomic number fields (hereafter, Ideal-SVP) c...
Quantum computers, especially those with over 10,000 qubits, pose a potential threat to current publ...
The shortest vector problem (SVP) in lattices is related to problems in combinatorial optimization, ...
Quantum computers are expected to break today's public key cryptography within a few decades. New cr...
.jpg%3Fwidth%3D300&w=3840&q=75)
Add to ORKG