The Community for Technology Leaders
Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05) (2005)
Timisoara, Romania
Sept. 25, 2005 to Sept. 29, 2005
ISBN: 0-7695-2453-2
pp: 158-164
Adriana Popovici , University of the West Timişoara
Dan Popovici , University of the West Timişoara
ABSTRACT
Cellular automata are powerful dynamical systems which provide a robust environment for developing a data encryption standard. We extend Wolfram?s rule 30 and obtain a reversible cellular automaton having an inverse with unboundedly large domain. An alternative cryptogram is presented which combines the extended Wolfram?s cryptographic approach with the one of cellular automaton transforms.
INDEX TERMS
cellular automata, cryptography, reversibility, Wolfram rules
CITATION

A. Popovici and D. Popovici, "A Generalization of the Cellular Automata Rule-30 Cryptoscheme," Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)(SYNASC), Timisoara, Romania, 2005, pp. 158-164.
doi:10.1109/SYNASC.2005.5
92 ms
(Ver 3.3 (11022016))