Finding shortest vector using quantum NV sieve on Grover

DOI10.1007/978-981-97-1235-9_6MaRDI QIDQ6547855zbMATH OpenFDO

Authors Hyunji Kim, Kyoungbae Jang, Yu Jin Oh, Woojin Seok, Wonhuck Lee, Kwangil Bae, Ilkwon Sohn, Hwajeong Seo

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-981-97-1235-9_6

zbMATH Keywords

Grover's searchlattice based cryptographyquantum attackquantum NV sieveshortest vector problem

Mathematics Subject Classification ID

Computer security (68M25) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• A sieve algorithm for the shortest lattice vector problem
• A three-level sieve algorithm for the shortest vector problem
• Faster exponential time algorithms for the shortest vector problem
• Finding shortest lattice vectors faster using quantum search
• Implementing Grover oracles for quantum key search on AES and LowMC
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Sieve algorithms for the shortest vector problem are practical
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• The LLL algorithm. Survey and applications

Cited in

(1)

• On the practicality of quantum sieving algorithms for the shortest vector problem

This page was built for publication: Finding shortest vector using quantum NV sieve on Grover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547855)