Two-Level Secret Key Image Encryption Method Based on Piecewise Linear Map and Logistic Map

2012 ◽  
Vol 241-244 ◽  
pp. 2728-2731
Author(s):  
Yong Zhang
Keyword(s):  
Image Encryption ◽  
Piecewise Linear ◽  
Logistic Map ◽  
Secret Key ◽  
Linear Map ◽  
Piecewise Linear Map ◽  
Encryption Schemes ◽  
Secret Keys ◽  
Secret Code ◽  
Encryption Method

Some chaos-based image encryption schemes using plain-images independent secret code streams have weak encryption security and are vulnerable to chosen plaintext and chosen cipher-text attacks. This paper proposed a two-level secret key image encryption method, where the first-level secret key is the private symmetric secret key, and the second-level secret key is derived from both the first-level secret key and the plain image by iterating piecewise linear map and Logistic map. Even though the first-level key is identical, the different plain images will produce different second-level secret keys and different secret code streams. The results show that the proposed has high encryption speed, and also can effectively resist chosen/known plaintext attacks.

Novel 3-D Image Encryption Using Computational Integral Imaging and Linear-Complemented MLCA

2013 ◽  
Vol 284-287 ◽  
pp. 2992-2997 ◽  
Author(s):  
Xiao Wei Li ◽  
Dong Hwan Kim ◽  
Sung Jin Cho ◽  
Seok Tae Kim
Keyword(s):  
Image Encryption ◽  
Three Dimensional ◽  
Experimental Results ◽  
Secret Key ◽  
Integral Imaging ◽  
Key Space ◽  
Lenslet Array ◽  
Encryption Schemes ◽  
Computational Integral Imaging ◽  
Encryption Method

Three dimensional (3-D) images encryption schemes can provide feasible and secure for images encryption due to the 3-D properties of images. In this paper, we present a novel 3-D images encryption algorithm by combining use of integral imaging (II) and maximum-length cellular automata (MLCA) as the secret key ciphering for 3D image encryption technique. In this proposed algorithm, a lenslet array first decomposes the 3-D object into 2-D elemental images (EIs) via the pick-up process of II. We encrypt the 2-D EIs with an encryption method based on linear and complemented MLCA. Decryption process is the opposite of operation encryption process: The 2-D EIs is recovered by the MLCA key, 3-D object is reconstructed by the recovered EIs via computational integral imaging (CII) reconstruction. To verify the usefulness of the proposed algorithm, we carry out the computational experiments and present the experimental results for various attacks. Experimental results show that the proposed algorithm can improve the performance of encryption against various attacks due to large key space in MLCA and 3-D characteristic of data redundancy.

Image Encryption Method Using Dependable Multiple Chaotic Logistic Functions

2021 ◽  
pp. 744-758
Author(s):  
Ranu Gupta ◽  
Rahul Pachauri ◽  
Ashutosh K. Singh
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Statistical Parameter ◽  
Logistic Function ◽  
Initial Condition ◽  
Secret Key ◽  
Real Time Applications ◽  
Encrypted Images ◽  
Encryption Method ◽  
Logistic Functions

This article explores an efficient way of image encryption using chaotic logistic function. A set of two chaotic logistic functions and a 256 bit long external secret key are employed to enhance the security in the encrypted images. The initial condition of first logistic function has been obtained by providing the suitable weights to all bits of the secret key. The initial condition of second logistic function has been derived from first chaotic logistic function. In this proposed algorithm, ten different operations are used to encrypt the pixel of an image. The outcome of the second logistic map decides the operation to be used in the encryption of the particular image pixel. Various statistical parameter comparisons show that the proposed algorithm provides an image encryption method with better security and efficiency for all real-time applications.

Image Encryption Method Using New Concept of Compound Blood Transfusion Rule with Multiple Chaotic Maps

2020 ◽  
Vol 16 (8) ◽  
pp. 1034-1043
Author(s):  
Ranu Gupta ◽  
Rahul Pachauri ◽  
Ashutosh Kumar Singh
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Logistic Function ◽  
Internet Technology ◽  
Initial Condition ◽  
Secret Key ◽  
Statistical Parameters ◽  
Multiple Chaotic Maps ◽  
Encrypted Images ◽  
Encryption Method

