A cryptosystem based on cellular automata
Article
-
- Overview
-
- Identity
-
- Additional Document Info
-
- View All
-
Overview
abstract
-
Cryptosystems for binary information are based on two primitives: an indexed family of permutations of binary words and a generator of pseudorandom sequences of indices. A very efficient implementation of the primitives is constructed using the phenomenon of synchronization in cellular automata. © 1998 American Institute of Physics.
publication date
published in
Identity
Digital Object Identifier (DOI)
Additional Document Info
start page
end page
volume
issue