РОЗРОБКА МЕТОДИКИ ВИПРОБУВАНЬ БІБЛІОТЕКИ КРИПТОГРАФІЧНИХ ПЕРЕТВОРЮВАНЬ НА ПРИКЛАДІ КРИПТОСИСТЕМИ MST3 НА ОСНОВІ УЗАГАЛЬНЕНИХ СУЗУКІ 2-ГРУП

Authors

DOI:

https://doi.org/10.28925/2663-4023.2023.22.113121

Abstract

The article proposes a methodology for testing a library of cryptographic transformations with the implementation of an improved encryption scheme on generalized Suzuki 2-groups in the MST3 cryptosystem. The need to improve existing methods of cryptosystem creation is driven by progress in quantum computer development, which possess sufficient computational power to compromise many existing public key cryptosystems. This is especially true for systems based on factorization and discrete logarithm, such as RSA and ECC. Over the last nearly 20 years, there have been proposals for using non-commutative groups to develop quantum-resistant cryptosystems. The unsolved word problem, formulated by Wagner and Magyarik, uses permutation groups and is a promising direction in cryptosystem development. Magliveras proposed logarithmic signatures, a special type of factorization applied to finite groups, and the latest version of this technology is known as MST3, based on the Suzuki group. The first implementation of the cryptosystem on the generalized Suzuki 2-group had limitations in encryption and protection against brute force attacks. Over the past years, many proposals have been made to improve the basic design. The research conducted by the authors expanded the possibilities of using public cryptography by refining parameters based on non-Abelian groups. The article demonstrates the methodology for conducting tests of the practical implementation of the library of cryptographic transformations with the implementation of an improved encryption scheme on Suzuki 2-groups, confirming its functionality.

Keywords: logarithmic signature, covers, MST3 cryptosystem, generalized Suzuki-2 groups, encryption scheme.

Downloads

Download data is not yet available.

References

Shor, P. (1999). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM, 41(2), 303–332.

Nguyen, P. (2009). Recent Trends in Cryptography. Contemporary Mathematics, 477, 883–887.

Magliveras, S. Oberg, B., & Surkan, A. (1984). A new random number generator from permutation groups. Physico-mathematical Milan symposium, 203–223.

Magliveras, S., & Memon, N. (1992). Algebraic properties of cryptosystem PGM. Journal of Cryptology, 167–183.

Staszewski, R., & Trung, T. (2018). Strongly aperiodic logarithmic signatures, Essen: Duisburg-Essen.

Blackburn, S., Cid, C., & Mullan, C. (2009). Cryptanalysis of the MST3 public key cryptosystem. Journal of Mathematics and Cryptology, 321–338.

Magliveras, S., Trung, T., & Stinson, D. (2002). New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups. Journal of Cryptology, 285–297.

Svaba, P., & Trung, T. (2010). MST3 public key cryptosystem: cryptanalysis and implementation. Journal of Mathematics and Cryptology, 271–315.

Magliveras, et al. (2008). On the security of a realization of cryptosystem MST3. Mathematical publications Tatra Mountains, 1–13.

Baumeister, B., & Villiers de D. (2012). Aperiodic logarithmic signatures. J. Math. Cryptol. 6, 21–37.

Kotukh, Y., et al. (2021). Some results of development of cryptographic transformations schemes using non-abelian groups. Radio engineering, 204, 66–72.

Kotukh, Y., et al. (2021). Construction methods and properties of logarithmic signatures. Radio engineering, 205, 94–99. https://doi.org/10.30837/rt.2021.2.205.09

Kotukh, Y., Khalimov, G. (2021). Hard Problems for Non-abelian Group Cryptography. Fifth International Scientific and Technical Conference “Computer and Information systems and technologies”. https://doi.org/10.30837/csitic52021232176

Halimov, G., et al. (2018). Analysis of the complexity of cryptosystem implementations on the Suzuki group. Radio engineering, 193, 75–81.

Kotukh, Y., et al. Cryptoanalysis of systems based on the word problem using logarithmic signatures. Radio engineering, 206, 106–114. https://doi.org/10.30837/rt.2021.3.206.09

Kotukh, Y., Khalimov, G. (2022). Towards practical cryptoanalysis of systems based on word problems and logarithmic signatures. In Proceedings of II International Conference Information security: problems and prospects, 55–58

Magliveras, S., Stinson, D., & Trung van, T. (2002). New approaches to designing public key cryptosystems using one-way functions and trap-doors in finite groups. Journal of Cryptology, 15, 285297.

Khalimov, G., et al. (2021). Towards advance encryption based on a Generalized Suzuki 2-groups. International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME), 1–6. https://doi.org/10.1109/ICECCME52200.2021.9590932

Khalimov, G., Kotukh, Y., & Khalimova, S. (2020). MST3 Cryptosystem Based on a Generalized Suzuki 2-Groups. Copyright, 2711. http://ceur-ws.org/Vol-2711/paper1.pdf

Downloads


Abstract views: 93

Published

2023-12-28

How to Cite

Kotukh, Y., Marukhnenko, O., Khalimov, H., & Korobchynskyi, M. (2023). РОЗРОБКА МЕТОДИКИ ВИПРОБУВАНЬ БІБЛІОТЕКИ КРИПТОГРАФІЧНИХ ПЕРЕТВОРЮВАНЬ НА ПРИКЛАДІ КРИПТОСИСТЕМИ MST3 НА ОСНОВІ УЗАГАЛЬНЕНИХ СУЗУКІ 2-ГРУП. Electronic Professional Scientific Journal «Cybersecurity: Education, Science, Technique», 2(22), 113–121. https://doi.org/10.28925/2663-4023.2023.22.113121