Random Search Based Efficient Chaotic Substitution Box Design for Image Encryption

2018 ◽  
Vol 5 (2) ◽  
pp. 131-147 ◽  
Author(s):  
Musheer Ahmad ◽  
Zishan Ahmad
Keyword(s):  
Secure Communication ◽  
Design Methodology ◽  
Random Search ◽  
Statistical Tests ◽  
Chaotic Map ◽  
Substitution Box ◽  
Differential Uniformity ◽  
Substitution Boxes ◽  
Plain Image ◽  
New Challenges

Cryptographic Substitution-boxes are source of nonlinearity in modern block encryption systems. The robustness and confusion imparted through these systems heavily rely on the strength of their S-boxes. This brings new challenges to design cryptographically potent S-boxes to develop strong encryption systems. In this paper, an effective method to design efficient 8×8 S-box is proposed. The design methodology incorporates piece-wise linear chaotic map based random search. The S-box obtained by the proposed methodology is tested against standard statistical tests like bijective property, strict avalanche criteria, nonlinearity, differential uniformity, bits independent criteria, and linear approximation probability, revealing its outstanding performance. The proposed S-box is compared with some recent chaos-based 8×8 S-boxes. Moreover, the proposed S-box is applied to encrypt plain-image with proposed S-box transformation to unveil and highlight its inherent great encryption strength. The results confirm that the design is consistent and suitable for building strong encryption systems for secure communication.

scholarly journals Efficient Chaos-Based Substitution-Box and Its Application to Image Encryption

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1392
Author(s):  
Ahmed A. Abd El-Latif ◽  
Bassem Abd-El-Atty ◽  
Akram Belazi ◽  
Abdullah M. Iliyasu
Keyword(s):  
High Performance ◽  
Chaotic Systems ◽  
Chaotic Map ◽  
Input Image ◽  
Gray Codes ◽  
Secret Key ◽  
Substitution Box ◽  
3 Dimensional ◽  
Substitution Boxes ◽  
Image Cryptosystem

Chaotic systems are vital in designing contemporary cryptographic systems. This study proposes an innovative method for constructing an effective substitution box using a 3-dimensional chaotic map. Moreover, bouyed by the efficiency of the proposed chaos-based substitution boxes’ effectiveness, we introduce a new chaos-based image cryptosystem that combines the adeptness of Gray codes, a non-linear and sensitive hyper-chaotic system, and the proposed S-box. The generated secret key emanating from the cryptosystem is correlated to the input image to produce a unique key for each image. Extensive experimental outcomes demonstrate the utility, effectiveness, and high performance of the resulting cryptosystem.

scholarly journals The Dynamic Analysis of a Novel Reconfigurable Cubic Chaotic Map and Its Application in Finite Field

Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1420
Author(s):  
Chuanfu Wang ◽  
Yi Di ◽  
Jianyu Tang ◽  
Jing Shuai ◽  
Yuchen Zhang ◽  
...  
Keyword(s):  
Secure Communication ◽  
Chaotic Map ◽  
Digital Circuit ◽  
Pseudorandom Sequence ◽  
Periodic Behavior ◽  
Output Sequence ◽  
Digital Devices ◽  
Theoretical And Numerical Analysis ◽  
Dynamic Degradation ◽  
Sequence Generator

Dynamic degradation occurs when chaotic systems are implemented on digital devices, which seriously threatens the security of chaos-based pseudorandom sequence generators. The chaotic degradation shows complex periodic behavior, which is often ignored by designers and seldom analyzed in theory. Not knowing the exact period of the output sequence is the key problem that affects the application of chaos-based pseudorandom sequence generators. In this paper, two cubic chaotic maps are combined, which have symmetry and reconfigurable form in the digital circuit. The dynamic behavior of the cubic chaotic map and the corresponding digital cubic chaotic map are analyzed respectively, and the reasons for the complex period and weak randomness of output sequences are studied. On this basis, the digital cubic chaotic map is optimized, and the complex periodic behavior is improved. In addition, a reconfigurable pseudorandom sequence generator based on the digital cubic chaotic map is constructed from the point of saving consumption of logical resources. Through theoretical and numerical analysis, the pseudorandom sequence generator solves the complex period and weak randomness of the cubic chaotic map after digitization and makes the output sequence have better performance and less resource consumption, which lays the foundation for applying it to the field of secure communication.

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 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 More Low Differential Uniformity Permutations over F22k with k Odd

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Yue Leng ◽  
Jinyang Chen ◽  
Tao Xie
Keyword(s):  
Block Ciphers ◽  
Algebraic Degree ◽  
Differential Uniformity ◽  
Numerical Examples ◽  
High Nonlinearity ◽  
Substitution Boxes ◽  
Theoretical Results

