Cryptography with Cellular Automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 218 LNCS, Issue , 1986, Pages 429-432

  Wolfram, Stephen ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CELLS; CELLULAR AUTOMATA; CRYPTOGRAPHY; CYTOLOGY; DELAY CIRCUITS; DYNAMICAL SYSTEMS; LYAPUNOV METHODS; MAPPING; POLYNOMIALS; SHIFT REGISTERS;

CELLULAR AUTOMATION; CONTINUOUS MAPPINGS; CRYPTOGRAPHIC APPLICATIONS; CRYPTOGRAPHIC SYSTEMS; DISJUNCTIVE NORMAL FORM; SMALL PERTURBATIONS; STATE TRANSITION DIAGRAMS; STATISTICAL REGULARITY;

BOOLEAN ALGEBRA;

EID: 84992720189     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39799-X_32     Document Type: Conference Paper

References (6)

1. S. Wolfram., “Random sequence generation by cellular automata”, to be published in Advances in Applied Mathematics.
2. S. Wolfram, “Origins of randomness in physical systems”, Phys. Rev. Lett. 55, 449 (1985); S. Wolfram, “Cellular automata as models of complexity”, Nature 311, 419 (1984).
3. D. Knuth, Seminumerical Algorithm, (Addison-Wesley, 1981).
4. S. Wolfram, “Universality and complexity in cellular automata”, Physica 10D, 1 (1984).
5. R. Rudell, espresso software program. Computer Science Dept, University of California, Berkeley (1985).
6. C. Feynman and R. Feynman, private communication.