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

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.

Download Full-text

A Novel Encryption Scheme for Digital Image - Based on One Dimensional Logistic Map

Computer and Information Science ◽

10.5539/cis.v7n4p65 ◽

2014 ◽

Vol 7 (4) ◽

pp. 65 ◽

Cited By ~ 1

Author(s):

Obaida M. Al-hazaimeh

Keyword(s):

Image Encryption ◽

Digital Image ◽

Chaotic Map ◽

Logistic Map ◽

Encryption Scheme ◽

Table Lookup ◽

One Dimensional ◽

The Difference ◽

Digital Image Encryption ◽

High Level

In this paper, an implementation of digital image encryption scheme based on one dimensional logistic map is proposed. The chaotic cryptography technique concentrates in general on the symmetric key cryptographic technique. In the proposed algorithm, a random key table lookup criterion was combined with a one-dimensional chaotic map were used for high degree 2-stage security image encryption while maintaining acceptable overhead delay time. The proposed algorithm is based on image row shuffling and pixel-wise XOR encryption. To increase the security of row shuffling variable rotation and inversion were applied to each shuffled row, based on the difference between old and new row location. The experimental results showed that the proposed algorithm is effective and applicable. The combination of logistic map and key table lookup shows advantages of large random key space and high-level of security. The resulting cipher image is suitable for practical use in secure image storing and transmission.

Download Full-text

A Novel Chaotic Map and an Improved Chaos-Based Image Encryption Scheme

The Scientific World JOURNAL ◽

10.1155/2014/713541 ◽

2014 ◽

Vol 2014 ◽

pp. 1-8 ◽

Cited By ~ 9

Author(s):

Xianhan Zhang ◽

Yang Cao

Keyword(s):

Image Encryption ◽

Chaotic Map ◽

Logistic Map ◽

Security Analysis ◽

Encryption Scheme ◽

Tent Map ◽

One Dimensional ◽

Novel Approach ◽

Arnold’S Cat Map ◽

Encryption Method

In this paper, we present a novel approach to create the new chaotic map and propose an improved image encryption scheme based on it. Compared with traditional classic one-dimensional chaotic maps like Logistic Map and Tent Map, this newly created chaotic map demonstrates many better chaotic properties for encryption, implied by a much larger maximal Lyapunov exponent. Furthermore, the new chaotic map and Arnold’s Cat Map based image encryption method is designed and proved to be of solid robustness. The simulation results and security analysis indicate that such method not only can meet the requirement of imagine encryption, but also can result in a preferable effectiveness and security, which is usable for general applications.

Download Full-text

Chaotic Map for Securing Digital Content

International Journal of Rough Sets and Data Analysis ◽

10.4018/ijrsda.2016010102 ◽

2016 ◽

Vol 3 (1) ◽

pp. 20-35 ◽

Cited By ~ 5

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.

Download Full-text

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

Mathematical Problems in Engineering ◽

10.1155/2014/178959 ◽

2014 ◽

Vol 2014 ◽

pp. 1-17 ◽

Cited By ~ 11

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.

Download Full-text

A Fast Encryption Scheme Suitable for Video Surveillance Applications Using SHA-256 Hash Function and 1D Sine–Sine Chaotic Map

International Journal of Image and Graphics ◽

10.1142/s0219467821500224 ◽

2020 ◽

pp. 2150022

Author(s):

Kirtee Panwar ◽

Ravindra Kumar Purwar ◽

Garima Srivastava

Keyword(s):

Video Surveillance ◽

Image Encryption ◽

Chaotic Map ◽

Encryption Scheme ◽

Internal Working ◽

Key Space ◽

Higher Dimensional ◽

Secret Keys ◽

Plain Image ◽

Surveillance Applications

