arXiv · 1012.5140
Improvement and analysis of a pseudo random bit generator by means of cellular automata
Abstract
In this paper, we implement a revised pseudo random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix H_N with the aim of calculating the pseudo random sequences of N bits employing the algorithm related to the automaton backward evolution. In addition, a multifractal structure of the matrix H_N is revealed and quantified according to the multifractal formalism. The latter analysis could help to disentangle what kind of automaton rule is used in the randomization process and therefore it could be useful in cryptanalysis. Moreover, the conditions are found under which this pseudo random generator passes all the statistical tests provided by the National Institute of Standards and Technology (NIST)
Explore related subjects
Keep this discovery
J. S. Murguia, M. Mejia-Carlos, H. C. Rosu, G. Flores-Eraña. 2010-12-23. Improvement and analysis of a pseudo random bit generator by means of cellular automata. https://doi.org/10.1142/s0129183110015440
Cite the original work for its findings. Save a collection to share your selection of sources.