scholarly journals A Novel Image Stream Cipher Based On Dynamic Substitution

2016 ◽  
Vol 6 (5) ◽  
pp. 1195-1199 ◽  
Author(s):  
A. Elsharkawi ◽  
R. M. El-Sagheer ◽  
H. Akah ◽  
H. Taha
Keyword(s):  
Stream Cipher ◽  
Random Number ◽  
Chaotic Maps ◽  
Logistic Map ◽  
Number Sequence ◽  
Original Image ◽  
Substitution Box ◽  
Tent Map ◽  
Encrypted Image ◽  
Plain Image

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.

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
Keyword(s):  
Stream Cipher ◽  
Chaotic Maps ◽  
Statistical Tests ◽  
Chaotic Map ◽  
Logistic Map ◽  
Tent Map ◽  
First Order ◽  
Recursive Filters ◽  
Weakly Coupled ◽  
Chebyshev Map

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.

scholarly journals Chaotic Image Encryption Design Using Tompkins-Paige Algorithm

2009 ◽  
Vol 2009 ◽  
pp. 1-22 ◽  
Author(s):  
Shahram Etemadi Borujeni ◽  
Mohammad Eshghi
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Correlation Coefficients ◽  
Chi Square ◽  
Encrypted Image ◽  
Key Space ◽  
Chi Square Test ◽  
Plain Image ◽  
The Difference ◽  
Pixel Substitution

In this paper, we have presented a new permutation-substitution image encryption architecture using chaotic maps and Tompkins-Paige algorithm. The proposed encryption system includes two major parts, chaotic pixels permutation and chaotic pixels substitution. A logistic map is used to generate a bit sequence, which is used to generate pseudorandom numbers in Tompkins-Paige algorithm, in 2D permutation phase. Pixel substitution phase includes two process, the tent pseudorandom image (TPRI) generator and modulo addition operation. All parts of the proposed chaotic encryption system are simulated. Uniformity of the histogram of the proposed encrypted image is justified using the chi-square test, which is less than (255, 0.05). The vertical, horizontal, and diagonal correlation coefficients, as well as their average and RMS values for the proposed encrypted image are calculated that is about 13% less than previous researches. To quantify the difference between the encrypted image and the corresponding plain-image, three measures are used. These are MAE, NPCR, and UACI, which are improved in our proposed system considerably. NPCR of our proposed system is exactly the ideal value of this criterion. The key space of our proposed method is large enough to protect the system against any Brute-force and statistical attacks.

FPGA Design and Applicable Analysis of Discrete Chaotic Maps

2014 ◽  
Vol 24 (04) ◽  
pp. 1450054 ◽  
Author(s):  
Hongjun Wang ◽  
Bingbing Song ◽  
Qiang Liu ◽  
Jing Pan ◽  
Qun Ding
Keyword(s):  
Chaotic Maps ◽  
Logistic Map ◽  
Electronic System ◽  
Fpga Design ◽  
Tent Map ◽  
Variable Approach ◽  
Dsp Builder ◽  
Quartus Ii ◽  
Cryptographic System ◽  
Discrete Map

FPGA technology, applied to the case of electronic system, needs to make full use of hardware resources, to achieve great efficiency and yield the largest returns. To apply digital chaotic sequence which consume least resource in encryption system, this paper seeks a tradeoff between logistic and skew tent discrete map aiming at hardware utilization through the method of testing critical precision. Critical precision (or delay) is firstly proposed to weigh the effect of different precision (or delay) on chaotic system according to the autocorrelation property of output sequences. In tests, a controlled variable approach is adopted. Firstly, build graphical module on DSP builder platform in Simulink library, and then transform that into VHDL hardware language running in Quartus II, in which way, considerable time is saved. The results show that: in respective critical precision, the logistic map allows higher hardware utilization and is suitable to lower resource implementation. Meanwhile, compared with skew tent map in the same precision, the autocorrelation, run and balance properties of logistic map are all more superior. Therefore, a logistic map is selected as a key generator in hardware cryptographic system.

