Efficient application of hybrid 150/90 cellular automata to symmetric cryptography

Authors:
A. Fúster-Sabater;P. Caballero-Gil;M. E. Pazo-Robles
Affiliations:
Instituto de Física Aplicada, Madrid, Spain;DEIOC, University of La Laguna, La Laguna, Tenerife, Spain;Instituto de Física Aplicada, Madrid, Spain
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Year:
2006

Citing 4
Cited 0

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 a wide class of nonlinear sequence generators, the so called interleaved sequence generators, can be modelled in terms of linear cellular automata. A simple modelling procedure based on the concatenation of automata has been derived. The cryptographic characteristics of the generated sequences (period, linear complexity, number of different sequences) have been also analyzed. The technique is very simple and can be applied to generators in a range of practical applications.