CONSTRUCTION OF AN IMPROVED ENCRYPTION SCHEME ON GENERALIZED SUZUKI 2-GROUPS IN THE MST3 CRYPTOSYSTEM
DOI:
https://doi.org/10.28925/2663-4023.2023.22.1930Keywords:
логарифмічний підпис; покриття; криптосистема MST3, узагальнені Сузукі-2 групи; схема шифруванняAbstract
This paper proposes a method for constructing an improved encryption scheme on generalized Suzuki 2-groups for the MST3 cryptosystem, which improves the security parameters of the original approach.
The challenge of improving existing cryptosystem design approaches is driven by advances in building quantum computers with sufficient computing power to render many public-key cryptosystems insecure. In particular, this includes cryptosystems based on the factorization problem or the discrete logarithm problem, such as RSA and ECC. There have been several proposals in the past two decades for using non-commutative groups to create quantum-resistant cryptosystems. The unsolvable word problem is a promising area of research for building cryptosystems. It was formulated by Wagner and Magyarik and lies in the realm of permutation groups. Magliveras proposed logarithmic signatures, which are a special type of factorization that applies to finite groups. The latest version of this implementation, known as MST3, is based on the Suzuki group. In 2008, Magliveras demonstrated a transitive LS limit for the MST3 cryptosystem. Later, Svaba proposed the eMST3 cryptosystem with improved security parameters, achieved by adding a secret homomorphic cover. In 2018, T. van Trung proposed an MST3 approach using strong aperiodic logarithmic signatures for abelian p-groups. Kong and his colleagues conducted an extensive analysis of MST3 and noted that, since there are currently no publications on the quantum vulnerability of the algorithm, it can be considered a candidate for use in the post-quantum era. The first implementation of the cryptosystem on the generalized Suzuki 2-group does not provide encryption of the entire Suzuki 2-group and does not protect against attacks with sequential key recovery by the brute-force method. Further work has developed the idea of public cryptography using non-Abelian refinements of parameters. This paper proposes a method for constructing an encryption scheme on Suzuki 2-groups that improves the security parameters of the existing MST3 cryptosystem and solves its security problems.
Downloads
References
Ko, K., et al. (2000). New public-key cryptosystem using braid groups. Springer, 166–183.
Eick, B., & Kahrobaei, D. (2004). Polycyclic groups: a new platform for cryptology? arXiv.org. http://arxiv.org/abs/math/0411077
Shpilrain, V., & Ushakov, A. (2005). Thompsons group and public key cryptography. Applied Cryptography and Network Security, 3531, 151–164.
Kahrobaei, D., Koupparis, C., & Shpilrain, V. (2013). Public key exchange using matrices over group rings. Groups, Complexity, and Cryptology, 5(1), 97–115.
Magliveras, S., (1986). A cryptosystem from logarithmic signatures of finite groups. Proceedings of the 29th Midwest Symposium on Circuits and Systems, 972–975.
Wagner, N., & Magyarik, M., (1985). A public-key cryptosystem based on the word problem. Proc. Advances in Cryptology, Springer-Verlag, 19–36.
Khalimov, G., et al. (2021). Towards three-parameter group encryption scheme for MST3 cryptosystem improvement. 2021 Fifth World Conference on Smart Trends in Systems Security and Sustainability (WorldS4), 204–211. https://doi.org/10.1109/WorldS451998.2021.9514009
Khalimov, G., et al. (2021). Towards advance encryption based on a Generalized Suzuki 2-groups. 2021 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME), 1–6. https://doi.org/10.1109/ICECCME52200.2021.9590932
Van Trung, T., (2001). New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups. J. Cryptol., 15(4), 285–297.
Lempken, W., et al., (2009). A public key cryptosystem based on non-abelian finite groups. J. of Cryptology, 22, 62–74.
Magliveras, S., et al. (2008). On the security of a realization of cryptosystem MST3. Tatra Mt Math Publ, 41, 1–13.
Svaba, P., & Van Trung, T., (2010). Public key cryptosystem MST3 cryptanalysis and realization. J. of Math.Cryptol., 4(3), 271–315.
Van Trung, T., (2018). Construction of strongly aperiodic logarithmic signatures. J. Math. Cryptol., 12(1), 23–35.
Cong, Y., et al. (2019). A New Secure Encryption Scheme Based on Group Factorization Problem. IEEExplore. https://doi.org/10.1109/ACCESS.2019.2954672
Magliveras, S., (2002). New approaches to designing public key cryptosystems using one-way functions and trap-doors in finite groups. J. of Cryptol., 15, 285–297.
Lempken, W., (2009). A public key cryptosystem based on non-abelian finite groups. J. of Cryptol., 22(1), 62–74.
Khalimov, G., Kotukh, Y., Khalimova, S., (2020). MST3 Cryptosystem Based on a Generalized Suzuki 2-Groups. http://ceur-ws.org/Vol-2711/paper1.pdf
Khalimov, G., et al. (2020). Encryption Scheme Based on the Automorphism Group of the Suzuki Function Field. 2020 IEEE PIC S&T, 383–387. https://doi.org/10.1109/PICST51311.2020.9468089
Khalimov, G., et al. (2022). Encryption Scheme Based on the Generalized Suzuki 2-groups and Homomorphic Encryption. Silicon Valley Cybersecurity Conference, 1536, 59–76. https://doi.org/10.1007/978-3-030-96057-5_5
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Євген Котух, Геннадій Халімов, Максим Коробчинський
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
