2019
DOI: 10.1016/j.aeue.2019.05.028
|View full text |Cite
|
Sign up to set email alerts
|

Pseudorandom number generator based on enhanced Hénon map and its implementation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 72 publications
(21 citation statements)
references
References 19 publications
0
21
0
Order By: Relevance
“…In order to prove the high level of reliability, some security analysis must be carried out according to the data type. Key space, sensitivity, floating frequency, histograms, correlation, and information entropy analysis are common security analysis in the literature [97][98][99].…”
Section: Introductionmentioning
confidence: 99%
“…In order to prove the high level of reliability, some security analysis must be carried out according to the data type. Key space, sensitivity, floating frequency, histograms, correlation, and information entropy analysis are common security analysis in the literature [97][98][99].…”
Section: Introductionmentioning
confidence: 99%
“…The value of r must be large than 0 to withstand a special image attack. The statistical property A will be multiplied with Henon map as presented in Equation 3to enhance the immunity of the proposed scheme against knownchosen plaintext cryptanalysis, and to improve Henon map since the multiplication design and modular operator are used to enhance the chaotic dynamic of the Henon map without affecting the keyspace [23].…”
Section: Plain Image Related Henon Map (Pihm)mentioning
confidence: 99%
“…Motivated by the above introduction and to address this shortcoming, a new image cryptosystem under an efficient connected structure of confusiondiffusion is suggested in this article. The proposed cryptosystem does not utilize a complex high dimensional chaotic system or hash algorithm, but it utilizes statistical property that is extracted from a plain image to enhance the chaotic behavior of modified two-dimensional Henon map [23] and immunity of the encryption algorithm against known-chosen plaintext cryptanalysis.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, there exist several studies related to FPGA-based PRNG designs of chaotic systems [20], [64]- [66]. In [20], four chaotic maps: Bernoulli shift map, tent, zigzag, and Borujeni maps are selected to implement a PRNG.…”
Section: Introductionmentioning
confidence: 99%
“…The output attractor of the proposed PRNG can be reconfigured using an effective hard-wire shift and multiplexing scheme during real-time operation. In [66], a high-speed PRNG model is implemented on the FPGA by using enhanced Henon map, which has been passed by a comprehensive security analysis. The random bit set generated by PRNG is further verified by NIST 800.22 statistical tests, which proves that the design can be used in cryptographic applications.…”
Section: Introductionmentioning
confidence: 99%