A novel randomized one-dimensional chaotic Chebyshev mapping for chosen plaintext attack secure image encryption with a novel chaotic breadth first traversal

We construct a novel randomized chaotic image encryption algorithm based on the one-dimensional chaotic Chebyshev mappings. We first define a novel chaotic breadth-first search algorithm and then use it to apply the permutation to image pixels. We also use a novel approach to construct the diffusion matrix using a chaotic sequence. Using a one-dimensional chaotic mapping in constructing image encryption algorithm has the advantage of lower computational and space complexities compared to hyper-chaotic encryption schemes. Moreover, our design favors brute-force search attack resistance because of a sufficiently large key space, as well as providing CPA-security and robustness against noise and data loss scenarios. Finally, the security performance of our proposed method is investigated against statistical analysis, key-sensitivity analysis, and differential attack analysis which shows acceptable security.