|Communications on Applied Electronics|
|Foundation of Computer Science (FCS), NY, USA|
|Volume 7 - Number 8|
|Year of Publication: 2017|
|Authors: Richard P. Megrelishvili|
Richard P. Megrelishvili . Two New Versions of Numbers Fast Multiplication and Tropical Cryptography. Communications on Applied Electronics. 7, 8 ( Oct 2017), 12-15. DOI=10.5120/cae2017652699
This article discusses the rapid multiplication of two numbers. But first considered  the work that created the foundation of . In this article  is took into consideration and used the fact that the leading countries in cryptography used the ElGamal algorithmic method (Digital Signature). This method is used, just like in an algorithm, for performing certain actions in a certain period of time. Our new one-way matrix function  is a protected algorithm that meets the known qualities of asymmetric cryptography, i.e. it is not directly related of Number Theory to the exponential functions of ax = y (mod p) and Euler's Theorem. That is why it  (2013) is distinguished with high speed, i.e. connected to of vector and of matrix multiplication operations with simplicity (This article also discusses protection issues of algorithm). Naturally, the question is: do use more Diffie-Hellman algorithm (as well as the RSA algorithm) for the same period of time? This important fast realizing is considered in the present article. Get a new results multiplication of numbers in high speed with module considering. It is when the two vectors (as two numbers) are multiplied to each other.