On the Improvement of Neural Key Exchange

Abstract

Key exchange is one of the major concerns in cryptography. Many protocols are proposed since the seminal paper of Diffie-Hellman which introduced the concept of the public key. While many of the protocols are proven to be secure, one of the major drawback is it depends on a computationally intensive mathematical problems like modular exponentiation and discrete logarithm. While these algorithms are systematic, dealing with long keys is not an easy task. The long key used in public key cryptography is a must in order to prevent exhaustive search and force the attacker to attempt solving the hard mathematical problem.If these algorithms are required to be implemented as software programs, the developer should create an algorithm to deal with slice of the key or plaintext with the maximum data length that the processor supports but this is very time consuming. It can also be developed on FPGAs or ASIC chips to exploit the parallel nature of these devices. However, the cryptographic keys are really very long and there is no FPGA or ASIC that can support doing mathematical computations on it and even this requires dealing with slices of key but with larger size than that is supported by processors.