<?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">procyber</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник кибернетики</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings in Cybernetics</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">1999-7604</issn><publisher><publisher-name>Бюджетное учреждение высшего образования Ханты-Мансийского автономного округа – Югры «Сургутский государственный университет»</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.35266/1999-7604-2024-4-6</article-id><article-id custom-type="elpub" pub-id-type="custom">procyber-624</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><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Engeneering</subject></subj-group></article-categories><title-group><article-title>Анализ и сравнение блочных алгоритмов симметричного шифрования</article-title><trans-title-group xml:lang="en"><trans-title>Analysis and comparison of block symmetric encryption algorithms</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0005-2985-0871</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Поддубный</surname><given-names>И. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Poddubnyy</surname><given-names>I. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>магистрант</p></bio><bio xml:lang="en"><p>Master’s Degree Student</p></bio><email xlink:type="simple">ivan_poddubnyy01@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1332-463X</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Брагинский</surname><given-names>М. Я.</given-names></name><name name-style="western" xml:lang="en"><surname>Braginsky</surname><given-names>M. Ya.</given-names></name></name-alternatives><bio xml:lang="ru"><p>кандидат технических наук, доцент</p></bio><bio xml:lang="en"><p>Doctor of Sciences (Engineering), Docent</p></bio><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Сургутский государственный университет, Сургут</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Surgut State University, Surgut</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>24</day><month>12</month><year>2024</year></pub-date><volume>23</volume><issue>4</issue><elocation-id>60–68</elocation-id><permissions><copyright-statement>Copyright &amp;#x00A9; Поддубный И.В., Брагинский М.Я., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Поддубный И.В., Брагинский М.Я.</copyright-holder><copyright-holder xml:lang="en">Poddubnyy I.V., Braginsky M.Y.</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://www.vestcyber.ru/jour/article/view/624">https://www.vestcyber.ru/jour/article/view/624</self-uri><abstract><p>. В современном мире криптография стала неотъемлемой частью информационной безопасности. В условиях постоянного развития технологий и увеличения объемов, передаваемых данных, необходимость их надежной защиты становится крайне актуальной. Эта статья посвящена сравнительному анализу современных симметричных алгоритмов шифрования. Критериями сравнения были приняты безопасность, сложность, производительность, применимость, а также стандартизация.</p></abstract><trans-abstract xml:lang="en"><p>In modern world, cryptography has become an essential part of the information security. With the constant development of technologies and increasing volumes of transmitted data, the necessity of their reliable protection becomes extremely urgent. This article is devoted to a comparative analysis of modern symmetric encryption algorithms. The comparison criteria are security, complexity, performance, applicability, and standardization.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>криптоанализ</kwd><kwd>блочное шифрование</kwd><kwd>симметричные алгоритмы шифрования</kwd><kwd>криптоалгоритмы</kwd><kwd>сравнение алгоритмов</kwd><kwd>производительность</kwd></kwd-group><kwd-group xml:lang="en"><kwd>cryptanalysis</kwd><kwd>block encryption</kwd><kwd>symmetric encryption algorithms</kwd><kwd>cryptoalgorithms</kwd><kwd>algorithm comparison</kwd><kwd>performance</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">The DES Algorithm Illustrated. URL: https://page.math.tu-berlin.de/~kant/teaching/hess/krypto-ws2006/des.htm (дата обращения: 27.09.2024).</mixed-citation><mixed-citation xml:lang="en">The DES Algorithm Illustrated. URL: https://page.math.tu-berlin.de/~kant/teaching/hess/krypto-ws2006/des.htm (дата обращения: 27.09.2024).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Remove the highly insecure DES encryption from the User accounts. URL: https://learn.microsoft.com/en-us/services-hub/unified/health/remediation-steps-ad/remove-the-highly-insecure-des-encryption-from-user-accounts (дата обращения: 27.09.2024).</mixed-citation><mixed-citation xml:lang="en">Remove the highly insecure DES encryption from the User accounts. URL: https://learn.microsoft.com/en-us/services-hub/unified/health/remediation-steps-ad/remove-the-highly-insecure-des-encryption-from-user-accounts (дата обращения: 27.09.2024).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Denning D. E., Dorothy E. Digital signatures with RSA and other public-key cryptosystems. Communications of the ACM. USA : ACM, 1984. p. 388–392.</mixed-citation><mixed-citation xml:lang="en">Denning D. E., Dorothy E. Digital signatures with RSA and other public-key cryptosystems. Communications of the ACM. USA : ACM, 1984. p. 388–392.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Davio M., Desmedt Y., Fosseprez M. et al. Analytical Characteristics of the DES. Advances in Cryptology. Heidelberg : Springer, 1984. p. 171–202.</mixed-citation><mixed-citation xml:lang="en">Davio M., Desmedt Y., Fosseprez M. et al. Analytical Characteristics of the DES. Advances in Cryptology. Heidelberg : Springer, 1984. p. 171–202.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Konheim A. G. Cryptography, a primer. New York, 1981. 432 p.</mixed-citation><mixed-citation xml:lang="en">Konheim A. G. Cryptography, a primer. New York, 1981. 432 p.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Miyaguchi S. The FEAL Cipher Family. Advances in Cryptology-CRYPTO’ 90. Heidelberg : Springer, 1990. p. 628–638.</mixed-citation><mixed-citation xml:lang="en">Miyaguchi S. The FEAL Cipher Family. Advances in Cryptology-CRYPTO’ 90. Heidelberg : Springer, 1990. p. 628–638.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Gilbert H., Chasse G. A Statistical Attack of the FEAL-8 Cryptosystem. Advances in Cryptology. Heidelberg : Springer, 1991. p. 22–33.</mixed-citation><mixed-citation xml:lang="en">Gilbert H., Chasse G. A Statistical Attack of the FEAL-8 Cryptosystem. Advances in Cryptology. Heidelberg : Springer, 1991. p. 22–33.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Ko Y., Hong S., Lee W. et al. Related Key Differen- tial Attacks on 27 Rounds of XTEA and Full-Round GOST. Heidelberg : Springer, 2004. P. 299–316.</mixed-citation><mixed-citation xml:lang="en">Ko Y., Hong S., Lee W. et al. Related Key Differen- tial Attacks on 27 Rounds of XTEA and Full-Round GOST. Heidelberg : Springer, 2004. P. 299–316.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Шнайер Б. Прикладная криптография: протоколы, алгоритмы и исходный код на С. 2-е изд. М. : Диалектика, 2022. 1040 с.</mixed-citation><mixed-citation xml:lang="en">Шнайер Б. Прикладная криптография: протоколы, алгоритмы и исходный код на С. 2-е изд. М. : Диалектика, 2022. 1040 с.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">DES algorithm. URL: https://github.com/dhuertas/DES/blob/master/des.c (дата обращения: 01.10.2024).</mixed-citation><mixed-citation xml:lang="en">DES algorithm. URL: https://github.com/dhuertas/DES/blob/master/des.c (дата обращения: 01.10.2024).</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">feal-8.c. URL: https://github.com/deeptechlabs/encryption/blob/master/FEAL8-WI/feal-8.c (дата обращения: 01.10.2024).</mixed-citation><mixed-citation xml:lang="en">feal-8.c. URL: https://github.com/deeptechlabs/encryption/blob/master/FEAL8-WI/feal-8.c (дата обращения: 01.10.2024).</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>
