Cryptographic Properties of Second-Order Memory Elementary Cellular Automata

In this work the use of second-order memory elementary cellular automata in the design of symmetric-key block ciphers is studied. Specifically, their cryptographic properties are analyzed taking into account four tests that check the sensitivity to initial conditions and the differential cryptanalysis. It is shown that the second-order memory cellular automata (MECA for short) with better cryptographic properties are those defined by the rule numbers 75, 86, 89, 149, 166, 173 and 229.