Pseudo-random sequence generator based on the generalized Henon map

Fan, Zheng; Tian, Xuemin; Song, Jingyi; Li, Xueyan

doi:10.1016/s1005-8885(08)60109-0

Cited by 46 publications

(22 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2. The map has been proposed as a method of generating pseudo-random sequences [19]. For each component of red, green and blue for the color image, after iterating Eq.…”

Section: Generating the One-time Keys Dependent On The Plain Imagementioning

confidence: 99%

Asymmetric color image encryption scheme using 2D discrete-time map

2015

View full text Add to dashboard Cite

“…2. The map has been proposed as a method of generating pseudo-random sequences [19]. For each component of red, green and blue for the color image, after iterating Eq.…”

Section: Generating the One-time Keys Dependent On The Plain Imagementioning

confidence: 99%

Asymmetric color image encryption scheme using 2D discrete-time map

2015

View full text Add to dashboard Cite

“…Then the trajectories of system (6) and (8) are shown in Figure 1. From (d), it can be seen that the two pair of variables are in GCS with respect to H, so it is in line with expectations.…”

Section: Chaotic Trajectories Of the Bgcsdsmentioning

confidence: 99%

“…One way is to use a single chaotic map, such as Tent map [2], Henon map [3] and so on [4]- [5]. Another way is to extend or compound some common chaotic maps, such as Logistic map [6]- [7], Henon map [8]. By summarizing the literatures, it is found that the extension methods are simple addition, improved and coupled mostly.…”

Section: Introductionmentioning

confidence: 99%

A Bidirectional Generalized Synchronization Theorem -Based Chaotic Pseudorandom Number Generator

Han

Lee

2013

TELKOMNIKA

View full text Add to dashboard Cite

Keywords: sinkronisasi tergeneralisasi; urutan acak semu (pseudo-random sequence), tes FIPS-140-2, sistem diskret dua arah Abstract In order to design good pseudorandom number generator, using a bidirectional generalized synchronization theorem for discrete chaos system, this paper introduces a new 5-dimensional bidirectional generalized chaos synchronization system (BGCSDS), whose prototype is a novel chaotic system. Numerical simulation showed that two pair variables of the BGCSDS achieve generalized chaos synchronization via a transform H. A chaos-based pseudorandom number generator (CPNG) was designed by the new BGCSDS. Using the FIPS-140-2 tests issued by the National Institute of Standard and Technology (NIST) verified the randomness of the 1000 binary number sequences generated via the CPNG and the RC4 algorithm respectively. The results showed all the tested sequences passed the FIPS-140-2 tests. The confidence interval analysis showed the statistical properties of the randomness of the sequences generated via the CPNG and the RC4 algorithm do not have significant differences. So, the CPNG is suitable to be used in the information security filed.

show abstract

“…Various common image encryption algorithms are available, including text encryption technology, SCAN languagebased encryption technology, quadtree image encryption technology, vector quantization encryption technology (VQ), encryption technology based on pseudorandom sequences, encryption technology based on the "key image" chaotic encryption technology, and image encryption technology based on DNA computing [3][4][5][6][7][8][9][10]. Recently, chaotic encryption technology has been attracting increasing attention.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Algorithm Based on DNA Encoding and Chaotic Maps

Zhang

Fang

Ren

2014

Mathematical Problems in Engineering

117

View full text Add to dashboard Cite

We propose a new image encryption algorithm based on DNA sequences combined with chaotic maps. This algorithm has two innovations: (1) it diffuses the pixels by transforming the nucleotides into corresponding base pairs a random number of times and (2) it confuses the pixels by a chaotic index based on a chaotic map. For any size of the original grayscale image, the rows and columns are fist exchanged by the arrays generated by a logistic chaotic map. Secondly, each pixel that has been confused is encoded into four nucleotides according to the DNA coding. Thirdly, each nucleotide is transformed into the corresponding base pair a random number of time(s) by a series of iterative computations based on Chebyshev’s chaotic map. Experimental results indicate that the key account of this algorithm is 1.536 × 10127, the correlation coefficient of a 256 × 256 Lena image between, before, and after the encryption processes was 0.0028, and the information entropy of the encrypted image was 7.9854. These simulation results and security analysis show that the proposed algorithm not only has good encryption effect, but also has the ability to repel exhaustive, statistical, differential, and noise attacks.

show abstract

Pseudo-random sequence generator based on the generalized Henon map

Cited by 46 publications

References 11 publications

Asymmetric color image encryption scheme using 2D discrete-time map

Asymmetric color image encryption scheme using 2D discrete-time map

A Bidirectional Generalized Synchronization Theorem -Based Chaotic Pseudorandom Number Generator

Image Encryption Algorithm Based on DNA Encoding and Chaotic Maps

Contact Info

Product

Resources

About