Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search

DOI10.1007/978-3-642-38616-9_6zbMath1306.94067arXiv1301.6176OpenAlexW2951967430MaRDI QIDQ4928590

Joop van de Pol, Thijs Laarhoven, Michele Mosca

Publication date: 14 June 2013

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.6176

zbMATH Keywords

sievingquantum algorithmslatticesshortest vector problemquantum search

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (8)

Homomorphic Encryption Standard ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method ⋮ Estimating quantum speedups for lattice sieves ⋮ Quantum cryptography beyond quantum key distribution ⋮ Using quantum key distribution for cryptographic purposes: a survey ⋮ Quantum algorithm design: techniques and applications ⋮ The lattice-based digital signature scheme qTESLA

Uses Software

• BKZ

This page was built for publication: Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search