DocumentCode
3281540
Title
A generalization of the cellular automata rule-30 cryptoscheme
Author
Popovici, Adriana ; Popovici, Dan
Author_Institution
Dept. of Math. & Comput. Sci., West Timisoara Univ., Romania
fYear
2005
fDate
25-29 Sept. 2005
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.
Keywords
cellular automata; cryptography; Wolfram cryptographic approach; Wolfram rule 30; cellular automata rule-30 cryptoscheme; cellular automaton transform; data encryption standard; Automata; Computer science; Mathematics; Privacy; Protection; Public key; Public key cryptography; Robustness; Security; Standards development; Wolfram rules; cellular automata; cryptography; reversibility;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing, 2005. SYNASC 2005. Seventh International Symposium on
Print_ISBN
0-7695-2453-2
Type
conf
DOI
10.1109/SYNASC.2005.5
Filename
1595844
Link To Document