Introduction: With the advancement in internet technology, a large amount of information in the form of data and image is transferred from one end to the other. The information may be military, defense, medical, etc. which should be kept confidential by providing security. Objective: The aim of this article will be to provide security to the image. This is achieved by applying the image encryption method which converts the original information into an unreadable format. Methods: This work explores an efficient way of image encryption using a chaotic logistic function. A set of two chaotic logistic functions and 256 bit long external secret key are employed to enhance the security in the encrypted images. The initial condition of first logistic function has been obtained by providing the suitable weights to all bits of the secret key. The initial condition of second logistic function has been derived from the first chaotic logistic function. In this proposed algorithm, ten different operations are used to encrypt the pixel of an image. The outcome of the second logistic map decides the operation to be used in the encryption of the particular image pixel. Results: Various statistical parameters like NPCR, UACI and information entropy were calculated. Conclusion: Results show that the proposed algorithm provides an image encryption method with better security and efficiency for all real-time applications such as medical images.

Image Encryption Method Using Dependable Multiple Chaotic Logistic Functions

2019 ◽  
Vol 13 (4) ◽  
pp. 53-67 ◽  
Author(s):  
Ranu Gupta ◽  
Rahul Pachauri ◽  
Ashutosh K. Singh
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Statistical Parameter ◽  
Logistic Function ◽  
Initial Condition ◽  
Secret Key ◽  
Real Time Applications ◽  
Encrypted Images ◽  
Encryption Method ◽  
Logistic Functions

This article explores an efficient way of image encryption using chaotic logistic function. A set of two chaotic logistic functions and a 256 bit long external secret key are employed to enhance the security in the encrypted images. The initial condition of first logistic function has been obtained by providing the suitable weights to all bits of the secret key. The initial condition of second logistic function has been derived from first chaotic logistic function. In this proposed algorithm, ten different operations are used to encrypt the pixel of an image. The outcome of the second logistic map decides the operation to be used in the encryption of the particular image pixel. Various statistical parameter comparisons show that the proposed algorithm provides an image encryption method with better security and efficiency for all real-time applications.

scholarly journals How Many Inflections are There in the Lyapunov Spectrum?

2021 ◽  
Author(s):  
O. Jenkinson ◽  
M. Pollicott ◽  
P. Vytnova
Keyword(s):  
Piecewise Linear ◽  
Lyapunov Spectrum ◽  
Stat Phys ◽  
Linear Map ◽  
Piecewise Linear Map ◽  
Expanding Map ◽  
Lyapunov Spectra ◽  
Linear Maps ◽  
Inflection Points ◽  
Piecewise Linear Maps

AbstractIommi and Kiwi (J Stat Phys 135:535–546, 2009) showed that the Lyapunov spectrum of an expanding map need not be concave, and posed various problems concerning the possible number of inflection points. In this paper we answer a conjecture in Iommi and Kiwi (2009) by proving that the Lyapunov spectrum of a two branch piecewise linear map has at most two points of inflection. We then answer a question in Iommi and Kiwi (2009) by proving that there exist finite branch piecewise linear maps whose Lyapunov spectra have arbitrarily many points of inflection. This approach is used to exhibit a countable branch piecewise linear map whose Lyapunov spectrum has infinitely many points of inflection.

scholarly journals The Chaotic Saddle in the Lozi Map, Autonomous and Nonautonomous Versions

2015 ◽  
Vol 25 (13) ◽  
pp. 1550184 ◽  
Author(s):  
Carlos Lopesino ◽  
Francisco Balibrea-Iniesta ◽  
Stephen Wiggins ◽  
Ana M. Mancho
Keyword(s):  
Piecewise Linear ◽  
Linear Map ◽  
Piecewise Linear Map ◽  
The Third ◽  
Autonomous Version ◽  
Area Preserving ◽  
Chaotic Saddle

