Abstract
In this paper considered a group of unitriangular matrices is vulnerable to an attack based on the efficient method of computation of an unknown exponentm in a matrix equality A = Bm(solution of the discrete logarithm problem) in a group of one-dimensional matrices. We show that the system of the polylinear crypto raptly using nilpotent groups proposed by Kahrobaei together with Italian associates A. Tortora and M. Tota proves vulnerable. This vulnerability is a result of the specific structure of unitriangular matrices, which can be exploited by attackers to efficiently compute the unknown exponent m. This opens up opportunities for attacking the system and compromising data security.Unitriangular matrices play an important role in cryptography, their use helps ensure system security and makes it a popular basis for cryptographic protocols such as Diffie-Hellman key exchange and digital signatures. In these protocols, system security is based on the assumption that it is computationally difficult to find a discrete algorithm of the elements involved. However, advacnes in computing power and algorithmic techniques have led to the development of more efficient algorithms for solving discrete logarithm problems using unitriangular matrices in certain groups, which poses a security threat to these protocols. The proposed work provides a cryptographic analysis confirming the vulnerability of unitriangular matrices