scholarly journals Encryption Image by Using RC6 and Hybrid Chaotic Map

Webology ◽  
2020 ◽  
Vol 17 (2) ◽  
pp. 189-199
Author(s):  
Zahraa Faisal ◽  
Esraa H. Abdul Ameer
Keyword(s):  
Work Environment ◽  
Image Coding ◽  
Chaotic Map ◽  
Logistic Map ◽  
Frequency Test ◽  
Serial Test ◽  
Matlab Program ◽  
Block Entropy

Cryptography is data processed in a way that becomes incomprehensible and unavailable to unauthorized persons. In this paper instructed method to encryption image by using RC6 algorithm and generated key by using hybrid chaotic map (tent and logistic map). Used some measures such as frequency test within a block, entropy, serial test (two-bit test), and frequency test (monobit test); to demonstrate the strength of the algorithm proposed in the image coding and protection. The MATLAB program was used as a work environment.

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

2021 ◽  
Vol 10 (3) ◽  
pp. 1580-1588
Author(s):  
Omar Z. Akif ◽  
Sura Ali ◽  
Rasha Subhi Ali ◽  
Alaa Kadhim Farhan
Keyword(s):  
Chaotic System ◽  
Statistical Tests ◽  
Chaotic Map ◽  
Logistic Map ◽  
Input Device ◽  
Serial Test ◽  
A Value ◽  
Proposed Model ◽  
Initial States ◽  
Run Test

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.

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Second Phase ◽  
Cipher Text ◽  
The Face ◽  
Substitution Principle ◽  
2D Logistic Map ◽  
Image Encryption Algorithm

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.

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.

scholarly journals A Novel S-Box Dynamic Design Based on Nonlinear-Transform of 1D Chaotic Maps

Electronics ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1313
Author(s):  
Wenhao Yan ◽  
Qun Ding
Keyword(s):  
Chaotic Systems ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Sample Entropy ◽  
One Dimension ◽  
Linear Combinations ◽  
Dynamic Design ◽  
Construction Methods ◽  
Low Dimensional

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.

scholarly journals An Effective Framework for Chaotic Image Encryption Based on 3D Logistic Map

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Guodong Ye ◽  
Kaixin Jiao ◽  
Chen Pan ◽  
Xiaoling Huang
Keyword(s):  
Chaotic Map ◽  
Logistic Map ◽  
Security Analysis ◽  
Three Dimensional ◽  
Ecg Signal ◽  
Hash Algorithm ◽  
Plain Image ◽  
Secure Hash Algorithm ◽  
Low Sensitivity ◽  
Encryption Method

In this paper, an effective framework for chaotic encryption based on a three-dimensional logistic map is presented together with secure hash algorithm-3 (SHA-3) and electrocardiograph (ECG) signal. Following the analysis of the drawbacks, namely, fixed key and low sensitivity, of some current algorithms, this work tries to solve these two problems and includes two contributions: (1) removal of the phenomenon of summation invariance in a plain-image, for which SHA-3 is proposed to calculate the hash value for the plain-image, with the results being employed to influence the initial keys for chaotic map; (2) resolution of the problem of fixed key by using an ECG signal, that can be different for different subjects or different for same subject at different times. The Wolf algorithm is employed to produce all the control parameters and initial keys in the proposed encryption method. It is believed that combining with the classical architecture of permutation-diffusion, the summation invariance in the plain-image and shortcoming of a fixed key will be avoided in our algorithm. Furthermore, the experimental results and security analysis show that the proposed encryption algorithm can achieve confidentiality.

scholarly journals A Chaos based image Encryption Scheme using one Dimensional Exponential Logistic Map.

2019 ◽  
Vol 1 ◽  
pp. 223-237
Author(s):  
Terlumun Gbaden
Keyword(s):  
Correlation Coefficient ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Scheme ◽  
One Dimensional ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Encryption Decryption ◽  
Logistic Chaotic Map ◽  
Encrypted Images

