On the Use of Cellular Automata in Symmetric Cryptography

In this work, pseudorandom sequence generators based on finite fields have been analyzed from the point of view of their cryptographic application. In fact, a class of nonlinear sequence generators has been modelled in terms of linear cellular automata. The algorithm that converts the given generator into a linear model based on automata is very simple and is based on the concatenation of a basic structure. Once the generator has been linearized, a cryptanalytic attack that exploits the weaknesses of such a model has been developed. Linear cellular structures easily model sequence generators with application in stream cipher cryptography.

[1]  Douglas R. Stinson,et al.  Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.

[2]  S. Wolfram Random sequence generation by cellular automata , 1986 .

[3]  Marco Tomassini,et al.  Cryptography with cellular automata , 2001, Appl. Soft Comput..

[4]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[5]  Jovan Dj. Golic,et al.  A Cryptanalysis of Clock-Controlled Shift Registers with Multiple Steps , 1995, Cryptography: Policy and Algorithms.

[6]  Kenneth G. Paterson,et al.  Comments on "Theory and Applications of Cellular Automata in Cryptography" , 1997, IEEE Trans. Computers.

[7]  Jon C. Muzio,et al.  Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q) , 1996, IEEE Trans. Computers.

[8]  Carlos Eduardo Pedreira,et al.  An Architecture for Computing Zech's Logarithms in GF(2m) , 2000, IEEE Trans. Computers.

[9]  Ali Kanso Clock-Controlled Shrinking Generator of Feedback Shift Registers , 2003, ACISP.

[10]  D. Michael Miller,et al.  Quantitative analysis for linear hybrid cellular automata and LFSR as built-in self-test generators for sequential faults , 1995, J. Electron. Test..

[11]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[12]  Shujian Zhang,et al.  Minimal cost one-dimensional linear hybrid cellular automata of degree through 500 , 1995, J. Electron. Test..

[13]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[14]  A. Odlyzko,et al.  Algebraic properties of cellular automata , 1984 .

[15]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[16]  Caroline Fontaine,et al.  Shrinking Generator , 2005, Encyclopedia of Cryptography and Security.

[17]  Edwin L. Key,et al.  An analysis of the structure and complexity of nonlinear binary sequence generators , 1976, IEEE Trans. Inf. Theory.

[18]  Guang Gong,et al.  Theory and applications of q-ary interleaved sequences , 1995, IEEE Trans. Inf. Theory.

[19]  D. Michael Miller,et al.  The analysis of one-dimensional linear cellular automata and their aliasing properties , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  Un-Sook Choi,et al.  Computing Phase Shifts of Maximum-Length 90/150 Cellular Automata Sequences , 2004, ACRI.

[21]  Fred Piper,et al.  Stream Ciphers , 1982, EUROCRYPT.

[22]  Jon C. Muzio,et al.  The concatenation and partitioning of linear finite state machines , 1995 .

[23]  Leonie Ruth Simpson,et al.  A Probabilistic Correlation Attack on the Shrinking Generator , 1998, ACISP.

[24]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

[25]  Feng Bao,et al.  Cryptanalysis of a New Cellular Automata Cryptosystem , 2003, ACISP.

[26]  P. Pal Chaudhuri,et al.  Efficient characterisation of cellular automata , 1990 .

[27]  Parimal Pal Chaudhuri,et al.  Theory and Applications of Cellular Automata in Cryptography , 1994, IEEE Trans. Computers.

[28]  Jon C. Muzio,et al.  Synthesis of one-dimensional linear hybrid cellular automata , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[29]  Thomas Johansson Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators , 1998, ASIACRYPT.

[30]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[31]  H. Stone Discrete Mathematical Structures and Their Applications , 1973 .