Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations

Authors:
A. Fúster-Sabater;P. Caballero-Gil;O. Delgado
Affiliations:
Institute of Applied Physics, C.S.I.C., Madrid, Spain 28006;Faculty of Maths, D.E.I.O.C., University of La Laguna, Tenerife, Spain 38271;Institute of Applied Physics, C.S.I.C., Madrid, Spain 28006
Venue:
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Year:
2008

Citing 7
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Random sequence generation by cellular automata

Advances in Applied Mathematics
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
2-by-n$n$ Hybrid Cellular Automata with Regular Configuration: Theory and Application

IEEE Transactions on Computers
Theory of cellular automata: a survey

Theoretical Computer Science
Concatenated automata in cryptanalysis of stream ciphers

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

A cellular automata-based linear model that computes all the solutions of linear binary difference equations has been developed. Such a model is based on successive concatenations of a basic linear automaton. Different sequential solutions are obtained from different automaton initial states. Many of these solutions are binary sequences of cryptographic utility. In this way, a linear structure based on cellular automata realizes not only difference equation solutions but also generates sequences currently used in cryptography. The model is simple, linear and can be applied in a range of practical cryptographic applications.