<?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">tuzsut</journal-id><journal-title-group><journal-title xml:lang="ru">Труды учебных заведений связи</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of Telecommunication Universities</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1813-324X</issn><issn pub-type="epub">2712-8830</issn><publisher><publisher-name>СПбГУТ</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.31854/1813-324X-2025-11-2-101-108</article-id><article-id custom-type="edn" pub-id-type="custom">DWRJHM</article-id><article-id custom-type="elpub" pub-id-type="custom">tuzsut-673</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>INFORMATION TECHNOLOGIES AND TELECOMMUNICATION</subject></subj-group></article-categories><title-group><article-title>Реализация электронной подписи ECC в ограниченных средах</article-title><trans-title-group xml:lang="en"><trans-title>Implementation of an ECC Digital Signature Technique in Constrained Environments</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-0003-2429-5122</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>Sabbry</surname><given-names>N.H.</given-names></name></name-alternatives><bio xml:lang="ru"><p>аспирант кафедры факультет информационно-измерительных и биотехнических систем Санкт-Петербургского государственного электротехнического университет «ЛЭТИ» имени В.И. Ульянова (Ленина)</p></bio><email xlink:type="simple">nawrashussein@mail.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Санкт-Петербургский государственный электротехнический университет «ЛЭТИ» им. В.И. Ульянова (Ленина)<country>Россия</country></aff><aff xml:lang="en">Saint Petersburg Electrotechnical University<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>07</day><month>05</month><year>2025</year></pub-date><volume>11</volume><issue>2</issue><fpage>101</fpage><lpage>108</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">Sabbry N.</copyright-holder><license 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://tuzs.sut.ru/jour/article/view/673">https://tuzs.sut.ru/jour/article/view/673</self-uri><abstract><p>Обеспечение безопасных операций криптографии в средах с ограниченными ресурсами представляет собой сложную задачу из-за ограниченной вычислительной мощности и памяти. В условиях стремительного роста беспилотных транспортных систем возрастает потребность в эффективных и безопасных криптографических решениях. Оптимизация криптографических алгоритмов для таких систем становится особенно актуальной с учетом их ограниченных вычислительных ресурсов и высоких требований к безопасности.</p><p>Целью данного исследования является оптимизация операций электронной подписи на основе эллиптической кривой (ECC) для систем с ограниченными ресурсами, в частности для беспилотных транспортных систем. Исследование направлено на повышение вычислительной эффективности и снижение использования памяти, делая механизмы безопасности на основе ECC более подходящими для встроенных приложений.</p><p>Новизна данного исследования заключается в интеграции множества методов оптимизации. Улучшается скалярное умножение точки, используя свойства циклической группы, противоположного числа, а также усовершенствованный оконный метод умножения. Кроме того, вводится детерминированный метод генерации одноразового используемого числа (nonc), вдохновленный EdDSA, для дальнейшего повышения эффективности цифровой подписи. Эти оптимизации в совокупности способствуют более эффективному криптографическому процессу, подходящему для сред с ограниченными ресурсами.</p><p>Теоретическая значимость заключается в разработке нового математического аппарата, позволяющего оптимизировать операции электронной подписи. </p><p>Практическая значимость данного исследования заключается в его применимости в маломощных встраиваемых системах, где вычислительные ресурсы и память крайне ограничены. Оптимизируя операции ECC, это исследование повышает безопасность и производительность криптографических реализаций в беспилотных транспортных системах и аналогичных встраиваемых приложениях, обеспечивая безопасную связь без превышения аппаратных ограничений.</p><p>Реализация предложенного метода была осуществлена на микроконтроллере ATmega 2560, полученные результаты показывают сокращения количества циклов на 54,1 % и уменьшения использования SRAM на 72,6 % при генерации ключей, а также значительного повышения производительности в процессах подписи и проверки. Экспериментальные результаты подтверждают его эффективность в оптимизации операций ECC для ограниченных устройств беспилотных транспортных систем.</p></abstract><trans-abstract xml:lang="en"><p>Relevance. Ensuring secure cryptographic operations in resource-constrained environments presents challenges due to limited computational power and memory. With the rapid growth of Unmanned Vehicle Systems, the need for efficient and secure cryptographic solutions is increasing. Optimizing cryptographic algorithms for such systems becomes especially relevant given their limited computational resources and high security demands.</p><p>The purpose of this study is to optimize Elliptic Curve Cryptography (ECC) digital signature operations for resource-limited systems, particularly in unmanned vehicle systems. The research aims to enhance computational efficiency and reduce memory usage, making ECC-based security mechanisms more feasible for embedded applications.</p><p>The novelty of this study lies in its integration of multiple optimization techniques. It improves scalar point multiplication by leveraging cyclic group properties, additive inverses, and an enhanced windowed multiplication method. Additionally, it introduces a deterministic nonce generation approach inspired by EdDSA to further refine digital signature efficiency. These innovations collectively contribute to a more efficient cryptographic process suitable for constrained environments.</p><p>The theoretical significance lies in the development of a new mathematical apparatus that makes it possible to optimize electronic signature operations.</p><p>The practical significance of this study is its applicability in low-power embedded systems, where computational and memory resources are highly limited. By optimizing ECC operations, this research enhances the security and performance of cryptographic implementations in unmanned vehicle systems and similar embedded applications, ensuring secure communications without exceeding hardware constraints.</p><p>The proposed method was implemented on the Arduino Atmega 2560 R3, achieves up to a 54,1 % results are showing reduction in cycle count and a 72,6 % decrease in SRAM usage for key generation, alongside significant performance improvements in signing and verification processes. Experimental results confirm its effectiveness in optimizing ECC operations for constrained devices of unmanned vehicle systems.</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>digital signature</kwd><kwd>elliptic curve point multiplication</kwd><kwd>resource-constrained devices</kwd><kwd>unmanned vehicle systems (UVS)</kwd><kwd>microcontroller</kwd></kwd-group><funding-group xml:lang="ru"><funding-statement>Работа выполнена в рамках государственного задания Министерства науки и высшего образования Российской Федерации № 075-00003-24-01 от 08.02.2024 (проект FSEE-2024-0003).</funding-statement></funding-group><funding-group xml:lang="en"><funding-statement>This research was funded by the Ministry of Science and Higher Education of the Russian Science Foundation (No. 075-00003-24-02, FSEE-2024-0003).</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Johnson D., Menezes A., Vanstone S. The Elliptic Curve Digital Signature Algorithm (ECDSA) // International Journal of Information Security. 2001. Vol. 1. PP. 36‒63. DOI:10.1007/s102070100002</mixed-citation><mixed-citation xml:lang="en">Johnson D., Menezes A., Vanstone S. The Elliptic Curve Digital Signature Algorithm (ECDSA). International Journal of Information Security. 2001;1:36‒63. DOI:10.1007/s102070100002</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Josefsson S., Liusvaara I. Edwards-Curve Digital Signature Algorithm (EdDSA). 2017. DOI:10.17487/RFC8032</mixed-citation><mixed-citation xml:lang="en">Josefsson S., Liusvaara I. Edwards-Curve Digital Signature Algorithm (EdDSA). 2017. DOI:10.17487/RFC8032</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Sabbry N.H., Levina A.B. An Optimized Point Multiplication Strategy in Elliptic Curve Cryptography for Resource-Constrained Devices // Mathematics. 2024. Vol. 12. Iss. 6. P. 881. DOI:10.3390/math12060881. EDN:JZKADF</mixed-citation><mixed-citation xml:lang="en">Sabbry N.H., Levina A.B. An Optimized Point Multiplication Strategy in Elliptic Curve Cryptography for Resource-Constrained Devices. Mathematics. 2024;12(6):881. DOI:10.3390/math12060881. EDN:JZKADF</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Hisil H., Wong K.K., Carter G., Dawson E. Twisted Edwards Curves Revisited // Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2008, Melbourne, Austral-ia, 7‒11 December 2008). Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2008. Vol. 5350. PP. 326‒343. DOI:10.1007/978-3-540-89255-7_20</mixed-citation><mixed-citation xml:lang="en">Hisil H., Wong K.K., Carter G., Dawson E. Twisted Edwards Curves Revisited. Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2008, 7‒11 December 2008, Mel-bourne, Australia. Lecture Notes in Computer Science, vol.5350. Berlin, Heidelberg: Springer; 2008. p.326‒343. DOI:10.1007/978-3-540-89255-7_20</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Sabbry N.H., Levina A. Nonce generation techniques in Schnorr multi-signatures: Exploring EdDSA-inspired approaches // AIMS Mathematics. 2024. Vol. 9. Iss. 8. PP. 20304‒20325. DOI:10.3934/math.2024988. EDN:YSJYIC</mixed-citation><mixed-citation xml:lang="en">Sabbry N.H., Levina A. Nonce generation techniques in Schnorr multi-signatures: Exploring EdDSA-inspired approaches. AIMS Mathematics. 2024;9(8):20304‒20325. DOI:10.3934/math.2024988. EDN:YSJYIC</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Paar C., Pelzl J. Understanding Cryptography: A Textbook for Students and Practitioners. Berlin, Heidelberg: Springer, 2010. DOI:10.1007/978-3-642-04101-3</mixed-citation><mixed-citation xml:lang="en">Paar C., Pelzl J. Understanding Cryptography: A Textbook for Students and Practitioners. Berlin, Heidelberg: Springer; 2010. DOI:10.1007/978-3-642-04101-3</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Hankerson D., Menezes A. Elliptic Curve Cryptography // In: Jajodia S., Samarati P., Yung M. (eds.) Encyclopedia of Cryptography, Security and Privacy. Berlin, Heidelberg: Springer, 2021. PP. 1‒2. DOI:10.1007/978-3-642-27739-9_245-2</mixed-citation><mixed-citation xml:lang="en">Hankerson D., Menezes A. Elliptic Curve Cryptography. In: Jajodia S., Samarati P., Yung M. (eds.) Encyclopedia of Cryptography, Security and Privacy. Berlin, Heidelberg: Springer; 2021. p.1‒2. DOI:10.1007/978-3-642-27739-9_245-2</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Izu T., Möller B., Takagi T. Improved Elliptic Curve Multiplication Methods Resistant Against Side Channel Attacks // Proceedings of the Third International Conference on Cryptology in India (INDOCRYPT 2002, Hyderabad, India, 16–18 December 2002). Lecture Notes in Computer Science. Berlin Heidelberg: Springer, 2002. Vol. 2551. PP. 296‒313. DOI:10.1007/3-540-36231-2_24</mixed-citation><mixed-citation xml:lang="en">Izu T., Möller B., Takagi T. Improved Elliptic Curve Multiplication Methods Resistant Against Side Channel Attacks. Proceedings of the Third International Conference on Cryptology in India, INDOCRYPT 2002, 16–18 December 2002, Hyderabad, India. Lecture Notes in Computer Science, vol.2551. Berlin Heidelberg: Springer; 2002. p.296‒313. DOI:10.1007/3-540-36231-2_24</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Shenets N.N., Petushkov A.S. New Regular Sliding Window Algorithms for Elliptic Curve Scalar Point Multiplication // Automatic Control and Computer Sciences. 2021. Vol. 55. PP. 1029‒1038. DOI:10.3103/S0146411621080289. EDN:FWONTD</mixed-citation><mixed-citation xml:lang="en">Shenets N.N., Petushkov A.S. New Regular Sliding Window Algorithms for Elliptic Curve Scalar Point Multiplication. Automatic Control and Computer Sciences. 2021;55:1029‒1038. DOI:10.3103/S0146411621080289. EDN:FWONTD</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Cheon J.H., Hong J., Kim M. Speeding Up the Pollard Rho Method on Prime Fields // Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2008, Melbourne, Australia, 7‒11 December 2008). Berlin, Heidelberg: Springer, 2008. PP. 471‒488. DOI:10.1007/978-3-540-89255-7_29</mixed-citation><mixed-citation xml:lang="en">Cheon J.H., Hong J., Kim M. Speeding Up the Pollard Rho Method on Prime Fields. Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2008, 7‒11 December 2008, Melbourne, Australia. Berlin, Heidelberg: Springer; 2008. p.471‒488. DOI:10.1007/978-3-540-89255-7_29</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Alyas H.H., Abdullah A.A. Enhancement the ChaCha20 Encryption Algorithm Based on Chaotic Maps // In: Kumar R., Mishra B.K., Pattnaik P.K. Next Generation of Internet of Things: Proceedings of ICNGIoT 2021. Lecture Notes in Networks and Systems. Singapore: Springer, 2021. Vol. 201. PP. 91‒107. DOI:10.1007/978-981-16-0666-3_10. EDN:ZPPOQO</mixed-citation><mixed-citation xml:lang="en">Alyas H.H., Abdullah A.A. Enhancement the ChaCha20 Encryption Algorithm Based on Chaotic Maps. In: Kumar R., Mishra B.K., Pattnaik P.K. Next Generation of Internet of Things: Proceedings of ICNGIoT 2021. Lecture Notes in Networks and Systems, vol.201. Singapore: Springer; 2021. p.91‒107. DOI:10.1007/978-981-16-0666-3_10. EDN:ZPPOQO</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Hutter M., Schwabe P. NaCl on 8-Bit AVR Microcontrollers // Proceedings of the 6th International Conference on Cryptology in Africa «Progress in Cryptology» (AFRICACRYPT 2013, Cairo, Egypt, 22‒24 June 2013). Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2013. Vol. 7918. PP. 156‒172. DOI:10.1007/978-3-642-38553-7_9</mixed-citation><mixed-citation xml:lang="en">Hutter M., Schwabe P. NaCl on 8-Bit AVR Microcontrollers. Proceedings of the 6th International Conference on Cryptology in Africa «Progress in Cryptology», AFRICACRYPT 2013, 22‒24 June 2013, Cairo, Egypt. Lecture Notes in Computer Science, vol.7918. Berlin, Heidelberg: Springer; 2013. p.156‒172. DOI:10.1007/978-3-642-38553-7_9</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Nouma S.E., Yavuz A.A. Lightweight and Resilient Signatures for Cloud-Assisted Embedded IoT Systems // arXiv preprint arXiv:2409.13937. 2024. DOI:10.48550/arXiv.2409.13937</mixed-citation><mixed-citation xml:lang="en">Nouma S.E., Yavuz A.A. Lightweight and Resilient Signatures for Cloud-Assisted Embedded IoT Systems. arXiv preprint arXiv:2409.13937. 2024. DOI:10.48550/arXiv.2409.13937</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>