This paper proposes an image encryption technique which is fast and secure. The encryption scheme is designed for secure transmission of video surveillance data (keyframes) over insecure network. The image encryption technique employs 1D Sine–Sine system with better chaotic properties than its seed map and faster than higher-dimensional chaotic systems. Further, design of encryption scheme is based on two permutation rounds, which employs pixel swapping operation and diffusion operation which is simple and provides required security against plaintext, differential and various other attacks. Three separate chaotic sequences are generated using 1D Sine–Sine system which enhances the key space of the encryption scheme. Secret keys are updated dynamically with SHA-256 hash value obtained from plain image. Hash values of plain image are efficiently used without loss of any hash value information. This makes the encryption scheme plaintext sensitive and secure against plaintext attacks. Performance and security aspects of encryption scheme is analyzed both quantitatively using predefined security metrics and qualitatively by scrutinizing the internal working of encryption scheme. Computational complexity of encrypting a plain image of size [Formula: see text] is [Formula: see text] and is suitable for encrypting keyframes of video for secure surveillance applications.

Download Full-text

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

Entropy ◽

10.3390/e21050504 ◽

2019 ◽

Vol 21 (5) ◽

pp. 504 ◽

Cited By ~ 9

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.

Download Full-text

An image encryption scheme employing key related skipping

Journal of Electrical Engineering ◽

10.2478/jee-2018-0013 ◽

2018 ◽

Vol 69 (2) ◽

pp. 93-105 ◽

Cited By ~ 2

Author(s):

Jakub Oravec ◽

Ján Turán ◽

L’uboš Ovseník ◽

Tomáš Huszaník

Keyword(s):

Phase Space ◽

Image Encryption ◽

Statistical Tests ◽

Logistic Map ◽

Encryption Algorithm ◽

Encryption Scheme ◽

Image Pixels ◽

Encrypted Images ◽

Image Encryption Algorithm ◽

Chaotic Logistic Map

Abstract This paper describes an image encryption algorithm which utilizes chaotic logistic map. Values generated by this map are used in two steps of algorithm which shuffles image pixels and then changes their intensities. Design of the encryption scheme considers possibility of various attacks, such as statistical, differential or phase space reconstruction attacks. Robustness against last mentioned type of attacks is introduced by selective skipping of values generated by the map. This skipping depends on key entered by user. The paper also verifies properties of proposed algorithm by common measures and by set of statistical tests that examine randomness of computed encrypted images. Results are compared with other approaches and they are also briefly discussed.

Download Full-text

a novel one-dimensional chaotic map generator and its application in a new index representation-based image encryption scheme

Information Sciences ◽

10.1016/j.ins.2021.02.022 ◽

2021 ◽

Author(s):

Ali Mansouri ◽

Xingyuan Wang

Keyword(s):

Image Encryption ◽

Chaotic Map ◽

Encryption Scheme ◽

One Dimensional

Download Full-text

Efficient functional encryption for inner product with simulation-based security

Cybersecurity ◽

10.1186/s42400-020-00067-1 ◽

2021 ◽

Vol 4 (1) ◽

Author(s):

Wenbo Liu ◽

Qiong Huang ◽

Xinjian Chen ◽

Hongbo Li

Keyword(s):

Inner Product ◽

Encryption Scheme ◽

Secret Key ◽

Functional Encryption ◽

Private Key ◽

Simulation Based ◽

Encryption And Decryption ◽

The Standard Model ◽

Secret Keys ◽

Decisional Linear Assumption

AbstractFunctional encryption (FE) is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information. In FE, a user can learn specific function of encrypted messages by restricted functional key and reveal nothing else about the messages. Inner product encryption (IPE) is a special type of functional encryption where the decryption algorithm, given a ciphertext related to a vector x and a secret key related to a vector y, computes the inner product x·y. In this paper, we construct an efficient private-key functional encryption (FE) for inner product with simulation-based security, which is much stronger than indistinguishability-based security, under the External Decisional Linear assumption in the standard model. Compared with the existing schemes, our construction is faster in encryption and decryption, and the master secret key, secret keys and ciphertexts are shorter.

Download Full-text