<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.35596/1729-7648-2025-23-6-65-70</article-id><article-id custom-type="elpub" pub-id-type="custom">bsuir-4248</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>Выбор алгоритмов постквантовой криптографии для стандартизации и оценки их безопасности</article-title><trans-title-group xml:lang="en"><trans-title>Selection of Post-Quantum Cryptography Algorithms for Standardization and Assessment of Their Security</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Михневич</surname><given-names>С. Ю.</given-names></name><name name-style="western" xml:lang="en"><surname>Mikhnevich</surname><given-names>S. Yu.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Михневич Светлана Юрьевна, канд. физ.-мат. наук, доц., зав. каф. инфокоммуникационных технологий; доц. каф. информационных радиотехнологий</p><p>220076, Минск, ул. Ф. Скорины, 8/2</p><p>Тел.: +375 44 701-15-67</p></bio><bio xml:lang="en"><p>Mikhnevich Svetlana Yurievna, Cand. Sci. (Phys. and Math.), Associate Professor, Head of the Department of Infocommunication Technologies; Associate Professor at the Department of Information Radiotechlogies</p><p>220076, Minsk, F. Skoryna St., 8/2</p><p>Tel.: +375 44 701-15-67</p></bio><email xlink:type="simple">s.mikhnevich@bsac.by</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Гладун</surname><given-names>П. И.</given-names></name><name name-style="western" xml:lang="en"><surname>Hladun</surname><given-names>P. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>преп. каф. инфокоммуникационных технологий</p><p>220076, Минск, ул. Ф. Скорины, 8/2</p></bio><bio xml:lang="en"><p>Lecturer at the Department of Infocommunication Technologies</p><p>220076, Minsk, F. Skoryna St., 8/2</p></bio><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусская государственная академия связи, Белорусский государственный университет информатики и радиоэлектроники</institution></aff><aff xml:lang="en"><institution>Belarusian State Academy of Communications; Belarusian State University of Informatics and Radioelectronics</institution></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Белорусская государственная академия связи</institution></aff><aff xml:lang="en"><institution>Belarusian State Academy of Communications</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>25</day><month>12</month><year>2025</year></pub-date><volume>23</volume><issue>6</issue><fpage>65</fpage><lpage>70</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Михневич С.Ю., Гладун П.И., 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Михневич С.Ю., Гладун П.И.</copyright-holder><copyright-holder xml:lang="en">Mikhnevich S.Y., Hladun P.I.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://doklady.bsuir.by/jour/article/view/4248">https://doklady.bsuir.by/jour/article/view/4248</self-uri><abstract><p>Показан процесс выбора алгоритмов постквантовой криптографии для стандартизации на основе параметров, предлагаемых Национальным институтом стандартов и технологий США. Выполнена оценка стойкости алгоритмов постквантовой криптографии к атакам классических и квантовых компьютеров с учетом их особенностей. Обосновано различное количество операций для атак со стороны квантовых и классических компьютеров. Проанализированы возможности распараллеливания алгоритмов постквантовой криптографии. Отмечено, что несмотря на предполагаемое использование квантовых компьютеров, основная задача криптографии – применение алгоритмов, построенных на задачах, не сводимых к задачам P-типа сложности.</p></abstract><trans-abstract xml:lang="en"><p>The process of selecting post-quantum cryptography algorithms for standardization based on parameters proposed by the National Institute of Standards and Technology (NIST) is described. The resistance of post-quantum cryptography algorithms to attacks by classical and quantum computers is assessed, taking into account their specific features. The different numbers of operations for attacks by quantum and classical computers are substantiated. The parallelization potential of post-quantum cryptography algorithms is analyzed. It is noted that, despite the proposed use of quantum computers, the primary goal of cryptography is the application of algorithms based on problems that are not reducible to problems of P-class complexity.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>алгоритмы постквантовой криптографии</kwd><kwd>стандартизация</kwd><kwd>параметры безопасности криптографических алгоритмов</kwd><kwd>глубина схемы</kwd><kwd>распараллеливание</kwd></kwd-group><kwd-group xml:lang="en"><kwd>post-quantum cryptography algorithms</kwd><kwd>standardization</kwd><kwd>cryptographic algorithm security parameters</kwd><kwd>circuit depth</kwd><kwd>parallelization</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Duc-Thuan Dam, Thai-Ha Tran, Van-Phuc Hoang (2023) A Survey of Post-Quantum Cryptography: Start of a New Race. Cryptography. (7). https://doi.org/10.3390/ryptography7030040.</mixed-citation><mixed-citation xml:lang="en">Duc-Thuan Dam, Thai-Ha Tran, Van-Phuc Hoang (2023) A Survey of Post-Quantum Cryptography: Start of a New Race. Cryptography. (7). https://doi.org/10.3390/ryptography7030040.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Niederhagen R., Waidner M. (2017) Practical Post–Quantum Cryptography. Darmstadt, Fraunhofer Institute for Secure Information Technology.</mixed-citation><mixed-citation xml:lang="en">Niederhagen R., Waidner M. (2017) Practical Post–Quantum Cryptography. Darmstadt, Fraunhofer Institute for Secure Information Technology.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Google Announces New Algorithm That Makes FIDO Encryption Safe From Quantum Computers. Аrs Technica. Available: https://arstechnica.com/security/2023/08/passkeys-are-great-but-not-safe-from-quantum-computersdilithium-could-change-that/ (Аccessed 20 March 2025).</mixed-citation><mixed-citation xml:lang="en">Google Announces New Algorithm That Makes FIDO Encryption Safe From Quantum Computers. Аrs Technica. Available: https://arstechnica.com/security/2023/08/passkeys-are-great-but-not-safe-from-quantum-computersdilithium-could-change-that/ (Аccessed 20 March 2025).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Yashchenko V. V. (1998) Basic Concepts of Cryptography. Mathematical Education. 3 (2), 53–70 (in Russian).</mixed-citation><mixed-citation xml:lang="en">Yashchenko V. V. (1998) Basic Concepts of Cryptography. Mathematical Education. 3 (2), 53–70 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Grassl M., Langenberg B., Roetteler M., Steinwandt R. (2025) Applying Grover’s Algorithm to AES: Quantum Resource Estimates. arXiv:1512.04965v1. Available: https://doi.org/10.48550/arXiv.1512.04965 (Аccessed 20 March 2025).</mixed-citation><mixed-citation xml:lang="en">Grassl M., Langenberg B., Roetteler M., Steinwandt R. (2025) Applying Grover’s Algorithm to AES: Quantum Resource Estimates. arXiv:1512.04965v1. Available: https://doi.org/10.48550/arXiv.1512.04965 (Аccessed 20 March 2025).</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
