IJPAM: Volume 4, No. 1 (2003)

WOLFRAM CELLULAR AUTOMATA AND THEIR
CRYPTOGRAPHIC USE AS PSEUDORANDOM
BIT GENERATORS

R. Díaz Len$^1$, A. Hernández Encinas$^2$, L. Hernández Encinas$^3$
S. Hoya White$^4$, A. Martín del Rey$^5$, G. Rodríguez Sánchez$^6$
I. Visus Ruíz$^7$
$^1$Departamento Matemática Aplicada, E.P.S.
Universidad de Salamanca
C/ Santo Tomás s/n, 05003-Ávila, SPAIN
e-mail: rauldlen@usal.es
$^{2,4,5,6,7}$Departamento Matemática Aplicada, E.T.S.I.I.
Universidad de Salamanca
Avd. Fernando Ballesteros 2, 37700-Béjar, Salamanca, SPAIN
$^2$e-mail: ascen@usal.es         $^4$e-mail: sarahw@usal.es
$^5$e-mail: delrey@usal.es         $^6$e-mail: gerardo@usal.es

$^7$e-mail: ivisus@usal.es
$^3$Instituto de Física Aplicada, CSIC
C/Serrano 144, 28006-Madrid, SPAIN
e-mail: luis@iec.csic.es


Abstract.The cryptographic use of Wolfram cellular automata as pseudorandom bit generators and their properties, are presented. After to apply several statistical tests with cryptographic significance and the linear complexity test to these cellular automata, a classification of them is given. Moreover, a cryptanalytic attack to the sequences generated by the cellular automata with good pseudorandom properties is analyzed.

Received: November 19, 2002

AMS Subject Classification: 94A60, 68W20, 68Q80, 11K45

Key Words and Phrases: cellular automata, cryptography, pseudorandom bit generators

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2003
Volume: 4
Issue: 1