A NEW CHAOTIC CRYPTOGRAPHY BASED ON ERGODICITY

This paper analyzes the encryption and weaknesses of E. Alvarez cryptography. On the basis of this, a new chaotic cryptography based on ergodicity is presented. The control parameter and the initial condition of the chaotic system are chosen as a secret key. A bit chain is generated by iterating the chaotic map, and the location where a plaintext grouping appears in the chain is found. We then write down the number of iterations of the chaotic map as the ciphertext grouping. Several weaknesses of the E. Alvarez cryptography are avoided in the new scheme, and the security of the new scheme is improved. In the end, the new cryptography is studied experimentally using the Logistic map, where the new cryptography's confusion and diffusion is validated, and its effectiveness is also illuminated.