scholarly journals Deciphering an Image Cipher Based on Mixed Transformed Logistic Maps

2015 ◽  
Vol 25 (13) ◽  
pp. 1550188 ◽  
Author(s):  
Yuansheng Liu ◽  
Hua Fan ◽  
Eric Yong Xie ◽  
Ge Cheng ◽  
Chengqing Li
Keyword(s):  
Computational Complexity ◽  
Random Number ◽  
Logistic Map ◽  
Random Number Generator ◽  
Number Generator ◽  
John Von Neumann ◽  
Von Neumann ◽  
Image Cipher ◽  
Encryption Schemes ◽  
Plain Image

Since John von Neumann suggested utilizing Logistic map as a random number generator in 1947, a great number of encryption schemes based on Logistic map and/or its variants have been proposed. This paper re-evaluates the security of an image cipher based on transformed logistic maps and proves that the image cipher can be deciphered efficiently under two different conditions: (1) two pairs of known plain-images and the corresponding cipher-images with computational complexity of [Formula: see text]; (2) two pairs of chosen plain-images and the corresponding cipher-images with computational complexity of [Formula: see text], where [Formula: see text] is the number of pixels in the plain-image. In contrast, the required condition in the previous deciphering method is 87 pairs of chosen plain-images and the corresponding cipher-images with computational complexity of [Formula: see text]. In addition, three other security flaws existing in most Logistic-map-based ciphers are also reported.

A Novel Image Encryption Algorithm Based on Cellular Automata and Chaotic System

2014 ◽  
Vol 998-999 ◽  
pp. 797-801
Author(s):  
Peng Cheng ◽  
Huai Xun Zhao
Keyword(s):  
Cellular Automata ◽  
Image Encryption ◽  
Chaotic Maps ◽  
Logistic Map ◽  
Security Level ◽  
Differential Attack ◽  
Diffusion Stage ◽  
Plain Image ◽  
High Security Level ◽  
Image Encryption Algorithm

This paper introduces a novel image encryption scheme based on chaotic maps and toggle cellular automata (TCA). In confusion stage, the proposed scheme utilizes logistic map to construct a nonlinear sequence for scrambling the plain-image. Then in diffusion stage, TCA is constructed by setting up the inversion rule and the image which has been processed by chaotic sequence is encryption again by using the TCA iteration method. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack.

scholarly journals Reversible Integer Wavelet Transform for the Joint of Image Encryption and Watermarking

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Bin Wang
Keyword(s):  
Wavelet Transform ◽  
Image Encryption ◽  
Chaotic Maps ◽  
Integer Wavelet Transform ◽  
Histogram Modification ◽  
Encrypted Image ◽  
Considerable Research ◽  
Plain Image ◽  
Lossless Watermarking ◽  
Integer Wavelet

In recent years, signal processing in the encrypted domain has attracted considerable research interest, especially embedding watermarking in encrypted image. In this work, a novel joint of image encryption and watermarking based on reversible integer wavelet transform is proposed. Firstly, the plain-image is encrypted by chaotic maps and reversible integer wavelet transform. Then the lossless watermarking is embedded in the encrypted image by reversible integer wavelet transform and histogram modification. Finally an encrypted image containing watermarking is obtained by the inverse integer wavelet transform. What is more, the original image and watermarking can be completely recovered by inverse process. Numerical experimental results and comparing with previous works show that the proposed scheme possesses higher security and embedding capacity than previous works. It is suitable for protecting the image information.

scholarly journals Batch Image Encryption Using Generated Deep Features Based on Stacked Autoencoder Network

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Fei Hu ◽  
Jingyuan Wang ◽  
Xiaofei Xu ◽  
Changjiu Pu ◽  
Tao Peng
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Time Estimation ◽  
Differential Attack ◽  
Encrypted Image ◽  
Stacked Autoencoder ◽  
Encryption Schemes ◽  
Plain Image ◽  
Brute Force Attack ◽  
The Relationship