The widespread use of images in various sectors of life makes its protection increasingly necessary and important. An improvement over encryption and decryption algorithm using exponential logistic chaotic map was proposed. In this work, we adopt an encryption/decryption strategy for colour images using the exponential logistic chaotic map. The proposed encryption/decryption algorithms are implemented in MATLAB for computer simulation. The experimental results indicate that the proposed algorithms can be used successfully to encrypt/decrypt images with secret keys. The performance analysis using histogram uniformity analysis and correlation coefficient show that the algorithms give larger space, quick speed and easy to realize. The encrypted images have good encryption effect and low correlation coefficient rendering it a good candidate for confidential and secure means of transmitting image information in untrusted networks.

Chaotic Map for Securing Digital Content

2016 ◽  
Vol 3 (1) ◽  
pp. 20-35 ◽  
Author(s):  
Dhiraj Pandey ◽  
U. S. Rawat
Keyword(s):  
Secret Sharing ◽  
Chaotic Map ◽  
Logistic Map ◽  
Visual Cryptography ◽  
Visual Quality ◽  
Digital Content ◽  
Digital Information ◽  
Pixel Expansion ◽  
Empirical Results ◽  
Logistic Chaotic Map

Progressive Visual Cryptography (PVC) is quite suitable for sharing sensitive digital data.Previous research on PVC, such as Fang et al. (2006) and W.P.Fang et al.(2008) were all carrying pixel-expansion problem and also gives a poor visual quality on the recovered stacked image. Recently, Hou&Quan (2011) have developed a progressive scheme for secret sharing. It is observed that shares generated by the scheme are free from pixel expansion problem, but shares are not fully secure. In this paper, a new progressive sharing algorithm based on logistic chaotic map has been proposed to overcome the said limitation of Hou (2011) scheme. The irregular outputs of the logistic map are used to encode a secret digital information carrying image. The performance of the algorithm in the scheme of Hou (2011) is critically analyzed and compared with new suggested scheme. Empirical results are presented to showcase the performance of the authors' proposed scheme in terms of its effectiveness (imperceptibility and security) and feasibility.

scholarly journals A New Two-Dimensional Mutual Coupled Logistic Map and Its Application for Pseudorandom Number Generator

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Xuan Huang ◽  
Lingfeng Liu ◽  
Xiangjun Li ◽  
Minrong Yu ◽  
Zijie Wu
Keyword(s):  
Statistical Tests ◽  
Chaotic Map ◽  
Logistic Map ◽  
Security Analysis ◽  
Three Dimensional ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
Two Dimensional ◽  
Practical Applications

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.

scholarly journals A Lightweight Image Encryption Algorithm Based on Message Passing and Chaotic Map

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Hui Liu ◽  
Bo Zhao ◽  
Jianwen Zou ◽  
Linquan Huang ◽  
Yifan Liu
Keyword(s):  
Image Encryption ◽  
Message Passing ◽  
High Speed ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Pseudorandom Sequence ◽  
Pseudorandom Sequences ◽  
Plain Image ◽  
Image Encryption Algorithm

The popularization of 5G and the development of cloud computing further promote the application of images. The storage of images in an untrusted environment has a great risk of privacy leakage. This paper outlines a design for a lightweight image encryption algorithm based on a message-passing algorithm with a chaotic external message. The message-passing (MP) algorithm allows simple messages to be passed locally for the solution to a global problem, which causes the interaction among adjacent pixels without additional space cost. This chaotic system can generate high pseudorandom sequences with high speed performance. A two-dimensional logistic map is utilized as a pseudorandom sequence generator to yield the external message sets of edge pixels. The external message can affect edge pixels, and then adjacent pixels interact with each other to produce an encrypted image. A MATLAB simulation shows the cipher-image performs fairly uniform distribution and has acceptable information entropy of 7.996749. The proposed algorithm reduces correlation coefficients from plain-image 1 to its cipher-image 0, which covers all of the plain-image characters with high computational efficiency (speed = 18.200374 Mbit/s). Theoretical analyses and experimental results prove the proposed algorithm’s persistence to various existing attacks with low cost.

scholarly journals An Investigation into the Performance of Particle Swarm Optimization with Various Chaotic Maps

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
Akugbe Martins Arasomwan ◽  
Aderemi Oluyinka Adewumi
Keyword(s):  
Particle Swarm Optimization ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Particle Swarm ◽  
Test Problems ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Mathematical Problems ◽  
Logistic Chaotic Map

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.

Sign in / Sign up

Export Citation Format

Share Document