kaz29Вестник Казахстанско-Британского технического университетаHerald of the Kazakh-British Technical University1998-66882959-8109Казахстанско-Британский Технический Университет10.55452/1998-6688-2025-22-3-75-84kaz29-2103Research ArticleКОМПЬЮТЕРНЫЕ НАУКИCOMPUTER SCIENCEСОВРЕМЕННЫЕ ПОДХОДЫ К УПРАВЛЕНИЮ КРИПТОГРАФИЧЕСКИМИ КЛЮЧАМИ И ПРИМЕНЕНИЮ ЦИФРОВОЙ ПОДПИСИMODERN APPROACHES TO CRYPTOGRAPHIC KEY MANAGEMENT AND APPLICATION OF DIGITAL SIGNATUREhttps://orcid.org/0000-0001-9743-9981КапаловаН. А.KapalovaN.

к.т.н., ассоциированный профессор

г. Алматы 

Cand.Tech.Sc., Associate Professor

Almaty

nkapalova@mail.ruhttps://orcid.org/0000-0002-6557-3067АбишеваА. Ж.AbishevaA.

докторант

г. Алматы 

PhD student

Almaty

ak_maral@mail.ruИнститут информационных и вычислительных технологий КН МНВО РККазахстанInstitute of Information and Computational Technologies CS MSHE RKKazakhstanКазахский национальный университет им. аль-ФарабиРоссияAl-Farabi Kazakh National UniversityRussian Federation2025270920252237584Copyright © Капалова Н.А., Абишева А.Ж., 20252025Капалова Н.А., Абишева А.Ж.Kapalova N., Abisheva A.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://vestnik.kbtu.edu.kz/jour/article/view/2103

В данной работе рассматривается проблема управления криптографическими ключами и подчеркивается важность разработки эффективных протоколов, обеспечивающих безопасность и аутентичность обмена ключами между участниками криптографической системы. В качестве одного из результативных и практичных методов проверки подлинности подписи рассматривается схема Шнорра, обладающая свойствами, такими как целостность, невозможность отказа от подписи и защита от повторной передачи сообщений. Также описана модификация данной схемы и процесс формирования непозиционной полиномиальной системы счисления, а также вычисление значений с использованием выбранных оснований. Применение непозиционной полиномиальной системы счисления при разработке нетрадиционных алгоритмов для электронной цифровой подписи и управления ключами в криптографических системах может существенно повысить их надежность и эффективность. Кроме того, рассматривается возможность повышения устойчивости предложенной схемы к квантовым атакам.

This paper explores the challenges associated with cryptographic key management and highlights the importance of developing efficient protocols to ensure secure and trustworthy key exchange in cryptographic systems. It focuses on the Schnorr digital signature scheme, recognized for its features such as indivisibility, non-repudiation, and resistance to message replay attacks. The study introduces a modified version of the Schnorr scheme, incorporating a non-positional polynomial number system. It outlines the process of generating random numbers for keys and computing necessary values using selected polynomial bases. The implementation of non-positional polynomial number system in the creation of non-traditional digital signature algorithms and key management mechanisms significantly improves both the reliability and performance of cryptographic operations. Furthermore, the paper discusses the potential for adapting the proposed scheme to enhance resistance against quantum computing threats, contributing to the development of quantum-resilient cryptographic solutions.

