scholarly journals The Design and FPGA-Based Implementation of a Stream Cipher Based on a Secure Chaotic Generator

2021 ◽  
Vol 11 (2) ◽  
pp. 625
Author(s):  
Fethi Dridi ◽  
Safwan El Assad ◽  
Wajih El Hadj Youssef ◽  
Mohsen Machhout ◽  
René Lozi

In this study, with an FPGA-board using VHDL, we designed a secure chaos-based stream cipher (SCbSC), and we evaluated its hardware implementation performance in terms of computational complexity and its security. The fundamental element of the system is the proposed secure pseudo-chaotic number generator (SPCNG). The architecture of the proposed SPCNG includes three first-order recursive filters, each containing a discrete chaotic map and a mixing technique using an internal pseudo-random number (PRN). The three discrete chaotic maps, namely, the 3D Chebyshev map (3D Ch), the 1D logistic map (L), and the 1D skew-tent map (S), are weakly coupled by a predefined coupling matrix M. The mixing technique combined with the weak coupling technique of the three chaotic maps allows preserving the system against side-channel attacks (SCAs). The proposed system was implemented on a Xilinx XC7Z020 PYNQ-Z2 FPGA platform. Logic resources, throughput, and cryptanalytic and statistical tests showed a good tradeoff between efficiency and security. Thus, the proposed SCbSC can be used as a secure stream cipher.

2016 ◽  
Vol 6 (5) ◽  
pp. 1195-1199 ◽  
Author(s):  
A. Elsharkawi ◽  
R. M. El-Sagheer ◽  
H. Akah ◽  
H. Taha

Recently, many chaos-based stream cipher algorithms have been developed. Traditional chaos stream cipher is based on XORing a generated secure random number sequence based on chaotic maps (e.g. logistic map, Bernoulli Map, Tent Map etc.) with the original image to get the encrypted image, This type of stream cipher seems to be vulnerable to chosen plaintext attacks. This paper introduces a new stream cipher algorithm based on dynamic substitution box. The new algorithm uses one substitution box (S-box) and a chaotic shuffling process. Each byte in the plain image vector is substituted using a different S-box to get the cipher image vector. This algorithm is designed to be invulnerable to chosen plaintext attacks. In addition, this algorithm is more secured compared to conventional stream cipher.


Electronics ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1313
Author(s):  
Wenhao Yan ◽  
Qun Ding

In this paper, a method to enhance the dynamic characteristics of one-dimension (1D) chaotic maps is first presented. Linear combinations and nonlinear transform based on existing chaotic systems (LNECS) are introduced. Then, a numerical chaotic map (LCLS), based on Logistic map and Sine map, is given. Through the analysis of a bifurcation diagram, Lyapunov exponent (LE), and Sample entropy (SE), we can see that CLS has overcome the shortcomings of a low-dimensional chaotic system and can be used in the field of cryptology. In addition, the construction of eight functions is designed to obtain an S-box. Finally, five security criteria of the S-box are shown, which indicate the S-box based on the proposed in this paper has strong encryption characteristics. The research of this paper is helpful for the development of cryptography study such as dynamic construction methods based on chaotic systems.


2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Xuan Huang ◽  
Lingfeng Liu ◽  
Xiangjun Li ◽  
Minrong Yu ◽  
Zijie Wu

Given that the sequences generated by logistic map are unsecure with a number of weaknesses, including its relatively small key space, uneven distribution, and vulnerability to attack by phase space reconstruction, this paper proposes a new two-dimensional mutual coupled logistic map, which can overcome these weaknesses. Our two-dimensional chaotic map model is simpler than the recently proposed three-dimensional coupled logistic map, whereas the sequence generated by our system is more complex. Furthermore, a new kind of pseudorandom number generator (PRNG) based on the mutual coupled logistic maps is proposed for application. Both statistical tests and security analysis show that our proposed PRNG has good randomness and that it can resist all kinds of attacks. The algorithm speed analysis indicates that PRNG is valuable to practical applications.


2009 ◽  
Vol 19 (12) ◽  
pp. 4227-4235 ◽  
Author(s):  
ALI KANSO

This paper proposes the construction of a new chaotic pseudorandom bit generator, which forms the main building block of a chaotic stream cipher. The design of the algorithm is based on a single chaotic map whose numerical orbit indirectly contributes towards the generation of the keystream. The latter is produced from the numerical orbit by applying a technique that searches for iterates in specific intervals [a,b], for some real numbers a and b, and outputs 0 or 1 based on the iterate preceding the targeted iterate. The generator suggested here is built up from a quadratic map. We analyze the cycle length of the keystreams and investigate the resistance of the generator to well-known cryptanalytic attacks. Furthermore, the statistic characteristics of the keystreams are examined numerically using the NIST statistical test suite. The numerical and theoretical results demonstrate that the proposed technique results in generating keystreams possessing very good cryptographic properties and high level of security against existing cryptanalytic attacks. Empirical results show that the search technique leads to the generation of keystreams possessing good randomness properties when applied to any chaotic map whose orbits have good randomness properties such as the quadratic map, tent map and sawtooth map.


2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Akugbe Martins Arasomwan ◽  
Aderemi Oluyinka Adewumi

