2013
DOI: 10.1016/j.ins.2012.09.029
|View full text |Cite
|
Sign up to set email alerts
|

On the combination of self-organized systems to generate pseudo-random numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 37 publications
0
3
0
Order By: Relevance
“…Hotensius et al [10] and Nandi et al [11] used non-uniform CA with two rules 90 and 150, and it was found that the quality of generated pseudo numbers sequence was better than the quality of the Wolfram system. Recently, in the previous works [12] and [6] new design with combination of rules and complex behaviors has introduced, several works has done for generating random numbers by using CA and evolutionary algorithms. For example, genetic algorithm, which were evoked in these, researches [13] [14] and [15] and particle swarm optimization (PSO) algorithm have been used in [16].…”
Section: One-dimensional Cellular Automata and Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Hotensius et al [10] and Nandi et al [11] used non-uniform CA with two rules 90 and 150, and it was found that the quality of generated pseudo numbers sequence was better than the quality of the Wolfram system. Recently, in the previous works [12] and [6] new design with combination of rules and complex behaviors has introduced, several works has done for generating random numbers by using CA and evolutionary algorithms. For example, genetic algorithm, which were evoked in these, researches [13] [14] and [15] and particle swarm optimization (PSO) algorithm have been used in [16].…”
Section: One-dimensional Cellular Automata and Related Workmentioning
confidence: 99%
“…CA is a good candidate to generate random numbers. However, the CA's self-organization property limits random number [6] and the quality of random numbers depends especially on applied CA rules, to solve this problem metaheuristic algorithms are used especially for explore and exploit the search space. In this paper, MBPSO used to discover the relevant rules for non-uniform CA (i.e rules that used to generate pseudo-random number of high quality).…”
Section: Introductionmentioning
confidence: 99%
“…Over the past decades, chaos-based PRNGs, namely Pseudo-Chaotic Number Generators (PCNGs), have been verified to be efficient in producing pseudo-random numbers due to their excellent properties, such as, deterministic character, nonperiodicity, high sensitivity to initial conditions and parameters, etc. [4]. If the initial conditions and the parameters of the PCNGs are considered to be the secret keys, several secret keys are able to generate abundant numbers of highly secure key-dependent pseudo-random values that will be used as dynamic keys in the cryptosystem.…”
Section: Introductionmentioning
confidence: 99%