In this paper, we prove the existence of a chaotic saddle for a piecewise-linear map of the plane, referred to as the Lozi map. We study the Lozi map in its orientation and area preserving version. First, we consider the autonomous version of the Lozi map to which we apply the Conley–Moser conditions to obtain the proof of a chaotic saddle. Then we generalize the Lozi map on a nonautonomous version and we prove that the first and the third Conley–Moser conditions are satisfied, which imply the existence of a chaotic saddle. Finally, we numerically demonstrate how the structure of this nonautonomous chaotic saddle varies as parameters are varied.

A Novel Approach Using Steganography and Cryptography in Business Intelligence

2021 ◽  
pp. 192-217
Author(s):  
Sabyasachi Pramanik ◽  
Ramkrishna Ghosh ◽  
Mangesh M. Ghonge ◽  
Vipul Narayan ◽  
Mudita Sinha ◽  
...  
Keyword(s):  
Data Mining ◽  
Image Encryption ◽  
Encryption Scheme ◽  
Secret Key ◽  
Cryptographic Algorithm ◽  
Novel Approach ◽  
Optimal Accuracy ◽  
Direct Data ◽  
Lsb Technique ◽  
Encryption Method

In the information technology community, communication is a vital issue. And image transfer creates a major role in the communication of data through various insecure channels. Security concerns may forestall the direct sharing of information and how these different gatherings cooperatively direct data mining without penetrating information security presents a challenge. Cryptography includes changing over a message text into an unintelligible figure and steganography inserts message into a spread media and shroud its reality. Both these plans are successfully actualized in images. To facilitate a safer transfer of image, many cryptosystems have been proposed for the image encryption scheme. This chapter proposes an innovative image encryption method that is quicker than the current researches. The secret key is encrypted using an asymmetric cryptographic algorithm and it is embedded in the ciphered image using the LSB technique. Statistical analysis of the proposed approach shows that the researcher's approach is faster and has optimal accuracy.

DIGITAL CONTROL AS SOURCE OF CHAOTIC BEHAVIOR

2010 ◽  
Vol 20 (05) ◽  
pp. 1365-1378 ◽  
Author(s):  
GÁBOR CSERNÁK ◽  
GÁBOR STÉPÁN
Keyword(s):  
Mechanical System ◽  
Chaotic Behavior ◽  
Piecewise Linear ◽  
Linear Control ◽  
Control Loop ◽  
Digital Implementation ◽  
Linear Map ◽  
Piecewise Linear Map ◽  
Chaotic Vibrations ◽  
Processing Delay

In the present paper, we introduce and analyze a mechanical system, in which the digital implementation of a linear control loop may lead to chaotic behavior. The amplitude of such oscillations is usually very small, this is why these are called micro-chaotic vibrations. As a consequence of the digital effects, i.e. the sampling, the processing delay and the round-off error, the behavior of the system can be described by a piecewise linear map, the micro-chaos map. We examine a 2D version of the micro-chaos map and prove that the map is chaotic.

The Dynamics of a Piecewise Linear Map and its Smooth Approximation

1997 ◽  
Vol 07 (02) ◽  
pp. 351-372 ◽  
Author(s):  
D. Aharonov ◽  
R. L. Devaney ◽  
U. Elias
Keyword(s):  
Chaotic Behavior ◽  
Piecewise Linear ◽  
Invariant Curves ◽  
Smooth Approximation ◽  
Linear Map ◽  
Island Structure ◽  
The Real ◽  
Piecewise Linear Map ◽  
Real Analytic ◽  
Area Preserving

The paper describes the dynamics of a piecewise linear area preserving map of the plane, F: (x, y) → (1 - y - |x|, x), as well as that portion of the dynamics that persists when the map is approximated by the real analytic map Fε: (x, y) → (1 - y - fε(x), x), where fε(x) is real analytic and close to |x| for small values of ε. Our goal in this paper is to describe in detail the island structure and the chaotic behavior of the piecewise linear map F. Then we will show that these islands do indeed persist and contain infinitely many invariant curves for Fε, provided that ε is small.

Sign in / Sign up

Export Citation Format

Share Document