2021/12/10 by Hossein Arabnezhad, Arabnezhad, Hossein, Babak Sadeghiyan +1
Computer Science · #94A60 #Cellular Automata and Applications #Chaos-based Image/Signal Encryption #Computability, Logic, AI Algorithms #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR #msc:94A60
paper · pdf · doi:10.48550/arxiv.2112.05429
11 pages, 10 Figures
arxiv created 2021/12/10 · openalex publication_date 2021/12/10 · arxiv updated 2021/12/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we study a block cipher based on cellular automata, proposed by Seredynski and Bouvry in \citesemabo04 against plain-text avalanche criteria and randomness tests. Our experiments shows that Seredynski-Bouvry encryption scheme does not pass some NIST statistical tests by neighborhood radius less than three. It also showed that if the CA rule is selected carelessly, it weaken the security of scheme. Therefor, the selection of CA-rule as part of key can not be left to the user. Hence, cryptographic properties such as balancedness and non-linearity should be considered in the selection of CA-rules. This approach is more compliant with Kerckhoffs principle. So security should depend just on security of final data. We also improve Seredynski-Bouvry encryption scheme to satisfy strict avalanche criteria and NIST statistical test suite in about half number of iterations comparing to original scheme. This improvement is achieved by change in the definition of neighborhood.