scholarly journals A Parallel Encryption Algorithm Based on Piecewise Linear Chaotic Map

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Xizhong Wang ◽  
Deyun Chen
Keyword(s):  
Parallel Algorithm ◽  
Message Passing ◽  
Message Passing Interface ◽  
Multicore Processors ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
Communication Model ◽  
Piecewise Linear Chaotic Map ◽  
Encryption Decryption

We introduce a parallel chaos-based encryption algorithm for taking advantage of multicore processors. The chaotic cryptosystem is generated by the piecewise linear chaotic map (PWLCM). The parallel algorithm is designed with a master/slave communication model with the Message Passing Interface (MPI). The algorithm is suitable not only for multicore processors but also for the single-processor architecture. The experimental results show that the chaos-based cryptosystem possesses good statistical properties. The parallel algorithm provides much better performance than the serial ones and would be useful to apply in encryption/decryption file with large size or multimedia.

scholarly journals An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yuping Hu ◽  
Congxu Zhu ◽  
Zhijian Wang
Keyword(s):  
Image Encryption ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
Pseudorandom Sequences ◽  
Piecewise Linear Chaotic Map ◽  
Key Space ◽  
Plain Image ◽  
Image Encryption Algorithm

An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM) model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack.

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.

GENERALIZED ARITHMETIC CODING USING DISCRETE CHAOTIC MAPS

2012 ◽  
Vol 22 (10) ◽  
pp. 1250256 ◽  
Author(s):  
QIUZHEN LIN ◽  
KWOK-WO WONG ◽  
JIANYONG CHEN
Keyword(s):  
Chaotic Maps ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Interval Mapping ◽  
International Standards ◽  
Arithmetic Coding ◽  
Initial Value ◽  
Compression Performance ◽  
Piecewise Linear Chaotic Map ◽  
Generalized Arithmetic

Making use of the Lebesgue measure preserving property of the piecewise linear chaotic map, a discrete piecewise linear chaotic map is employed to perform the generalized arithmetic coding, which is an optimal entropy coding algorithm adopted by international standards. After a number of message symbols have been encoded by the reverse interval mapping, an enlargement on the encoding interval is performed and some codeword bits are exported accordingly. Based on the enlarged encoding interval, the subsequent symbols are encoded with the modified chaotic maps, the lower and upper bounds of which are determined by the final encoding interval of the symbols already encoded. In the decoding process, the message symbols are recovered by iterating the corresponding chaotic map from an appropriate initial value. The encoding interval enlargement is tracked by performing reverse interval mapping on the decoded symbols. More codeword bits are shifted into the register to form the initial value for decoding the subsequent symbols. Simulation results verify that the compression performance of our scheme is very close to the entropy bound and is comparable to traditional finite-precision arithmetic coding. In addition, cryptographic capability can be integrated into our scheme to make it a joint compression and encryption scheme. Its security is enhanced when compared with the existing schemes based on traditional arithmetic coding.

A Novel Joint for Image Encryption and Coding Using Piecewise Linear Chaotic Map

2016 ◽  
Vol 13 (10) ◽  
pp. 7137-7143
Author(s):  
Bin Wang ◽  
Shihua Zhou ◽  
Changjun Zhou ◽  
Xuedong Zheng
Keyword(s):  
Image Encryption ◽  
Binary Data ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Secret Key ◽  
Initial Value ◽  
Tent Map ◽  
Piecewise Linear Chaotic Map ◽  
Plain Image ◽  
Gray Level Image

Due to the features of chaotic maps, they are widely used into encrypting and coding information. Inspired by the tent map which is used to code and encrypt binary data, a novel joint for image encryption and coding based on piecewise linear chaotic map is proposed in this paper. We divide piecewise linear chaotic map into 256 parts according to the property of gray level image. In order to enhance the security of image, the image is subsequently encrypted by the piecewise linear chaotic map in which the secret key of image encryption is determined by the initial of chaotic map. This stage of image encryption possesses high key and plain-image sensitivities which results from the secret key related to plain-image. Finally, the encrypted image is coded by the piecewise linear chaotic map with a different initial value. The experimental results validate the effect of the proposed system and demonstrate that the encrypted and coded image is secure for transmission.

Deterministic stochastic resonance in a piecewise linear chaotic map

1998 ◽  
Vol 58 (6) ◽  
pp. 8009-8012 ◽  
Author(s):  
Sitabhra Sinha ◽  
Bikas K. Chakrabarti
Keyword(s):  
Stochastic Resonance ◽  
Piecewise Linear ◽  
Chaotic Map ◽  
Piecewise Linear Chaotic Map
Sign in / Sign up

Export Citation Format

Share Document