No Access
PROPAGATION CHARACTERISTICS OF THE DIVERGENCE OF ELEMENTARY CELLULAR AUTOMATA
https://doi.org/10.1142/S0129183110015828Cited by:1 (Source: Crossref)
Abstract
In this work the notion of divergence of elementary cellular automata is introduced and it is analyzed from a cryptographic point of view. Specifically, the balancedness and propagation characteristics are analyzed.
Keywords:
PACS: 05.65.+b, 89.75.-k
References
- Int. J. Mod. Phys. C 19, 351 (2008), DOI: 10.1142/S012918310801211X. Link, Web of Science, ADS, Google Scholar
-
P. P. Chaudhuri , Additive Cellular Automata: Theory and Applications 1 ( Wiley-IEEE Computer Society Press , Los Alamitos, CA , 1997 ) . Google Scholar - Commun. Contemp. Math. 477, 1 (2009). Crossref, Google Scholar
- ACM Comput. Surv. 32, 80 (2000), DOI: 10.1145/349194.349202. Crossref, Web of Science, Google Scholar
- J. Escuadra Burrieza, A. M. del Rey, J. L. Pérez Iglesias, A. Q. Dios, G. R. Sánchez and A. de la Villa Cuenca, Int. J. Comput. Math. (To appear) . Google Scholar
- A. M. del Rey and G. R. Sánchez, Inform. Comput. (Submitted) . Google Scholar
-
S. Wolfram , A New Kind of Science ( Wolfram Media Inc. , Champaign, IL , 2002 ) . Google Scholar -
S. Wolfram , Cellular Automata and Complexity: Collected Papers ( Addison-Wesley , 1994 ) . Google Scholar -
T. W. Cusick and P. Stănică , Cryptographic Boolean Functions and Applications ( Academic Press , 2009 ) . Google Scholar A. F. Webster and S. E. Tavares ,Lect. Notes Comput. Sci. 219 (1985) p. 523. Google ScholarB. Preneel ,Lect. Notes Comput. Sci. 473 (1991) p. 161. Google Scholar
| You currently do not have access to the full text article. |
|---|
