New asymmetric algorithm for fast message transmission and tropical cryptography

Abstract

In this article we, in the literal sense, announced about the new fast numbers multiplication. With respect to the issue of relevance, we repeat, that the main advantage of the matrix one-way function is high speed operations [1]. The maximum speed is achieved with the direct multiplication of numbers [2]. As a result of ElGamal's algorithm (1985), the leading countries were able to create their state standards for digital signatures in the cryptography. But ElGamal himself, when creating his system of direction in cryptography (1985), is based on the well-known Diffie-Hellman algorithm for the purpose of establishing a connection between the transmitting and receiving parties for a certain period of time. Similarly, we arrive in this article as in scientific works [1,2]. Similarly to ElGamal, we used Diffie-Hellman once (At a certain time period) [1] and twice in this article (In the same period of time). The results their applications may be named as "Tropical Cryptography"[3]. But at the same time, regardless of the general algebraic values Tropical Cryptography, it is fact, that the construction of multiplicative groups, based on the our tropical operations, may be accepted as an integral part of the realization of the one-way function. Therefore, its adoption and an implementation can be associated with its recognition.