KIAM Main page Web Library  •  Publication Searh  Русский 

Conference material: "Academician O.B. Lupanov XIV International Scientific Seminar "Discrete Mathematics and Its Applications" (20-25 June 2022, Moscow)"
Authors: Bakharev A.O.
Upper bounds of complexity of quantum oracle for problem of finding shortest vector on integer lattice
Due to the development of quantum computing, there is a need for development and analysis of cryptosystems resistant to attacks with using a quantum computer - post-quantum algorithms cryptography. The strength of many well-known post-quantum cryptosystems, based on the theory of lattices, is based on the complexity of solving the problem finding the shortest vector in the lattice (SVP). For the previously proposed models of the quantum oracle used in the hybrid quantum-classical algorithm for solving the SVP problem, new refined estimates of implementation complexity. Designed and analyzed a new quantum oracle model that uses classical memory to storing a list of vectors.
shortest vector problem, quantum computing
Publication language: russian,  pages: 4 (p. 248-251)
Russian source text:
Export link to publication in format:   RIS    BibTeX
About authors: