Hard Problems for Non-abelian Group Cryptography
DOI:
https://doi.org/10.30837/csitic52021232176Keywords:
intractable problems, search problem, conjugacy problem, non-abelian groups, Shor algorithmAbstract
The security of the DH key exchange protocol and many other public key cryptosystems such as RSA, ElGamal and ECC is based on the assumption that complex mathematical problems such as factorization (FP), discrete logarithm over finite fields (DLP), or elliptical curves (ECDLP) are intractable. The implementation of Shor and Grover's algorithms reduces the security of cryptosystems based on the intractability of these problems.
References
N. R. Wagner, M. R. Magyarik, “A public key cryptosystem based on the word problem,” in Advances in Cryptology (CRYPTO’84), Lecture Notes in Computer Science, vol. 196, pp. 19-36, 1985
Tzu-Chun Lin. “A Study of Non-Abelian Public Key Cryptography” International Journal of Network Security, Vol.20, No.2, PP.278-290, Mar. 2018
Haibo Hong1⋆, Jun Shao1, Licheng Wang2, Haseeb Ahmad2 and Yixian Yang “Public Key Encryption in Non-Abelian Groups” https://arxiv.org/abs/1605.06608v1
G. Khalimov, Y. Kotukh, S.Khalimova “MST3 cryptosystem based on the automorphism group of the hermitian function field'' // IEEE International Scientific-Practical Conference: Problems of Infocommunications Science and Technology, PIC S and T 2019 - Proceedings, 2019, pр. 865–868.
G. Khalimov, Y. Kotukh, S.Khalimova “MST3 cryptosystem based on a generalized Suzuki 2 - Groups'' // CEUR Workshop Proceedings, 2020, 2711, pр. 1–15.
G. Khalimov, Y. Kotukh, S.Khalimova “Encryption scheme based on the automorphism group of the Ree function field'' 2020 7th International Conference on Internet of Things: Systems, Management and Security, IOTSMS 2020, 2020, 9340192
