scholarly journals Image Encryption Using Elliptic Curves and Rossby/Drift Wave Triads

Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 454
Author(s):  
Ikram Ullah ◽  
Umar Hayat ◽  
Miguel D. Bustamante
Keyword(s):  
Elliptic Curves ◽  
Image Encryption ◽  
Image Database ◽  
Random Numbers ◽  
Substitution Box ◽  
Elliptic Surfaces ◽  
Second Stage ◽  
Drift Wave ◽  
Plain Image ◽  
Resonant Triads

We propose an image encryption scheme based on quasi-resonant Rossby/drift wave triads (related to elliptic surfaces) and Mordell elliptic curves (MECs). By defining a total order on quasi-resonant triads, at a first stage we construct quasi-resonant triads using auxiliary parameters of elliptic surfaces in order to generate pseudo-random numbers. At a second stage, we employ an MEC to construct a dynamic substitution box (S-box) for the plain image. The generated pseudo-random numbers and S-box are used to provide diffusion and confusion, respectively, in the tested image. We test the proposed scheme against well-known attacks by encrypting all gray images taken from the USC-SIPI image database. Our experimental results indicate the high security of the newly developed scheme. Finally, via extensive comparisons we show that the new scheme outperforms other popular schemes.

scholarly journals Adaptive Chaotic Image Encryption Algorithm Based on RNA and Pixel Depth

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1770
Author(s):  
Xiaoqiang Zhang ◽  
Xuangang Yan
Keyword(s):  
Image Encryption ◽  
Three Dimensional ◽  
Encryption Algorithm ◽  
Current Time ◽  
Plain Image ◽  
Scope Of Application ◽  
Selective Diffusion ◽  
Chaotic Image Encryption ◽  
And Diffusion ◽  
Image Encryption Algorithm

To prevent the leakage of image content, image encryption technology has received increasing attention. Most current algorithms are only suitable for the images of certain types and cannot update keys in a timely manner. To tackle such problems, we propose an adaptive chaotic image encryption algorithm based on RNA and pixel depth. Firstly, a novel chaotic system, two-dimensional improved Logistic-adjusted-Sine map is designed. Then, we propose a three-dimensional adaptive Arnold transform for scrambling. Secondly, keys are generated by the hash values of the plain image and current time to achieve one-image, one-key, and one-time pad simultaneously. Thirdly, we build a pre-permuted RNA cube for 3D adaptive scrambling by pixel depth, chaotic sequences, and adaptive RNA coding. Finally, selective diffusion combined with pixel depth and RNA operations is performed, in which the RNA operators are determined by the chemical structure and properties of amino acids. Pixel depth is integrated into the whole procedure of parameter generation, scrambling, and diffusion. Experiments and algorithm analyses show that our algorithm has strong security, desirable performance, and a broader scope of application.

scholarly journals An Efficient Method of Image Encryption Using Rossler Chaotic System

2021 ◽  
Vol 10 (2) ◽  
pp. 11
Author(s):  
Yasir Ahmed Hamza ◽  
Marwan Dahar Omer
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Initial Conditions ◽  
Computation Time ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Symmetric Encryption ◽  
New Approach ◽  
System Parameters ◽  
Plain Image

In this study, a new approach of image encryption has been proposed. This method is depends on the symmetric encryption algorithm RC4 and Rossler chaotic system. Firstly, the encryption key is employed to ciphering a plain image using RC4 and obtains a ciphered-image. Then, the same key is used to generate the initial conditions of the Rossler system. The system parameters and the initial conditions are used as the inputs for Rossler chaotic system to generate the 2-dimensional array of random values. The resulted array is XORed with the ciphered-image to obtain the final encrypted-image. Based on the experimental results, the proposed method has achieved high security and less computation time. Also, the proposed method can be resisted attacks like (statistical, brute-force, and differential).

scholarly journals Cryptanalysis of a New Chaotic Image Encryption Technique Based on Multiple Discrete Dynamical Maps

Entropy ◽  
2021 ◽  
Vol 23 (12) ◽  
pp. 1581
Author(s):  
Haiju Fan ◽  
Chenjiu Zhang ◽  
Heng Lu ◽  
Ming Li ◽  
Yanfang Liu
Keyword(s):  
Image Encryption ◽  
Strong Correlation ◽  
Digital Images ◽  
Computational Cost ◽  
Encryption Scheme ◽  
Discrete Dynamic ◽  
Diffusion Structure ◽  
Plain Image ◽  
Simulation Results ◽  
Chaotic Image Encryption

