Key Exchange by Synchronization of two Chaotic Systems

Abstract

In this paper, the idea of synchronization of two chaotic systems is used to solve the key exchange problem in cryptography. A proposal for a protocol is given and it is claimed that this method is simple and secure against known attack with the proof that the underlying chaotic systems model is a very hard problem to be solved, unlike the discrete logarithmic problem and other problems currently being used for key exchange which are only believed to be hard