Permutation and sampling with maximum length CA for pseudorandom number generation

In this paper, we study the effect of dynamic permutation and sampling on the randomness quality of sequences generated by cellular automata (CA). Dynamic permutation and sampling have not been explored in previous CA work and a suitable implementation is shown using a two CA model. Three different schemes that incorporate these two operations are suggested - Weighted Permutation Vector Sampling with Controlled Multiplexing, Weighted Permutation Vector Sampling with Irregular Decimation and Permutation Programmed CA Sampling. The experiment results show that the resulting sequences have varying degrees of improvement in DIEHARD results and linear complexity compared to the CA

Layered cellular automata for pseudorandom number generation

The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. The time-varying L-LCA transformation at each clock can be reduced to a single transformation in the set formed by the transformation matrix of a maximum length Cellular Automata (CA), and the entire transformation sequence for a single period can be obtained. The analysis for the period characteristics of state sequences is simplified by analyzing representative transformation sequences determined by the phase difference between the initial states for each layer. The L-LCA model can be extended by adding more layers of memory or through the use of a larger main CA based on widely available maximum length CA. Several L-LCA (L=1,2,3,4) with 10- to 48-bit main CA are subjected to the DIEHARD test suite and better results are obtained over other CA designs reported in the literature. The experiments are repeated using the well-known nonlinear functions and in place of the linear function used in the L-LCA. Linear complexity is significantly increased when or is used

Новый генератор псевдослучайных последовательностей чисел на основе клеточного автомата

Розглядається новий генератор псевдовипадкових послідовностей біт, який реалізований на клітинному автоматі. Представлена апаратна реалізація генератора і виконано його програмне моделювання. За допомогою програмної моделі проведене тестування розробленого генератора псевдовипадкових чисел. Використані тести показали позитивний результат, який підтверджує високі статистичні властивості сформованої випадкової послідовності.This paper considers a novel pseudo-random bit sequence generator, which is implemented on a cellular automaton. It presents the hardware implementation of the generator and it the software simulation. With the help of the software model is testing of the random number generator was conducted. Tests showed a positive result, which confirms the high statistical properties of the generated random sequence.Рассматривается новый генератор псевдослучайных последовательностей бит, который реализован на клеточном автомате. Представлена аппаратная реализация генератора и выполнено его программное моделирование. С помощью программной модели проведено тестирование разработанного генератора псевдослучайных чисел. Использованные тесты показали положительный результат, который подтверждает высокие статистические свойства сформированной случайной последовательности