|
This article is cited in 2 scientific papers (total in 2 papers)
Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
E. S. Malyginaab, A. V. Kutsenkob, S. A. Novoselova, N. S. Kolesnikova, A. O. Bakharevb, I. S. Khilchukb, A. S. Shaporenkob, N. N. Tokarevaba a Immanuel Kant Baltic Federal University, 14 Aleksandr Nevskii Street, 236041 Kaliningrad, Russia
b Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
Abstract:
The paper provides an overview of the main approaches to the construction of post-quantum cryptographic systems that are currently used. The area of lattice-based cryptography is analyzed in detail. We give the description and characteristics of some known lattice-based cryptosystems whose security is based on the complexity of the shortest vector problem, learning with errors problem, and their variations. The main approaches to solving the problems from lattice theory, on which attacks on the corresponding cryptosystems are based, are analyzed. In particular, some known theoretical estimates of time and memory complexity of lattice basis reduction and lattice sieving algorithms are presented. Tab. 6, illustr. 1, biblogr. 93.
Keywords:
post-quantum cryptography, quantum computer, integer lattice.
Received: 04.05.2023 Revised: 28.07.2023 Accepted: 20.08.2023
Citation:
E. S. Malygina, A. V. Kutsenko, S. A. Novoselov, N. S. Kolesnikov, A. O. Bakharev, I. S. Khilchuk, A. S. Shaporenko, N. N. Tokareva, “Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems”, Diskretn. Anal. Issled. Oper., 30:4 (2023), 46–90; J. Appl. Industr. Math., 17:4 (2023), 767–790
Linking options:
https://www.mathnet.ru/eng/da1334 https://www.mathnet.ru/eng/da/v30/i4/p46
|
Statistics & downloads: |
Abstract page: | 81 | Full-text PDF : | 7 | References: | 12 | First page: | 8 |
|