A searching-based probabilistic cipher

In this paper we combine the determinism of the chaotic maps with stochastic components to propose a hybrid algorithm for cryptography. This makes the cipher probabilistic in the sense that each plain text corresponds to many distinct encoded texts, raising the security against known plain text attacks. In particular, the proposed cipher allows an efficient encryption even if a low entropy key is chosen. Also, the algorithm can be efficiently used as a 'many-times pad' cipher