Over the last few years, security becomes more important in any communication system. Several techniques have been implemented to transfer information in a secure way. One of the most important encryption techniques used in security is encryption based on a chaotic system. In this paper, a security chaotic algorithm has been proposed, studied and implemented for encrypting a text message. This work based on using two levels of one-dimensional chaotic maps (logistic map) with different initial conditions. In the experimental process, the original text on the receiver side was decrypted correctly 100% (without any error). The key space measured by this system was (16×1064) which is greater than the minimum key space value necessary to resist any brute-force attack. Also another analysis has been studied in this paper proved that the time plays a very important limitation in the encryption. The time effect on the attacker during its attempts to obtain the original text was very large and it could not get the text in the real or nearly the real-time.

No abstract