WCSE

Faster cellular automata cryptosystems with neighbor sequences

Abstract— The encryption processes and cryptosystems are very important. We use them to protect our private information over the Internet. Cellular automata are ones of the computational models that can also be used in cryptosystems. The advantage of the cellular automata is their abilities to work in parallel, and thus can reduce the encryption time. Some applications require the encryption time to be small, so this paper aims to reduce the encryption time of the cellular automata cryptosystems. We propose a new technique to permit the cryptosystems to get the avalanche effect faster. This avalanche effect is one of the desired properties for cryptosystems. In the proposed technique, the new type of neighbor is defined, a sequence of neighbor tuples. We apply our technique to Seredynski and Bouvry’s work, and the results show that the number of iterations can be reduced up to three times. This makes our cellular automata cryptosystems run faster. The relationship between the size of the neighbor and the size of the cellular automata, and the effect of neighbor sequences to the hardware implementations are left for further studies.

Index Terms— cryptography, cellular automata, neighbor sequence.

Kittiphop Phalakarn, Athasit Surarerks
Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University, THAILAND

[Download]

Cite: Kittiphop Phalakarn, Athasit Surarerks, "Faster cellular automata cryptosystems with neighbor sequences," Proceedings of 2017 the 7th International Workshop on Computer Science and Engineering, pp. 945-949, Beijing, 25-27 June, 2017.