Generating pseudo-random sequences from cellular automata and bent functions

Authors:
Francisco J. García;Verónica Requena;Virtudes Tomás
Affiliations:
Departament de Fonaments de l'Anàlisis Econòmica, Universitat d'Alacant, Alacant, Spain;Departament de Ciència de la Computació i Intelligència Artificial, Universitat d'Alacant, Alacant, Spain;Departament de Ciència de la Computació i Intelligència Artificial, Universitat d'Alacant, Alacant, Spain
Venue:
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
Year:
2007

Citing 5
Cited 0

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Nonlinearity and propagation characteristics of balanced Boolean functions

Information and Computation
Computation in artificially evolved, non-uniform cellular automata

Theoretical Computer Science - Special issue: cellular automata
A brief history of cellular automata

ACM Computing Surveys (CSUR)
A new kind of science

A new kind of science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we construct three different pseudo-random sequence generators based on cellular automata where their local transition functions are constructed from bent functions.