Finding shortest lattice vectors faster using quantum search
type: Item
instance of: scholarly article
title: Finding shortest lattice vectors faster using quantum search
zbMATH Open document ID: 1356.94069
author: Thijs Laarhoven
author: Michele Mosca
author: Joop van de Pol
published in: Designs, Codes and Cryptography
publication date: 2015-10-26T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q12
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 6498055
zbMATH Keywords: lattices
zbMATH Keywords: shortest vector problem
zbMATH Keywords: sieving
zbMATH Keywords: quantum search
describes a project that uses: BKZ
describes a project that uses: BLISS
describes a project that uses: NTRU
MaRDI profile type: Publication
full work available at URL: s10623-015-0067-5
OpenAlex ID: W1992938819
Wikidata QID: Q59410708
cites work: Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
cites work: Q4542515
cites work: A sieve algorithm for the shortest lattice vector problem
cites work: Beyond Locality-Sensitive Hashing
cites work: Optimal Data-Dependent Hashing for Approximate Near Neighbors
cites work: Accelerated Verification of ECDSA Signatures
cites work: A sieve algorithm based on overlattices
cites work: Strengths and Weaknesses of Quantum Computing
cites work: Computing Logarithms in Finite Fields of Characteristic Two
cites work: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
cites work: (Leveled) fully homomorphic encryption without bootstrapping
cites work: Quantum cryptanalysis of hash and claw-free functions
cites work: Q4819589
cites work: Quantum Algorithms for Element Distinctness
cites work: Similarity estimation techniques from rounding algorithms
cites work: BKZ 2.0: Better Lattice Security Estimates
cites work: Quantum algorithms for algebraic problems
cites work: Constructing elliptic curve isogenies in quantum subexponential time
cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities
cites work: Improved low-density subset sum algorithms
cites work: Lattice Signatures and Bimodal Gaussians
cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
cites work: Exponentiation in Pairing-Friendly Groups Using Homomorphisms
cites work: Q4783726
cites work: Predicting Lattice Reduction
cites work: Lattice Enumeration Using Extreme Pruning
cites work: Fully homomorphic encryption using ideal lattices
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Quantum Random Access Memory
cites work: Q4228473
cites work: Q3522477
cites work: Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
cites work: Algorithms for the Shortest and Closest Lattice Vector Problems
cites work: Q3840170
cites work: Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice
cites work: Q4194048
cites work: Hardness of approximating the shortest vector problem in lattices
cites work: A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
cites work: Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
cites work: Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
cites work: Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search
cites work: Solving low-density subset sum problems
cites work: Factoring polynomials with rational coefficients
cites work: Algorithms and Computation
cites work: Lattice Signatures without Trapdoors
cites work: Q4718481
cites work: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
cites work: Q5417723
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Encyclopedia of Complexity and Systems Science
cites work: Sieve algorithms for the shortest vector problem are practical
cites work: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
cites work: Q4314376
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Quantum Walk Based Search Algorithms
cites work: Sieving for Shortest Vectors in Ideal Lattices

Finding shortest lattice vectors faster using quantum search (cites work)
cites work: A hierarchy of polynomial time lattice basis reduction algorithms

Finding shortest lattice vectors faster using quantum search (cites work)
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems

Finding shortest lattice vectors faster using quantum search (cites work)
cites work: Q4418644

Finding shortest lattice vectors faster using quantum search (cites work)
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Finding shortest lattice vectors faster using quantum search (cites work)
cites work: Short RSA keys and their generation

Finding shortest lattice vectors faster using quantum search (cites work)
cites work: A Three-Level Sieve Algorithm for the Shortest Vector Problem

Finding shortest lattice vectors faster using quantum search (DBLP publication ID)
DBLP publication ID: journals/dcc/LaarhovenMP15

Finding shortest lattice vectors faster using quantum search (DOI)
DOI: 10.1007/S10623-015-0067-5