loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05)
A Generalization of the Cellular Automata Rule-30 Cryptoscheme
Timisoara, Romania
September 25-September 29
ISBN: 0-7695-2453-2
ASCII Text
x 
 
Adriana Popovici, Dan Popovici, "A Generalization of the Cellular Automata Rule-30 Cryptoscheme," Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on, pp. 158-164, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/SYNASC.2005.5,
author = {Adriana Popovici and Dan Popovici},
title = {A Generalization of the Cellular Automata Rule-30 Cryptoscheme},
journal ={Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on},
volume = {0},
year = {2005},
isbn = {0-7695-2453-2},
pages = {158-164},
doi = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.5},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
TI - A Generalization of the Cellular Automata Rule-30 Cryptoscheme
SN - 0-7695-2453-2
SP158
EP164
A1 - Adriana Popovici,
A1 - Dan Popovici,
PY - 2005
KW - cellular automata
KW - cryptography
KW - reversibility
KW - Wolfram rules
VL - 0
JA - Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
ER -
 
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.
Index Terms:
cellular automata, cryptography, reversibility, Wolfram rules
Citation:
Adriana Popovici, Dan Popovici, "A Generalization of the Cellular Automata Rule-30 Cryptoscheme," synasc, pp.158-164, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.