A New Two‐Dimensional Mutual Coupled Logistic Map and Its Application for Pseudorandom Number Generator

Huang, Xuan; Liu, Lingfeng; Li, Xiangjun; Yu, Minrong; Wu, Zijie

doi:10.1155/2019/7685359

Cited by 19 publications

(26 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pseudorandom bit sequence (PRBS) plays an important role in many fields, such as spread spectrum communication, numerical simulation, and cryptography [7,8]. Recently, chaotic systems are regarded as effective nonlinear sources in generating PRBS for their wonderful properties, including sensitivity on initial conditions and parameters, ergodicity, long-term unpredictability, and pseudorandomness [9][10][11]. Overall, the one-dimensional chaotic map is the most widely used chaotic system for designing PRBG.…”

Section: Introductionmentioning

confidence: 99%

A New Pseudorandom Bit Generator Based on Mixing Three‐Dimensional Chen Chaotic System with a Chaotic Tactics

Huang

Liu

et al. 2019

Complexity

Self Cite

View full text Add to dashboard Cite

In this paper, a new chaotic system is proposed based on mixing three-dimensional Chen chaotic system with a chaotic tactics. This new system is proved to be chaotic under Wiggins' chaos definition and can generate chaotic sequences with high complexity. Furthermore, we propose a new pseudorandom bit generator (PRBG) based on this new system. A coding algorithm is used to make the sequences uniform. Both statistical and security tests are provided to show the generated sequences are with good randomness and high complexity to withstand attacks.

show abstract

Section: Introductionmentioning

confidence: 99%

A New Pseudorandom Bit Generator Based on Mixing Three‐Dimensional Chen Chaotic System with a Chaotic Tactics

Huang

Liu

et al. 2019

Complexity

Self Cite

View full text Add to dashboard Cite

show abstract

“…The means of the P values of each test are illustrated in Table 3. As the table shows, there is a significant difference between the two groups: the first group results being calculated based on the current study, whilst the second group pertains to the reference outcomes [31]. Additionally, according to the results illustrated in Table 2, the bit sequence of this research has passed all the tests successfully.…”

Section: Nist Statistical Testsmentioning

confidence: 84%

“…Therefore, for the current study, it has been found that the sequence delivers good statistical performance and can achieve true randomness. In Table 3, a comparison with the reference outcomes [31] is provided. Clearly, the results of the current study demonstrate better means of the P_values than the same test results obtained from the reference [31].…”

Section: Nist Statistical Testsmentioning

confidence: 99%

See 1 more Smart Citation

A new pseudorandom bits generator based on a 2D-chaotic system and diffusion property

Akif

Ali

et al. 2021

Bulletin EEI

View full text Add to dashboard Cite

A remarkable correlation between chaotic systems and cryptography has been established with sensitivity to initial states, unpredictability, and complex behaviors. In one development, stages of a chaotic stream cipher are applied to a discrete chaotic dynamic system for the generation of pseudorandom bits. Some of these generators are based on 1D chaotic map and others on 2D ones. In the current study, a pseudorandom bit generator (PRBG) based on a new 2D chaotic logistic map is proposed that runs side-by-side and commences from random independent initial states. The structure of the proposed model consists of the three components of a mouse input device, the proposed 2D chaotic system, and an initial permutation (IP) table. Statistical tests of the generated sequence of bits are investigated by applying five evaluations as well as the ACF and NIST. The results of five standard tests of randomness have been illustrated and overcome a value of 0.160 in frequency test. While the run test presents the pass value t0=4.769 and t1=2.929. Likewise, poker test and serial test the outcomes was passed with 3.520 for poker test, and 4.720 for serial test. Finally, autocorrelation test passed in all shift numbers from 1 to 10.

show abstract

“…The classical chaotic maps (logistic and henon) are faster because they have a lower number of computational operations. PRNGs based on the new chaotic maps outperform some of the existing chaos-based PRNGs [21], [38] but are slower than the PRNGs proposed in [15], [50], [51]. The lower efficiency is because the proposed generators were designed to produce only 8 bits per iteration, rather than multiple bytes.…”

Section: G Speed Analysismentioning

confidence: 95%

Digital Cosine Chaotic Map for Cryptographic Applications

et al. 2019

View full text Add to dashboard Cite

Despite having many similar characteristics with cryptography, existing chaotic systems have many security issues that negatively affect the chaos-based cryptographic algorithms that utilize them. This paper proposes a new chaotification method that enhances the chaotic complexity of existing chaotic maps to surmount these issues. The proposed method uses a cosine function alongside a chaotic map in a cascade system. To depict its advantages, we apply it to enhance logistic and Henon maps before analyzing their chaotic properties. Results and comparisons indicate that the new chaotic maps have a wider chaotic range, elevated sensitivity, complex characteristics, high nonlinearity, and an extended cycle length as compared to the original (seed) maps as well as other chaotic maps. We then utilize the modified maps (and their corresponding seed maps) to design simple pseudorandom number generators to study their feasibility when used in cryptographic algorithms. We perform comparisons between the generators derived from both the original and seed maps. Results show that generators based on the new maps outperform their seed counterparts in nearly every aspect. This finding demonstrates the capability of the proposed method in improving the performance of chaos-based cryptographic algorithms.

show abstract

A New Two‐Dimensional Mutual Coupled Logistic Map and Its Application for Pseudorandom Number Generator

Cited by 19 publications

References 31 publications

A New Pseudorandom Bit Generator Based on Mixing Three‐Dimensional Chen Chaotic System with a Chaotic Tactics

A New Pseudorandom Bit Generator Based on Mixing Three‐Dimensional Chen Chaotic System with a Chaotic Tactics

A new pseudorandom bits generator based on a 2D-chaotic system and diffusion property

Digital Cosine Chaotic Map for Cryptographic Applications

Contact Info

Product

Resources

About