криптографияуправление криптографическими ключаминепозиционные полиномиальные системы счисленияцифровая подписьсхема Шнорраcryptographycryptographic key managementnon-positional polynomial number systemsdigital signatureSchnorr schemeДанная работа написана в рамках проекта BR24993052 «Разработка и исследование криптографических алгоритмов для защиты информации в системах с ограниченными ресурсами и оценка их стойкости».ReferencesFomina, I.A. Key management in cryptographic systems. Bulletin of the Nizhny Novgorod University named after N.I.Lobachevsky, 4(1),165–169 (2010).Fomina, I.A. Key management in cryptographic systems. Bulletin of the Nizhny Novgorod University named after N.I.Lobachevsky, 4(1),165–169 (2010).Moise, G., Gangea, O. Intelligent Management of the Cryptographic Keys. Int. J. of Computers, Communications & Control, 4(1), 150–157 (2011).Moise, G., Gangea, O. Intelligent Management of the Cryptographic Keys. Int. J. of Computers, Communications & Control, 4(1), 150–157 (2011).Adams, C., & Farrell, S. Internet X.509 Public Key Infrastructure Certificate Management Protocols. RFC 2510. (1999). https://tools.ietf.org/html/rfc2510.Adams, C., & Farrell, S. Internet X.509 Public Key Infrastructure Certificate Management Protocols. RFC 2510. (1999). https://tools.ietf.org/html/rfc2510.Housley, R., Polk, W., Ford, W., & Solo, D. Internet X.509 Public Key Infrastructure Certificate and CRL Profile. RFC 3280. (2002). https://tools.ietf.org/html/rfc3280.Housley, R., Polk, W., Ford, W., & Solo, D. Internet X.509 Public Key Infrastructure Certificate and CRL Profile. RFC 3280. (2002). https://tools.ietf.org/html/rfc3280.Chokhani, S., & Ford, W. Internet Public Key Infrastructure Certificate Policy and Certification Practices Framework. RFC 2527. (1995). https://tools.ietf.org/html/rfc2527.Chokhani, S., & Ford, W. Internet Public Key Infrastructure Certificate Policy and Certification Practices Framework. RFC 2527. (1995). https://tools.ietf.org/html/rfc2527.Aristarkhov, I.V. Management of certificates of electronic signature verification keys. Diss. cand. Of Technical Sciences. 2012 MoscowAristarkhov, I.V. Management of certificates of electronic signature verification keys. Diss. cand. Of Technical Sciences. 2012 MoscowSinev, V.E. Methods of construction and development of practical group signature protocols and algebraic algorithms for protective transformations. Diss. cand. of Technical Sciences. St. Petersburg, 2017, 166 p.Sinev, V.E. Methods of construction and development of practical group signature protocols and algebraic algorithms for protective transformations. Diss. cand. of Technical Sciences. St. Petersburg, 2017, 166 p.Moldovyan, N.A., Moldovyan, A.A. Introduction to public key cryptosystems. Tutorial. St. Petersburg. "BHV-Petersburg", 2005Moldovyan, N.A., Moldovyan, A.A. Introduction to public key cryptosystems. Tutorial. St. Petersburg. "BHV-Petersburg", 2005Schnorr, C.P. Efficient Signature Generation by Smart Cards. J. Cryptology, 161–174 (1991).Schnorr, C.P. Efficient Signature Generation by Smart Cards. J. Cryptology, 161–174 (1991).Kolesnikov P.V. Schnorr scheme in cryptography. Computer systems and networks: collection of articles of the 59th scientific conference of postgraduates, master's students and students, Minsk, April 17–21, 2023. Belarusian State University of Informatics and Radioelectronics (Minsk, 2023), pp. 393–396.Kolesnikov P.V. Schnorr scheme in cryptography. Computer systems and networks: collection of articles of the 59th scientific conference of postgraduates, master's students and students, Minsk, April 17–21, 2023. Belarusian State University of Informatics and Radioelectronics (Minsk, 2023), pp. 393–396.Watrous, Jo. Zero-knowledge against quantum attacks. Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing. 296–305 (2008). https://doi.org/10.1145/1132516.1132560.Watrous, Jo. Zero-knowledge against quantum attacks. Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing. 296–305 (2008). https://doi.org/10.1145/1132516.1132560.Schnorr, C.P. Efficient identification and signatures for smart cards. Advances in cryptology – CRYPTO’89. Springer-Verlag LNCS, 435, 239–252 (1990).Schnorr, C.P. Efficient identification and signatures for smart cards. Advances in cryptology – CRYPTO’89. Springer-Verlag LNCS, 435, 239–252 (1990).Moldovyan, D.N., Moldovyan, N.A. A New Hard Problem over Non-Commutative Finite Groups for Cryptographic Protocols. Proceedings of the international conference MMM-ACNS 2010. I. Kotenko and V. Skormin (Eds.): MMM-ACNS 2010, LNCS. Springer, Heidelberg. V. 6258. P. 183–194.Moldovyan, D.N., Moldovyan, N.A. A New Hard Problem over Non-Commutative Finite Groups for Cryptographic Protocols. Proceedings of the international conference MMM-ACNS 2010. I. Kotenko and V. Skormin (Eds.): MMM-ACNS 2010, LNCS. Springer, Heidelberg. V. 6258. P. 183–194.Pointcheval, D., Stern, J. Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology, 13, 361–396 (2000).Pointcheval, D., Stern, J. Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology, 13, 361–396 (2000).Akushsky I. Ya., Yuditsky D.I. Machine arithmetic in residual classes. M.: Sov.radio, 1968. 439 p.Akushsky I. Ya., Yuditsky D.I. Machine arithmetic in residual classes. M.: Sov.radio, 1968. 439 p.Biyashev R.G. Development and research of methods for end-to-end increase of reliability in data exchange systems of distributed automated control systems: Dis. d. tech. sciences. M., 1985. 328 p.Biyashev R.G. Development and research of methods for end-to-end increase of reliability in data exchange systems of distributed automated control systems: Dis. d. tech. sciences. M., 1985. 328 p.Biyashev R.G., Kapalova N.A., Nysanbaeva S.E. Development and study of a modified DiffieHellman algorithm based on modular arithmetic. Actual problems of information technology security: Proc. III Int. scientific-practical. conf. Under the general editorship of O.N. Zhdanov, V.V. Zolotarev. Siberian State Aerospace University, Krasnoyarsk, September 9–11, 2009 (Krasnoyarsk, 2009), pp. 18–22.Biyashev R.G., Kapalova N.A., Nysanbaeva S.E. Development and study of a modified DiffieHellman algorithm based on modular arithmetic. Actual problems of information technology security: Proc. III Int. scientific-practical. conf. Under the general editorship of O.N. Zhdanov, V.V. Zolotarev. Siberian State Aerospace University, Krasnoyarsk, September 9–11, 2009 (Krasnoyarsk, 2009), pp. 18–22.

The authors declare that there are no conflicts of interest present.