Search

High-performance pseudorandom number generators (PRNGs) play an important role in a variety of applications like computer simulations, and industrial applications including cryptography. High-quality PRNG can be constructed by employing cellular automata (CA). Advantage of the PRNG that employs CA includes that it is fast and suitable for hardware implementation. In this paper, we propose a two-dimensional (2-D) CA based PRNG. Our scheme uses the structure of programmable CA (PCA) for improving randomness quality. Moreover, for reducing of serial correlations among the produced pseudorandom bits, a consecutive bits replacing spacing technique is proposed. Finally, we provide experimental results to verify the randomness quality using ENT and DIEHARD test suites.

Pseudorandom number generator (PRNG) has been used in a variety of applications like computer simulations, and industrial applications including cryptography. High-quality PRNG can be constructed by employing cellular automata (CA). Advantage of the PRNG that employs CA includes that it is fast and suitable for hardware implementation. In this paper, we propose a two-dimensional (2-D) CA based PRNG. Our scheme uses the structure of programmable CA (PCA) for improving randomness quality. The CA rules used our PRNG are additive rules which has XOR and XNOR logic with a hybrid dependency, only rules 15, 31, 47 and 63. Moreover, for minimising of auto correlations among the produced pseudorandom number blocks, a novel time spacing technique is proposed without a loss of an original cycle length. Finally, we provide experimental results to verify the randomness quality using ENT and DIEHARD test suites.

Das et al have reported characterization of reachable/non-reachable CA states recently Their scheme has only offered the characterization under a null boundary CA (NBCA) However, in hardware implementation, a periodic boundary CA (PBCA) is suitable for constructing cost-effective schemes such as a linear feedback shift register structure because of its circular property Thus, this paper provides two decision algorithms for classification of reachable/non-reachable state and group/non-group CA based on periodic boundary condition.

Cellular automata (CA) have been used for modeling the behavior of complex systems such as the VLSI technology and parallel processing system. Recently, Das et al. have reported the characterization of reachable/non-reachable CA states. Their scheme has only offered characterization under a null boundary CA (NBCA). In the simplifications of hardware implementation, however, a periodic boundary CA (PBCA) is suitable for constructing cost-effective schemes such as a linear feedback shift register (LFSR) structure because of its circular properties. Thus, this paper presents two evolutionary algorithms for the identification of the reachable/non-reachable state and the group/non-group CA based on periodic boundary conditions.