A new fractional one dimensional chaotic map and its application in high-speed image encryption

2021 ◽  
Vol 550 ◽  
pp. 13-26
Author(s):  
Mohamed Zakariya Talhaoui ◽  
Xingyuan Wang
Keyword(s):  
Image Encryption ◽  
High Speed ◽  
Chaotic Map ◽  
One Dimensional

scholarly journals A New One-Dimensional Compound Chaotic System and Its Application in High-Speed Image Encryption

2021 ◽  
Vol 11 (23) ◽  
pp. 11206
Author(s):  
Shenli Zhu ◽  
Xiaoheng Deng ◽  
Wendong Zhang ◽  
Congxu Zhu
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Network Communication ◽  
One Dimensional ◽  
Image Encryption Algorithm

In the edge computing and network communication environment, important image data need to be transmitted and stored securely. Under the condition of limited computing resources, it is particularly necessary to design effective and fast image encryption algorithms. One-dimensional (1D) chaotic maps provide an effective solution for real-time image encryption, but most 1D chaotic maps have only one parameter and a narrow chaotic interval, which has the disadvantage of security. In this paper, a new compound 1D chaotic map composed of a logistic map and tent map is proposed. The new system has two system parameters and an arbitrarily large chaotic parameter interval, and its chaotic signal is evenly distributed in the whole value space so it can improve the security in the application of information encryption. Furthermore, based on the new chaotic system, a fast image encryption algorithm is proposed. The algorithm takes the image row (column) as the cyclic encryption unit, and the time overhead is greatly reduced compared with the algorithm taking the pixel as the encryption unit. In addition, the mechanism of intermediate key associated with image content is introduced to improve the ability of the algorithm to resist chosen-plaintext attack and differential attack. Experiments show that the proposed image encryption algorithm has obvious speed advantages and good cryptographic performance, showing its excellent application potential in secure network communication.

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 A Simple Chaotic Map Model for Fractal Traffic Flows in High-speed Computer Networks (Extended and Renewed Version)

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Computer Networks ◽  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Speed Computer

This paper presents an extension of the models used to generate fractal traffic flows in high-speed computer networks by means of the formulation of a model that considers the use of one-dimensional chaotic maps. Based on the disaggregation of the temporal series generated, a valid explanation of behavior of the values of Hurst exponent is proposed and the feasibility of their control from the parameters of the proposed model is shown.

scholarly journals A Symmetric Image Encryption Algorithm Based on a Coupled Logistic–Bernoulli Map and Cellular Automata Diffusion Strategy

Entropy ◽  
2019 ◽  
Vol 21 (5) ◽  
pp. 504 ◽  
Author(s):  
Wei Zhang ◽  
Zhiliang Zhu ◽  
Hai Yu
Keyword(s):  
Cellular Automata ◽  
Image Encryption ◽  
High Efficiency ◽  
Chaotic Map ◽  
Logistic Map ◽  
Three Dimensional ◽  
Encryption Algorithm ◽  
Original Structure ◽  
One Dimensional ◽  
Image Encryption Algorithm

In this paper, the properties of the classical confusion–substitution structure and some recently proposed pseudorandom number generators using one-dimensional chaotic maps are investigated. To solve the low security problem of the original structure, a new bit-level cellular automata strategy is used to improve the sensitivity to the cryptosystem. We find that the new evolution effects among different generations of cells in cellular automata can significantly improve the diffusion effect. After this, a new one-dimensional chaotic map is proposed, which is constructed by coupling the logistic map and the Bernoulli map (LBM). The new map exhibits a much better random behavior and is more efficient than comparable ones. Due to the favorable properties of the new map and cellular automata algorithm, we propose a new image-encryption algorithm in which three-dimensional bit-level permutation with LBM is employed in the confusion phase. Simulations are carried out, and the results demonstrate the superior security and high efficiency of the proposed scheme.

scholarly journals A simple chaotic map model for fractal traffic generation in high-speed computer networks (Draft 2)

2021 ◽  
Author(s):  
Ginno Millán
Keyword(s):  
Hurst Exponent ◽  
High Speed ◽  
Chaotic Maps ◽  
Chaotic Map ◽  
Traffic Flows ◽  
One Dimensional ◽  
Temporal Series ◽  
Proposed Model ◽  
Traffic Generation ◽  
Speed Computer

An extension of the models used to generate fractal traffic flows is presented by means of the formulation of a model that considers the use of one-dimensional chaotic maps. Based on the disaggregation of the temporal series generated by the model, a valid explanation of behavior of the values of Hurst exponent is proposed and the feasibility of their control from the parameters of the proposed model is shown.

Sign in / Sign up

Export Citation Format

Share Document