[1] Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on quantum computer. SIAM J. Comput. 26, 1484–1509 (2017)

[2] Smolin, J.A., Smith, G., Vargo, A.: Oversimplifying quantum factoring. Nature 499(7457), 163–165 (2013)

[3] Moldovyan, A.A., Moldovyan, N.A.: Post-quantum signature algorithms based on the hidden discrete logarithm problem. Comput. Sci. J. Moldova 26(3(78)), 301–313 (2018)

[4] Moldovyan, D., Moldovyan, A., Moldovyan, N.: A new concept for designing post-quantum digital signature algorithms on non-commutative algebras. Voprosy kiberbezopasnosti 1(47), 18–25 (2022). https://doi.org/10.21681/2311-3456-2022-1-18-25

[5] Shuaiting, Q., Wenbao, H., Yifa, L., Luyao, J.: Construction of extended multivariate public key cryptosystems. Int. J. Netw. Secur. 18(1), 60–67 (2016)

[6] Jintai, D., Dieter, S.: Multivariable Public Key Cryptosystems. https://eprint.iacr.org/2004/350.pdf (2004). Accessed 30 June 2022

[7] Moldovyan, D.N.: A practical digital signature scheme based on the hidden logarithm problem. Comput. Sci. J. Moldova 29(2(86)), 206–226 (2021)

[8] Moldovyan, N.A., Moldovyan, A.A.: Digital signature scheme on the 2×2 matrix algebra. Vestnik of Saint Petersburg Univ., Appl. Math. Comput. Sci. Control Processes 17(3), 254–261 (2021)

[9] Moldovyan, N.A., Moldovyan, A.A.: Finite non-commutative associative algebras as carriers of hidden discrete logarithm problem. In: Bulletin of the South Ural State University. Ser. Mathematical Modelling, Programming & Computer Software (Bulletin SUSU MMCS), vol. 12, no. 1, pp. 66–81 (2019)

[10] Moldovyan, N.A., Moldovyan, A.A.: Candidate for practical post-quantum signature scheme. Vestnik of Saint Petersburg Univ., Appl. Math. Comput. Sci. Control Processes 16(4), 455–461 (2020)

[11] Moldovyan, N.A., Abrosimov, I.K.: Post-quantum electronic digital signature scheme based on the enhanced form of the hidden discrete logarithm problem. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes 15(2), 212–220 (2019). https://doi.org/10.21638/11702/spbu10.2019.205

[12] Moldovyan, N.A.: Signature schemes on algebras, satisfying enhanced criterion of post-quantum security. Bull. Acad. Sci. Moldova, Math. 2(93), 62–67 (2020)

[13] Moldovyan, N.A.: Unified method for defining finite associative algebras of arbitrary even dimensions. Quasigroups Relat. Syst. 26(2), 263–270 (2018)

[14] Moldovyan, N.A., Moldovyanu, P.A.: New primitives for digital signature algorithms. Quasigroups Relat. Syst. 17(2), 271–282 (2009)

[15] Moldovyan, N.A.: Fast signatures based on non-cyclic finite groups. Quasigroups Relat. Syst. 18(1), 83–94 (2010)

[16] Crandall, R., Pomerance, C.: Prime Numbers - A Computational Perspective. Springer, New York (2002)

[17] Ding, J., Schmidt, D.: Rainbow, a new multivariable polynomial signature scheme. In: Ioannidis, J., Keromytis, A., Yung, M. (eds.) ACNS 2005. LNCS, vol. 3531, pp. 164–175. Springer, Heidelberg (2005). https://doi.org/10.1007/11496137_12

[18] Rainbow Signature: One of three NIST post-quantum signature finalists. https://www.pqcrainbow.org/,(2021). Accessed 30 June 2022