Investigating the Feasibility of Elementary Cellular Automata based Scrambling for Image Encryption

This research investigates the performance of various one-dimensional cellular automata rules, namely Rule 30, Rule 150, Rule 184, Rule 105 and Rule 110, for image encryption. The proposed algorithm technique combines these CA rules to generate pseudo-random sequences for image scrambling. The effectiveness of the proposed method is evaluated using various performance metrics, including NPCR, correlation coefficient and information entropy. The results demonstrate which rule provides the best encryption performance, achieving high levels of security and resistance to statistical attacks. However, the computational complexity of the proposed method is relatively high, which may limit its practicality for real-time image encryption applications.