Abstract
Due to the large size of image files and the high correlation between the numerical values of the pixels, various improved algorithms have been used for image encryption in recent years. In most cases improvement is obtained by taking into account the characteristics of chaotic and random processes in encryption algorithms. In this study, an algorithm is proposed that encrypts images based on a maze created by keys consisting of random numbers generated with Feigembaum’s quadratic function. For the generation of the maze, deep first search (DFS) algorithm has been used. During the generation with this algorithm, numbers representing the walking paths and as well as the length of the used stack are included in the encryption process. Algorithm security verification was carried out according to key space and differential analysis, statistical analysis such as entropy estimation, and analysis of correlation between the histogram and neighboring pixels of the image.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Eurasian Journal of Mathematical and Computer Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
