Perfect Secrecy System Based on Chaotic Key Generator

Abstract

Shannon defines perfect secrecy for a cryptographic system as such a cryptographic system in which the ciphertext yields no possible information about the plaintext. Diffie and Hellman suggest computationally secure cryptographic systems even if the intercepted data contains sufficient information to allow a unique solution to the cryptographic problems. In this paper, we present the new idea to cipher data called a perfect secrecy and its implementation based on the chaotic maps for generating a one-time random key used to encrypt data. The output ciphertext has been examined and shows perfect random properties.