2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2005)
Sept. 25, 2005 to Sept. 29, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.5
Adriana Popovici , University of the West Timişoara
Dan Popovici , University of the West Timişoara
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.
cellular automata, cryptography, reversibility, Wolfram rules
Adriana Popovici, Dan Popovici, "A Generalization of the Cellular Automata Rule-30 Cryptoscheme", 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, vol. 00, no. , pp. 158-164, 2005, doi:10.1109/SYNASC.2005.5