Finding shortest vector using quantum NV sieve on Grover

DOI10.1007/978-981-97-1235-9_6MaRDI QIDQ6547855

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

Publication date: 31 May 2024

zbMATH Keywords

shortest vector problemquantum attacklattice based cryptographyGrover's searchquantum NV sieve

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Finding shortest lattice vectors faster using quantum search
• The LLL algorithm. Survey and applications
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Implementing Grover oracles for quantum key search on AES and LowMC
• A Three-Level Sieve Algorithm for the Shortest Vector Problem
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• Sieve algorithms for the shortest vector problem are practical
• A sieve algorithm for the shortest lattice 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)