A competitive searching-based chaotic cipher

In this paper we propose a high performance searching-based chaotic cipher. Experiments shows that its efficiency is comparable to the efficiencies of some widely used and known ciphers, namely, AES, RC4 and Sosemanuk. Also, its performance is better than some recently proposed chaotic ciphers of the same kind. The proposed cryptosystem shows independence with respect to the statistical characteristics of the plain texts, which prevents statistical attacks. The results of the tests suggest that this chaotic cipher can be competitive for practical usage.