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

Authors:
A. Fúster-Sabater;P. Caballero-Gil;O. Delgado
Affiliations:
Instituto de Física Aplicada, C.S.I.C., Madrid, Spain 28006;DEIOC, University of La Laguna, La Laguna, Spain 38271;Instituto de Física Aplicada, C.S.I.C., Madrid, Spain 28006
Venue:
HAIS '08 Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems
Year:
2008

Citing 7
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
The stop-and-go generator

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Shift Register Sequences

Shift Register Sequences
Theory of cellular automata: a survey

Theoretical Computer Science
Theory and applications of q-ary interleaved sequences

IEEE Transactions on Information Theory
Synthesis of one-dimensional linear hybrid cellular automata

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

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.