On the Use of Linear Cellular Automata for the Synthesis of Cryptographic Sequences

  • A. Fúster-Sabater
  • P. Caballero-Gil
  • O. Delgado
Conference paper

DOI: 10.1007/978-3-540-87656-4_59

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5271)
Cite this paper as:
Fúster-Sabater A., Caballero-Gil P., Delgado O. (2008) On the Use of Linear Cellular Automata for the Synthesis of Cryptographic Sequences. In: Corchado E., Abraham A., Pedrycz W. (eds) Hybrid Artificial Intelligence Systems. HAIS 2008. Lecture Notes in Computer Science, vol 5271. Springer, Berlin, Heidelberg

Abstract

This work shows that a class of cryptographic sequences, the so-called interleaved sequences, can be generated by means of linear hybrid cellular automata. More precisely, linear multiplicative polynomial cellular automata generate all the components of this family of interleaved sequences. As an illustrative example, the linearization procedure of the self-shrinking generator is described. In this way, popular nonlinear sequence generators with cryptographic application are linearized in terms of simple cellular automata.

Keywords

interleaved sequence linear cellular automata self-shrinking generator cryptography 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • A. Fúster-Sabater
    • 1
  • P. Caballero-Gil
    • 2
  • O. Delgado
    • 1
  1. 1.Instituto de Física Aplicada, C.S.I.C.MadridSpain
  2. 2.DEIOCUniversity of La LagunaLa LagunaSpain

Personalised recommendations