Quantum NV Sieve on Grover for Solving Shortest Vector Problem

ePrint Report: Quantum NV Sieve on Grover for Solving Shortest Vector Problem

Hyunji Kim, Kyoungbae Jang, Hyunjun Kim, Anubhab Baksi, Chakraborty Sumanta, Hwajeong Seo

Quantum computers can efficiently model and solve several challenging problems for classical computers, raising concerns about potential security reductions in cryptography. NIST is already considering potential quantum attacks in the development of post-quantum cryptography by estimating the quantum resources required for such quantum attacks. In this paper, we present quantum circuits for the NV sieve algorithm …

can computers cryptography eprint report grover kim nist problem problems quantum quantum computers report security seo