Standard

Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems. / Malygina, E. S.; Kutsenko, A. V.; Novoselov, S. A. et al.

In: Journal of Applied and Industrial Mathematics, Vol. 17, No. 4, 09.2023, p. 767-790.

Research output: Contribution to journal › Article › peer-review

Harvard

Malygina, ES, Kutsenko, AV, Novoselov, SA, Kolesnikov, NS, Bakharev, AO, Khilchuk, IS, Shaporenko, AS & Tokareva, NN 2023, 'Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems', Journal of Applied and Industrial Mathematics, vol. 17, no. 4, pp. 767-790. https://doi.org/10.1134/s1990478923040087

APA

Malygina, E. S., Kutsenko, A. V., Novoselov, S. A., Kolesnikov, N. S., Bakharev, A. O., Khilchuk, I. S., Shaporenko, A. S., & Tokareva, N. N. (2023). Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems. Journal of Applied and Industrial Mathematics, 17(4), 767-790. https://doi.org/10.1134/s1990478923040087

Vancouver

Malygina ES, Kutsenko AV, Novoselov SA, Kolesnikov NS, Bakharev AO, Khilchuk IS et al. Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems. Journal of Applied and Industrial Mathematics. 2023 Sept;17(4):767-790. doi: 10.1134/s1990478923040087

Author

Malygina, E. S. ; Kutsenko, A. V. ; Novoselov, S. A. et al. / Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems. In: Journal of Applied and Industrial Mathematics. 2023 ; Vol. 17, No. 4. pp. 767-790.

BibTeX

@article{b1a4002f1de94113b9405920035a2897,
title = "Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems",
abstract = "The paper provides an overview of the main approaches to the construction ofpost-quantum cryptographic systems that are currently used. The area of lattice-basedcryptography is analyzed in detail. We give the description and characterization of some knownlattice-based cryptosystems whose resilience is based on the complexity of the shortest vectorproblem, learning with errors problem, and their variations. The main approaches to solving theproblems from lattice theory, on which attacks on the corresponding cryptosystems are based, areanalyzed. In particular, some known theoretical estimates of time and memory complexity oflattice basis reduction and lattice sieving algorithms are presented.",
author = "Malygina, {E. S.} and Kutsenko, {A. V.} and Novoselov, {S. A.} and Kolesnikov, {N. S.} and Bakharev, {A. O.} and Khilchuk, {I. S.} and Shaporenko, {A. S.} and Tokareva, {N. N.}",
note = "The work of the first, third, and fourth authors was supported by the Kovalevskaya North-Western Mathematical Center of Immanuel Kant Baltic Federal University under the agreement with the Ministry of Science and Higher Education of Russia no. 075–02–2023–934. The work of the second, fifth, sixth, seventh, and eighth authors was supported by the Mathematical Center in Akademgorodok under agreement with the Ministry of Science and Higher Education of Russia no. 075–15–2022–282).",
year = "2023",
month = sep,
doi = "10.1134/s1990478923040087",
language = "English",
volume = "17",
pages = "767--790",
journal = "Journal of Applied and Industrial Mathematics",
issn = "1990-4789",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "4",

}

RIS

TY - JOUR

T1 - Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems

AU - Malygina, E. S.

AU - Kutsenko, A. V.

AU - Novoselov, S. A.

AU - Kolesnikov, N. S.

AU - Bakharev, A. O.

AU - Khilchuk, I. S.

AU - Shaporenko, A. S.

AU - Tokareva, N. N.

N1 - The work of the first, third, and fourth authors was supported by the Kovalevskaya North-Western Mathematical Center of Immanuel Kant Baltic Federal University under the agreement with the Ministry of Science and Higher Education of Russia no. 075–02–2023–934. The work of the second, fifth, sixth, seventh, and eighth authors was supported by the Mathematical Center in Akademgorodok under agreement with the Ministry of Science and Higher Education of Russia no. 075–15–2022–282).

PY - 2023/9

Y1 - 2023/9

N2 - The paper provides an overview of the main approaches to the construction ofpost-quantum cryptographic systems that are currently used. The area of lattice-basedcryptography is analyzed in detail. We give the description and characterization of some knownlattice-based cryptosystems whose resilience is based on the complexity of the shortest vectorproblem, learning with errors problem, and their variations. The main approaches to solving theproblems from lattice theory, on which attacks on the corresponding cryptosystems are based, areanalyzed. In particular, some known theoretical estimates of time and memory complexity oflattice basis reduction and lattice sieving algorithms are presented.

AB - The paper provides an overview of the main approaches to the construction ofpost-quantum cryptographic systems that are currently used. The area of lattice-basedcryptography is analyzed in detail. We give the description and characterization of some knownlattice-based cryptosystems whose resilience is based on the complexity of the shortest vectorproblem, learning with errors problem, and their variations. The main approaches to solving theproblems from lattice theory, on which attacks on the corresponding cryptosystems are based, areanalyzed. In particular, some known theoretical estimates of time and memory complexity oflattice basis reduction and lattice sieving algorithms are presented.

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85185394696&origin=inward&txGid=984f30bedd01a30235a3bc9e2aa61193

UR - https://www.mendeley.com/catalogue/cf7ef905-90c9-346e-8925-d2067a281305/

U2 - 10.1134/s1990478923040087

DO - 10.1134/s1990478923040087

M3 - Article

VL - 17

SP - 767

EP - 790

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 4

ER -

ID: 59722437