Chaos-based algorithms have been widely adopted to encrypt images. But previous chaos-based encryption schemes are not secure enough for batch image encryption, for images are usually encrypted using a single sequence. Once an encrypted image is cracked, all the others will be vulnerable. In this paper, we proposed a batch image encryption scheme into which a stacked autoencoder (SAE) network was introduced to generate two chaotic matrices; then one set is used to produce a total shuffling matrix to shuffle the pixel positions on each plain image, and another produces a series of independent sequences of which each is used to confuse the relationship between the permutated image and the encrypted image. The scheme is efficient because of the advantages of parallel computing of SAE, which leads to a significant reduction in the run-time complexity; in addition, the hybrid application of shuffling and confusing enhances the encryption effect. To evaluate the efficiency of our scheme, we compared it with the prevalent “logistic map,” and outperformance was achieved in running time estimation. The experimental results and analysis show that our scheme has good encryption effect and is able to resist brute-force attack, statistical attack, and differential attack.

scholarly journals A New Chaos-Based Color Image Encryption Scheme with an Efficient Substitution Keystream Generation Strategy

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Chong Fu ◽  
Gao-yuan Zhang ◽  
Mai Zhu ◽  
Zhe Chen ◽  
Wei-min Lei
Keyword(s):  
Chaotic Maps ◽  
Color Image ◽  
Logistic Map ◽  
Image Data ◽  
Input Image ◽  
Current State ◽  
Image Cipher ◽  
Plain Image ◽  
Hyperchaotic Lu System ◽  
Area Preserving

This paper suggests a new chaos-based color image cipher with an efficient substitution keystream generation strategy. The hyperchaotic Lü system and logistic map are employed to generate the permutation and substitution keystream sequences for image data scrambling and mixing. In the permutation stage, the positions of colored subpixels in the input image are scrambled using a pixel-swapping mechanism, which avoids two main problems encountered when using the discretized version of area-preserving chaotic maps. In the substitution stage, we introduce an efficient keystream generation method that can extract three keystream elements from the current state of the iterative logistic map. Compared with conventional method, the total number of iterations is reduced by 3 times. To ensure the robustness of the proposed scheme against chosen-plaintext attack, the current state of the logistic map is perturbed during each iteration and the disturbance value is determined by plain-pixel values. The mechanism of associating the keystream sequence with plain-image also helps accelerate the diffusion process and increase the degree of randomness of the keystream sequence. Experimental results demonstrate that the proposed scheme has a satisfactory level of security and outperforms the conventional schemes in terms of computational efficiency.

scholarly journals A Hardware Pseudo-Random Number Generator Using Stochastic Computing and Logistic Map

Micromachines ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 31
Author(s):  
Junxiu Liu ◽  
Zhewei Liang ◽  
Yuling Luo ◽  
Lvchen Cao ◽  
Shunsheng Zhang ◽  
...  
Keyword(s):  
Random Number ◽  
Chaotic Map ◽  
Logistic Map ◽  
Random Number Generator ◽  
Alternative Methods ◽  
Random Numbers ◽  
Number Generator ◽  
Stochastic Computing ◽  
Pseudo Random Number ◽  
Pseudo Random Number Generator

Recent research showed that the chaotic maps are considered as alternative methods for generating pseudo-random numbers, and various approaches have been proposed for the corresponding hardware implementations. In this work, an efficient hardware pseudo-random number generator (PRNG) is proposed, where the one-dimensional logistic map is optimised by using the perturbation operation which effectively reduces the degradation of digital chaos. By employing stochastic computing, a hardware PRNG is designed with relatively low hardware utilisation. The proposed hardware PRNG is implemented by using a Field Programmable Gate Array device. Results show that the chaotic map achieves good security performance by using the perturbation operations and the generated pseudo-random numbers pass the TestU01 test and the NIST SP 800-22 test. Most importantly, it also saves 89% of hardware resources compared to conventional approaches.

Sign in / Sign up

Export Citation Format

Share Document