Parallel Random Number Generation for VLSI Systems Using Cellular Automata
IEEE Transactions on Computers
Communications of the ACM - Special issue on simulation
Efficient and portable combined Tausworthe random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Theory and Applications of Cellular Automata in Cryptography
IEEE Transactions on Computers
A class of two-dimensional cellular automata and their applications in random pattern testing
Journal of Electronic Testing: Theory and Applications
Radix-b extensions to some common empirical tests for pseudorandom number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Generating high-quality random numbers in parallel by cellular automata
Future Generation Computer Systems - Special issue on cellular automata: promise in computational science
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata
IEEE Transactions on Computers
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Numerical Recipes in C: The Art of Scientific Computing
Numerical Recipes in C: The Art of Scientific Computing
Cryptography with Cellular Automata
CRYPTO '85 Advances in Cryptology
Cellular automata computations and secret key cryptography
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
FPGA Implementation of Hybrid Additive Programmable Cellular Automata Encryption Algorithm
HIS '08 Proceedings of the 2008 8th International Conference on Hybrid Intelligent Systems
Generating High-Quality Random Numbers by Cellular Automata with PSO
ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 07
True random number generator based on mouse movement and chaotic hash function
Information Sciences: an International Journal
CSE '09 Proceedings of the 2009 International Conference on Computational Science and Engineering - Volume 01
Data Encryption Based on Multi-granularity Reversible Cellular Automata
CIS '09 Proceedings of the 2009 International Conference on Computational Intelligence and Security - Volume 02
Programmable cellular automata (PCA) based advanced encryption standard (AES) hardware architecture
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
IEEE Transactions on Evolutionary Computation
Cellular automata-based pseudorandom number generators for built-in self-test
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Hi-index | 0.07 |
Cellular automata (CA) is a self-organizing structure with complex behavior which can be used to generating pseudo-random numbers. Pure CA has a simple structure and has no ability to produce long sequences of random numbers but in order to resolve this problem, a programmable, controllable CA (PCCA), using actuating factor or combination of different self-organizing criticality phenomena can be used. The purpose of the aforementioned methods is the use of the CA speed while preventing the automata self-organizing factor for specific use in generating random numbers. In this paper, a PCCA by using Sandpile model is proposed. The Sandpile model is a complex system that operates at a critical state between chaos and order. This state is known as self-organized criticality (SOC) and is characterized by displaying invariant scale behavior. In the precise case of the Sandpile model, by randomly and continuously dropping ''sand grains'' on top of a two-dimensional grid lattice, a power law relationship between the frequency and size of sand ''avalanches'' is observed. The avalanche behavior and the pure CA behavior are combined in a novel method which can be used as the pseudo-random number generator (PRNG). Experimental results show that this generator is able to reach a random behavior from a pseudo-chaotic one by combining two self-organized systems. In addition to independency of the initial state, it has been also indicated that the generated numbers are independent and its probability distribution is likely to be uniform. Accordingly, some tests of PRNGs such as entropy, chi-square, DIEHARD and several basic statistical tests have been performed and all of them have been successfully passed.