Grover's oracle for the Shortest Vector Problem and its application in hybrid classical-quantum solvers

arXiv:2402.13895v1 Announce Type: cross
Abstract: Finding the shortest vector in a lattice is a problem that is believed to be hard both for classical and quantum computers. Many major post-quantum secure cryptosystems base their security on the hardness of the Shortest Vector Problem (SVP). Finding the best classical, quantum or hybrid classical-quantum algorithms for SVP is necessary to select cryptosystem parameters that offer sufficient level of security. Grover's search quantum algorithm provides a generic quadratic speed-up, given access to an …

application arxiv base computers cs.cr grover hard hybrid major oracle post-quantum problem quant-ph quantum quantum computers quantum secure security