Pseudorandom Number Generator Based on Totalistic Cellular Automaton

2019 ◽  
pp. 360-370
Author(s):  
Miroslaw Szaban
Keyword(s):  
Cellular Automaton ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator

scholarly journals Simple method of selecting totalistic rules for pseudorandom number generator based on nonuniform cellular automaton

2021 ◽  
Author(s):  
Miroslaw Szaban
Keyword(s):  
Cellular Automaton ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Large Set ◽  
Number Generator ◽  
Pseudorandom Sequences ◽  
Simple Method ◽  
One Dimensional ◽  
Simple Selection ◽  
Selection Of

AbstractThis paper is devoted to selecting rules for one-dimensional (1D) totalistic cellular automaton (TCA). These rules are used for the generation of pseudorandom sequences, which could be useful in cryptography. The power of pseudorandom number generator (PRNG) based on nonuniform TCA can be improved using not only one rule but a large set of rules. For this purpose, each subset of rules should be analyzed with its assignation to cellular automaton (CA) cells should be analyzed. We examine each of the subsets of totalistic rules, consisting of rules with neighborhood radius equal to 1 and 2. The entropy of bitstreams generated by the nonuniform TCA points out the best set of rules appropriate for the TCA-based generator. The paper also presents the method of simple selection of CA rules based on a cryptographic criterion known as a balance. The proposed method selects a maximal size of the set of available CA rules for a given neighborhood radius and suitable for PRNG. The method guarantees to avoid conflicting assignments of rules resulting in the creation of unwanted stable bit sequences, and provides high-quality pseudorandom sequences. This technique is used to verify the subsets of rules selected experimentally. Verified rules are proposed for 1D TCA-based PRNG as a new subset of best nonuniform TCA rules. New picked, examined, and verified subset of rules could be used in TCA-based PRNG and provide cryptographically strong bit sequences and huge keyspace.

scholarly journals Design and FPGA Implementation of a Pseudorandom Number Generator Based on a Four-Wing Memristive Hyperchaotic System and Bernoulli Map

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 181884-181898 ◽  
Author(s):  
Fei Yu ◽  
Qiuzhen Wan ◽  
Jie Jin ◽  
Lixiang Li ◽  
Binyong He ◽  
...  
Keyword(s):  
Fpga Implementation ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Hyperchaotic System ◽  
Number Generator

scholarly journals Encryption of pseudorandom number generator logic circuits

2021 ◽  
Vol 190 ◽  
pp. 370-376
Author(s):  
Mikhail Ivanov ◽  
Iliya Chugunkov ◽  
Bogdana Kliuchnikova ◽  
Evgenii Salikov
Keyword(s):  
Logic Circuits ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator

scholarly journals Chaos-Based Bitwise Dynamical Pseudorandom Number Generator On FPGA

2019 ◽  
Vol 68 (1) ◽  
pp. 291-293 ◽  
Author(s):  
Miguel Garcia-Bosque ◽  
Adrian Perez-Resa ◽  
Carlos Sanchez-Azqueta ◽  
Concepcion Aldea ◽  
Santiago Celma
Keyword(s):  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator
Sign in / Sign up

Export Citation Format

Share Document