Recently, a new chaotic image encryption technique was proposed based on multiple discrete dynamic maps. The authors claim that the scheme can provide excellent privacy for traditional digital images. However, in order to minimize the computational cost, the encryption scheme adopts one-round encryption and a traditional permutation–diffusion structure. Through cryptanalysis, there is no strong correlation between the key and the plain image, which leads to the collapse of cryptosystem. Based on this, two methods of chosen-plaintext attacks are proposed in this paper. The two methods require 3 pairs and 258 pairs of plain and cipher images, respectively, to break the original encryption system. The simulation results show the effectiveness of the two schemes.

scholarly journals Points of low height on elliptic surfaces with torsion

2010 ◽  
Vol 13 ◽  
pp. 370-387
Author(s):  
Sonal Jain
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Open Subset ◽  
Function Field ◽  
Rational Point ◽  
Torsion Point ◽  
Integral Points ◽  
Elliptic Surfaces ◽  
Canonical Height

AbstractWe determine the smallest possible canonical height$\hat {h}(P)$for a non-torsion pointPof an elliptic curveEover a function field(t) of discriminant degree 12nwith a 2-torsion point forn=1,2,3, and with a 3-torsion point forn=1,2. For eachm=2,3, we parametrize the set of triples (E,P,T) of an elliptic curveE/with a rational pointPandm-torsion pointTthat satisfy certain integrality conditions by an open subset of2. We recover explicit equations for all elliptic surfaces (E,P,T) attaining each minimum by locating them as curves in our projective models. We also prove that forn=1,2 , these heights are minimal for elliptic curves over a function field of any genus. In each case, the optimal (E,P,T) are characterized by their patterns of integral points.

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.

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.

A new technique for designing 8 × 8 substitution box for image encryption applications

2017 ◽  
Author(s):  
Fadia Ali Khan ◽  
Jameel Ahmed ◽  
Jan Sher Khan ◽  
Jawad Ahmad ◽  
Muazzam A. Khan ◽  
...  
Keyword(s):  
Image Encryption ◽  
New Technique ◽  
Substitution Box ◽  
A New Technique

A Wheel-Switch Selective Image Encryption Scheme Using Spatiotemporal Chaotic System

2014 ◽  
Vol 69 (1-2) ◽  
pp. 61-69 ◽  
Author(s):  
Xing-Yuan Wang ◽  
Xue-Mei Bao
Keyword(s):  
Theoretical Analysis ◽  
Image Encryption ◽  
Chaotic System ◽  
Initial Conditions ◽  
Image Data ◽  
Encryption Scheme ◽  
Cyclic Shift ◽  
Coupling Constant ◽  
Plain Image ◽  
Spatiotemporal Chaotic System

In this paper, we propose a novel selective image encryption scheme using a one-way coupled map lattice (CML) consisting of logistic maps and a selector constructed by two variants of a cyclic shift register (VCSR). The initial conditions and the coupling constant of CML in our scheme are influenced by all the contents of the plain image. Moreover, the selector is closely related to the nonencrypted part of the plain image. In addition, we select only a portion of image data to encrypt via a wheel-switch scheme governed by the selector. Users can select an appropriate proportion to encrypt the plain image for their different demands of security and efficiency. Experimental results and theoretical analysis show that the cryptosystem is effective and can resist various typical attacks.

A novel image encryption algorithm based on the chaotic system and DNA computing

2017 ◽  
Vol 28 (05) ◽  
pp. 1750069 ◽  
Author(s):  
Xiuli Chai ◽  
Zhihua Gan ◽  
Yang Lu ◽  
Yiran Chen ◽  
Daojun Han
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Dna Computing ◽  
Encryption Algorithm ◽  
Dna Encoding ◽  
Xor Operation ◽  
Position Sequence ◽  
Plain Image ◽  
Bit Plane ◽  
Image Encryption Algorithm

A novel image encryption algorithm using the chaotic system and deoxyribonucleic acid (DNA) computing is presented. Different from the traditional encryption methods, the permutation and diffusion of our method are manipulated on the 3D DNA matrix. Firstly, a 3D DNA matrix is obtained through bit plane splitting, bit plane recombination, DNA encoding of the plain image. Secondly, 3D DNA level permutation based on position sequence group (3DDNALPBPSG) is introduced, and chaotic sequences generated from the chaotic system are employed to permutate the positions of the elements of the 3D DNA matrix. Thirdly, 3D DNA level diffusion (3DDNALD) is given, the confused 3D DNA matrix is split into sub-blocks, and XOR operation by block is manipulated to the sub-DNA matrix and the key DNA matrix from the chaotic system. At last, by decoding the diffused DNA matrix, we get the cipher image. SHA 256 hash of the plain image is employed to calculate the initial values of the chaotic system to avoid chosen plaintext attack. Experimental results and security analyses show that our scheme is secure against several known attacks, and it can effectively protect the security of the images.

Sign in / Sign up

Export Citation Format

Share Document