PERFECT SECRECY SYSTEM BASED ON CHAOTIC KEY GENERATOR

Abstract

Shannon defines perfect secrecy for a cryptographic system as such a cryptographic system in whichthe ciphertext yields no possible information about the plaintext. Diffie and Hellman suggest computationally securecryptographic systems even if the intercepted data contains sufficient information to allow a unique solution to thecryptographic problems. In this paper, we present a new idea to cipher data with a perfect secrecy properties basedon the chaotic maps for generating a one-time random key used to encrypt text data. The output of ciphertextprocess has been examined and shows perfect random properties, ideal performance and throughput comparedwith block cipher systems.