Finite non-commutative associative algebras as carriers of hidden discrete logarithm problem

N. A. Moldovyan ; A. A. Moldovyan

Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematičeskoe modelirovanie i programmirovanie, Tome 12 (2019) no. 1, pp. 66-81

Résumé

The article introduces new finite algebras attractive as carriers of the discrete logarithm problem in a hidden group. In particular new $4$-dimensional and $6$-dimensional finite non-commutative algebras with associative multiplication operation and their properties are described. It is also proposed a general method for defining finite non-commutative associative algebras of arbitrary even dimension $m\ge 2$. Some of the considered algebras contain a global unit, but the other ones include no global unit element. In the last case the elements of the algebra are invertible locally relatively local bi-side units that act in the frame of some subsets of elements of algebra. For algebras of the last type there have been derived formulas describing the sets of the (right-side, left-side, and bi-side) local units. Algebras containing a large set of the global single-side (left-side and right-side) units and no global bi-side unit are also introduced. Since the known form of defining the hidden discrete logarithm problem uses invertibility of the elements of algebra relatively global unit, there are introduced new forms of defining this computationally difficult problem. The results of the article can be applied for designing public-key cryptographic algorithms and protocols, including the post-quantum ones. For the first time it is proposed a digital signature scheme based on the hidden discrete logarithm problem.

Détail

Keywords: finite associative algebra, non-commutative algebra, global unit, left-side units, local unit, local invertibility, discrete logarithm problem, public-key cryptoscheme, digital signature, post-quantum cryptography.

Bibliographie

[1] Sirwan A., Majeed N., “New Algorithm for Wireless Network Communication Security”, International Journal on Cryptography and Information Security, 6:3 (2016), 1–8

[2] Yiteng Feng, Guomin Yang, Joseph K. Liu, “A New Public Remote Integrity Checking Scheme with User and Data Privacy”, International Journal of Applied Cryptography, 3:3 (2017), 196–209 | DOI | MR | Zbl

[3] Chiou S. Y., “Novel Digital Signature Schemes Based on Factoring and Discrete Logarithms”, International Journal of Security and Its Applications, 10:3 (2016), 295–310 | DOI

[4] Yan S. Y., Quantum Computational Number Theory, Springer, N.Y., 2015 | DOI | MR | Zbl

[5] Yan S. Y., Quantum Attacks on Public-Key Cryptosystems, Springer, N.Y., 2014

[6] PQCrypto 2016 (Fukuoka, Japan, February 24–26, 2016), Springer, 2016

[7] Post-Quantum Cryptography, 9th International Conference, PQCrypto 2018 (Fort Lauderdale, FL, USA, April 9–11, 2018), Springer, 2018

[8] Hiranvanichakorn P., “Provably Authenticated Group Key Agreement based on Braid Groups. The Dynamic Case”, International Journal of Network Security, 19:4 (2017), 517–527

[9] Verma G. K., “Probable Security Proof of a Blind Signature Scheme over Braid Groups”, International Journal of Network Security, 1:2 (2011), 118–120

[10] Myasnikov A., Shpilrain V., Ushakov A., “A Practical Attack on a Braid Group Based Cryptographic Protocol”, Advances in Cryptology – CRYPTO'05, Lecture Notes in Computer Science, 3621, Springer, 2005, 86–96 | DOI | MR | Zbl

[11] Moldovyan D. N., Moldovyan N. A., “A New Hard Problem over Non-Commutative Finite Groups for Cryptographic Protocols”, MMM-ANCS 2010 Proceedings, 5th Int. Conference on Mathematical Methods, Models, and Architectures for Computer Network Security, Lecture Notes in Computer Science, 6258, Springer, 2010, 183–194 | DOI | MR

[12] Sakalauskas E., Tvarijonas P., Raulynaitis A., “Key Agreement Protocol Using Conjugacy and Discrete Logarithm Problems in Group Representation Level”, Informatica, 18:1 (2007), 115–124 | MR | Zbl

[13] Moldovyan D. N., “Non-Commutative Finite Groups as Primitive of Public-Key Cryptoschemes”, Quasigroups and Related Systems, 18:2 (2010), 165–176 | MR | Zbl

[14] Moldovyan D. N., Moldovyan N. A., “Cryptoschemes Over Hidden Conjugacy Search Problem and Attacks Using Homomorphisms”, Quasigroups Related Systems, 18:2 (2010), 177–186 | MR | Zbl

[15] Kuzmin A. S., Markov V. T., Mikhalev A. A., Mikhalev A. V., Nechaev A. A., “Cryptographic Algorithms on Groups and Algebras”, Journal of Mathematical Sciences, 223:5 (2017), 629–641 | DOI | MR | Zbl

[16] Moldovyan A. A., Moldovyan N. A., Shcherbacov V. A., “Non-Commutative Finite Associative Algebras of 2-Dimension Vectors”, Computer Science Journal of Moldova, 25:3 (2017), 344–356 | MR | Zbl

[17] Moldovyan D. N., Moldovyan N. A., Shcherbacov V. A., “Non-Commutative Finite Associative Algebras of 3-Dimensional Vectors”, Quasigroups and Related Systems, 26:1 (2018), 109–120 | MR | Zbl

[18] Moldovyan N. A., Moldovyan P. A., “Vector Form of the Finite Fields $GF(p^m)$”, Bulletinul Academiei de stiinte a Republicii Moldova. Matematica, 2009, no. 3, 57–63 | MR | Zbl

[19] Schnorr C. P., “Efficient Signature Generation by Smart Cards”, Journal of Cryptology, 4 (1991), 161–174 | DOI | MR | Zbl