Modelling of complex cryptographic systems in terms of simple cellular automata

Authors:
Amparo Fúster-Sabater;Pino Caballero-Gil;Maria Eugenia Pazo-Robles
Affiliations:
Instituto de Física Aplicada, C.S.I.C., Madrid, Spain;DEIOC, University of La Laguna, La Laguna, Tenerife, Spain;Instituto de Física Aplicada, C.S.I.C., Madrid, Spain
Venue:
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Year:
2006

Citing 5
Cited 0

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
The shrinking generator

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

Shift Register Sequences
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

In this work, it is shown that binary sequences generated by a class of linear cellular automata equal the output sequences of nonlinear sequence generators. Emphasis is on cryptographic characteristics of such sequences (period, linear complexity or number of different output sequences). These simple linear automata easily model complex nonlinear generators with application in secret key cryptography.