This paper experimentally investigates the effect of nine chaotic maps on the performance of two Particle Swarm Optimization (PSO) variants, namely, Random Inertia Weight PSO (RIW-PSO) and Linear Decreasing Inertia Weight PSO (LDIW-PSO) algorithms. The applications of logistic chaotic map by researchers to these variants have led to Chaotic Random Inertia Weight PSO (CRIW-PSO) and Chaotic Linear Decreasing Inertia Weight PSO (CDIW-PSO) with improved optimizing capability due to better global search mobility. However, there are many other chaotic maps in literature which could perhaps enhance the performances of RIW-PSO and LDIW-PSO more than logistic map. Some benchmark mathematical problems well-studied in literature were used to verify the performances of RIW-PSO and LDIW-PSO variants using the nine chaotic maps in comparison with logistic chaotic map. Results show that the performances of these two variants were improved more by many of the chaotic maps than by logistic map in many of the test problems. The best performance, in terms of function evaluations, was obtained by the two variants using Intermittency chaotic map. Results in this paper provide a platform for informative decision making when selecting chaotic maps to be used in the inertia weight formula of LDIW-PSO and RIW-PSO.


2012 ◽  
Vol 26 (32) ◽  
pp. 1250208 ◽  
Author(s):  
XING-YUAN WANG ◽  
LEI YANG

In order to solve the problem of degradation of dynamical properties caused by finite states of computer, a new binary stream-cipher algorithm based on dual one-dimensional chaotic maps is proposed in this paper. In the process of generation, we employ a parameter of one chaotic map to perturb the other chaotic map's trajectory to lengthen the cycle-length of the other chaotic map's trajectory. In addition, we design a nonlinear principle to generate a pseudo-random chaotic bit sequence as key stream. Statistic proprieties show that the sequence is of high randomness.


Author(s):  
Yahia Alemami ◽  
Mohamad Afendee Mohamed ◽  
Saleh Atiewi ◽  
Mustafa Mamat

There are various ways of social communication including writing (WhatsApp, Messenger, Facebook, Twitter, Skype, etc), calling (mobile phone) and voice recording (record your voice and then send it to the other party), but there are ways to eavesdropping the calls and voice messages, One way to solve this problem is via cryptographic approach. Chaos cryptography build on top of nonlinear dynamics chaotic system has gained some footstep in data security. It provides an alternative to conventional cryptography built on top of mathematical structures. This research focuses on the protection of speech recording by encrypting it with multiple encryption algorithms, including chaotic maps (Logistic Map and Sine Maps).


Electronics ◽  
2018 ◽  
Vol 7 (11) ◽  
pp. 326 ◽  
Author(s):  
Shouliang Li ◽  
Benshun Yin ◽  
Weikang Ding ◽  
Tongfeng Zhang ◽  
Yide Ma

Considering that a majority of the traditional one-dimensional discrete chaotic maps have disadvantages including a relatively narrow chaotic range, smaller Lyapunov exponents, and excessive periodic windows, a new nonlinearly modulated Logistic map with delay model (NMLD) is proposed. Accordingly, a chaotic map called a first-order Feigenbaum-Logistic NMLD (FL-NMLD) is proposed. Simulation results demonstrate that FL-NMLD has a considerably wider chaotic range, larger Lyapunov exponents, and superior ergodicity compared with existing chaotic maps. Based on FL-NMLD, we propose a new image encryption algorithm that joins the pixel plane and bit-plane shuffle (JPB). The simulation and test results confirm that JPB has higher security than simple pixel-plane encryption and is faster than simple bit-plane encryption. Moreover, it can resist the majority of attacks including statistical and differential attacks.


2014 ◽  
Vol 543-547 ◽  
pp. 2304-2307
Author(s):  
Rui Song Ye ◽  
Hui Qing Huang ◽  
Rui Feng Chen

A color image watermarking scheme using the chaotic properties of 2D tent map and Chebyshev map is proposed. Given control parameters and initial values, one can iterate the 2D tent map to get one chaotic sequence and obtain one permutation by sorting the chaotic sequence in ascending order. The permutation is then utilized to shuffle the blue channel components of color image as a preprocessing stage to enhance the security, imperceptibility and robustness of watermarking. Meanwhile, one can iterate the Chebyshev map to generate another chaotic sequence to determine the embedding bit positions and strengthen the security as well. Experiment results show that the watermarking scheme is secure with large key space, imperceptible and robust against cropping, noise attacks.


In This paper, new model of image encryption is designed. This model using stream cipher based on finite precision chaotic maps. The model designed in efficient way by using Xilinx System Generator (XSG). Pseudo Random Bit Generator (PRBG) depends on chaotic maps is proposed to design Fixed Point Hybrid Chaotic Map-PRBG (FPHYBCM-PRBG). National Institute of Standards and Technology (NIST) randomness measures tested the randomness of the proposed FPHYBCM-PRBG system. The security analysis, such as histogram, correlation coefficient, information entropy, differential attack (NPCR and UACI) are used to analyze the proposed system. Also, FPGA Hardware Co-Simulation over Xilinx SP605 XC6SLX45T provided to test the reality of image encryption system. The results show that FPHYBCM-PRBG is suitable for image encryption based on stream cipher and outperform some encryption algorithms in sufficient way to enhance the security and robust against brute force attack with low maximum frequency and throughput.


Sign in / Sign up

Export Citation Format

Share Document