Cryptosystems for binary information are based on two primitives: an indexe
d family of permutations of binary words and a generator of pseudorandom se
quences of indices. A very efficient implementation of the primitives is co
nstructed using the phenomenon of synchronization in cellular automata. (C)
1998 American Institute of Physics. [S1054-1500(98)01204-X].