.png){kind=icon}
.png){kind=icon}
Return
Pseudo-random bit generator based on multi-modal maps
.png){kind=icon}
PRE
AI
DOI：10.1007/s11071-015-2303-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work we present a pseudo-random Bit Generator via unidimensional multi-modal discrete dynamical systems called k-modal maps. These multi-modal maps are based on the logistic map and are useful to yield pseudo-random sequences with longer period, i.e., in order to attend the problem of periodicity. In addition the pseudo-random sequences generated via multi-modal maps are evaluated with the statistical suite of test from NIST and satisfactory results are obtained when they are used as key stream. Furthermore, we show the impact of using these sequences in a stream cipher resulting in a better encryption quality correlated with the number of modals of the chaotic map. Finally, a statistical security analysis applied to cipher images is given. The proposed algorithm to encrypt is able to resist the chosen-plaintext attack and differential attack because the same set of encryption keys generates a different cipher image every time it is used.
Keywords:
Chaotic behavior
Lyapunov exponent
Bifurcation parameter
Bifurcation diagram
Pseudo-random generator
NIST
Stream cipher
Key stream
k-modal maps
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
1.4W
Citations:
4.1W