Permutations with low differential uniformity, high algebraic degree, and high nonlinearity over F22k can be used as the substitution boxes for many block ciphers. In this paper, several classes of low differential uniformity permutations are constructed based on the method of choosing two permutations over F22k to get the desired permutations. The resulted low differential uniformity permutations have high algebraic degrees and nonlinearities simultaneously, which provide more choices for the substitution boxes. Moreover, some numerical examples are provided to show the efficacy of the theoretical results.

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 Sine-Cosine Optimization-Based Bijective Substitution-Boxes Construction Using Enhanced Dynamics of Chaotic Map

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Amer Awad Alzaidi ◽  
Musheer Ahmad ◽  
Hussam S. Ahmed ◽  
Eesa Al Solami
Keyword(s):  
Fitness Function ◽  
Chaotic Map ◽  
Search Space ◽  
Initial Population ◽  
Substitution Boxes ◽  
Novel Method ◽  
Sine Cosine Algorithm ◽  
And Performance ◽  
Optimization Mechanism ◽  
Independence Criterion

This paper proposes a novel method of constructing strong substitution-boxes (S-boxes) of order n (4 ≤ n ≤ 8) based on a recent optimization algorithm known as sine-cosine algorithm (SCA). The paper also proposes a new 1D chaotic map, which owns enhanced dynamics compared to conventional chaotic map, for generating initial population of S-boxes and facilitating the optimization mechanism of SCA. The proposed method applies the SCA with enhanced chaotic map to explore and exploit the search space for obtaining optimized S-boxes on the basis of maximization of nonlinearity as fitness function. The S-box construction involves three phases such as initialization of population, optimization, and adjustment. The simulation and performance analyses are done using standard measures of nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, and autocorrelation function. The obtained experimental results are compared with some immediate optimization-based and other S-boxes to show the strength of proposed method for constructing bijective S-boxes of salient cryptographic features.

Hopes and fears

2015 ◽  
Vol 29 (3) ◽  
pp. 27-29
Keyword(s):  
Design Methodology ◽  
Reading Time ◽  
Business Organizations ◽  
Operating Environment ◽  
Content Type ◽  
Technological Developments ◽  
Pertinent Information ◽  
New Challenges ◽  
The One ◽  
Practical Implications

Purpose – This paper aims to review the latest management developments across the globe and pinpoint practical implications from cutting-edge research and case studies. Design/methodology/approach – This briefing is prepared by an independent writer who adds their own impartial comments and places the articles in context. Findings – To say it is tough for business organizations today would be a massive understatement. Thanks largely to globalization and technological developments, the operating environment has arguably become more competitive than ever before. Firms thus need to constantly evolve in order to meet the array of new challenges which regularly face them. For those unable to adapt, survival and prosperity may ultimately be elusive. Change has invariably proved to be something of a double-edged sword. On the one hand, it can signal opportunity and prompt excitement and anticipation. But many others see change in terms of threat. Practical implications – The paper provides strategic insights and practical thinking that have influenced some of the world’s leading organizations. Originality/value – The briefing saves busy executives and researchers hours of reading time by selecting only the very best, most pertinent information and presenting it in a condensed and easy-to-digest format.

scholarly journals Evolving Dynamic S-Boxes Using Fractional-Order Hopfield Neural Network Based Scheme

Entropy ◽  
2020 ◽  
Vol 22 (7) ◽  
pp. 717 ◽  
Author(s):  
Musheer Ahmad ◽  
Eesa Al-Solami
Keyword(s):  
Neural Network ◽  
Fractional Order ◽  
Hopfield Neural Network ◽  
Performance Assessments ◽  
Comparison Analysis ◽  
Differential Uniformity ◽  
High Nonlinearity ◽  
Substitution Boxes ◽  
Strict Avalanche Criterion ◽  
Independence Criterion

Static substitution-boxes in fixed structured block ciphers may make the system vulnerable to cryptanalysis. However, key-dependent dynamic substitution-boxes (S-boxes) assume to improve the security and robustness of the whole cryptosystem. This paper proposes to present the construction of key-dependent dynamic S-boxes having high nonlinearity. The proposed scheme involves the evolution of initially generated S-box for improved nonlinearity based on the fractional-order time-delayed Hopfield neural network. The cryptographic performance of the evolved S-box is assessed by using standard security parameters, including nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, etc. The proposed scheme is able to evolve an S-box having mean nonlinearity of 111.25, strict avalanche criteria value of 0.5007, and differential uniformity of 10. The performance assessments demonstrate that the proposed scheme and S-box have excellent features, and are thus capable of offering high nonlinearity in the cryptosystem. The comparison analysis further confirms the improved security features of anticipated scheme and S-box, as compared to many existing chaos-based and other S-boxes.

Sign in / Sign up

Export Citation Format

Share Document