Acta Applicandae Mathematica

, Volume 93, Issue 1, pp 215–236

On the Use of Cellular Automata in Symmetric Cryptography


DOI: 10.1007/s10440-006-9041-6

Cite this article as:
Fúster-Sabater, A. & Caballero-Gil, P. Acta Appl Math (2006) 93: 215. doi:10.1007/s10440-006-9041-6


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.

Mathematics Subject Classifications (2000)

11T71 14G50 94A60 40B05 

Key words

automata finite fields cryptography sequence generator 

Copyright information

© Springer Science + Business Media B.V. 2006

Authors and Affiliations

  1. 1.Instituto de Física Aplicada, C.S.I.C.MadridSpain
  2. 2.DEIOC, University of La LagunaLa Laguna, TenerifeSpain

Personalised recommendations