Designing a Pseudo-Random Bit Generator Using Generalized Cascade Fractal Function

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Chaos Theory and Applications
Volume:3 Issue:1
Designing a Pseudo-Random Bit Generator Using Generalized Cascade Fractal Function

Designing a Pseudo-Random Bit Generator Using Generalized Cascade Fractal Function

Pages : 11-19

View : 35 | Download : 7

Publication Date : 2021-06-30

Article Type : Research Paper

Abstract :A cascade function is designed by combining two seed maps that resultantly has more parameters, high complexity, randomness, and more unpredictable behavior. In the paper, a cascade fractal function, i.e. cascade-PLMS is proposed by considering the phoenix and lambda fractal functions. The constructed cascade-PLMS exhibits the required fractal features such as fractional dimension, self-similar structure, and covering entire phase space by the data sequence in addition to the chaotic properties. Due to the chaotic behavior, the proposed function is utilized to generate a pseudo-random number sequence in both integer and binary format. This is the result of an extreme scalability feature of a fractal function that can be implemented on a large scale. A sequence generator is designed by performing the linear function operation to the real and imaginary part of a cascade-PLMS, cascade-PLJS separately, and the iteration number at which the cascade-PLJS converges to the fixed point. The performance analysis results show that the given method has a large keyspace, fast key generation speed, high key sensitivity, and strong randomness. Therefore, the scheme can be efficiently used further to design a secure cryptosystem with the ability to withstand various attacks.
Keywords : Cascade phoenix lambda fractal, PRNG, Mandelbrot set, dynamic behavior, key security analysis

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.