Image encryption algorithm based on Lorenz chaotic map with dynamic secret keys

Al-Hazaimeh, Obaida M.; Al–Jamal, Mohammad F.; Alhindawi, Nouh; Omari, Abedalkareem

doi:10.1007/s00521-017-3195-1

Cited by 63 publications

(32 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[20] proposed the use of a hyperchaotic system to scramble and diffuse images to achieve the purpose of image encryption. [21] proposed a discrete Lorenz map applied to compressed data, and applied the algorithm in the field of image encryption. [22] Utilizing the characteristics of quaternions, a new S-box was constructed based on the Lorenz system.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption Algorithm Based on Logistic and Two-Dimensional Lorenz

Liang

2020

IEEE Access

View full text Add to dashboard Cite

In recent years, experts and scholars in the field of information security have attached great importance to the security of image information. They have proposed many image encryption algorithms with higher security. In order to further improve the security level of image encryption algorithm, this paper proposes a new image encryption algorithm based on two-dimensional Lorenz and Logistic. The encryption test of several classic images proves that the algorithm has high security and strong robustness. This paper also analyzes the security of encryption algorithms, such as analysis of the histogram, entropy process of information, examination of correlation, differential attack, key sensitivity test, secret key space analysis, noise attacks, contrast analysis. By comparing the image encryption algorithm proposed in this paper with some existing image encryption algorithms, the encryption algorithm has the characteristics of large secret key space, sensitivity to the key, small correlation coefficient and high contrast. In addition, the encryption algorithm is used. It can also resist noise attacks.

show abstract

Section: Introductionmentioning

confidence: 99%

Image Encryption Algorithm Based on Logistic and Two-Dimensional Lorenz

Liang

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Chaotic theory has been heavily used in designing secure communication protocols since the 1990s [10][11][12][13][14][15], while chaotic maps have been utilized in the design of symmetric encryption protocols in [16][17][18][19]. Designing a chaotic map setting is usually difficult, but generally creates secure and efficient protocols.…”

Section: Chaotic Mapsmentioning

confidence: 99%

A new RSA public key encryption scheme with chaotic maps

Tahat¹,

Tahat²,

Abu-Dalu³

et al. 2020

IJECE

Self Cite

View full text Add to dashboard Cite

Public key cryptography has received great attention in the field of information exchange through insecure channels. In this paper, we combine the Dependent-RSA (DRSA) and chaotic maps (CM) to get a new secure cryptosystem, which depends on both integer factorization and chaotic maps discrete logarithm (CMDL). Using this new system, the scammer has to go through two levels of reverse engineering, concurrently, so as to perform the recovery of original text from the cipher-text has been received. Thus, this new system is supposed to be more sophisticated and more secure than other systems. We prove that our new cryptosystem does not increase the overhead in performing the encryption process or the decryption process considering that it requires minimum operations in both. We show that this new cryptosystem is more efficient in terms of performance compared with other encryption systems, which makes it more suitable for nodes with limited computational ability.

show abstract

“…Lorenz system is a dynamical system which was studied first by Edward Norton Lorenz around 1960 [24], This chaotic system is described by non-linear system of ordinary differential equations (i.e., ODEs) as given in (1).…”

Section: Lorenz Chaotic Systemmentioning

confidence: 99%

“…To ensure the security against brute-force attacks, the excellent encrypted speech quality must be sensitive in extreme way with respect to the secret keys [24,29]. In the proposed algorithm, any slightly change (i.e., bit flip) on the following sensitivity factors: hash values, keys, and other encryption keys such as parameters that would generate a completely different decryption results as shown in Figure 7.…”

Section: Key Sensitivity Testmentioning

confidence: 99%

A new dynamic speech encryption algorithm based on lorenz chaotic map over internet protocol

Al-Hazaimeh

2020

IJECE

Self Cite

View full text Add to dashboard Cite

This paper introduces a dynamic speech encryption algorithm based on Lorenz chaotic map over internet protocol to enhance the services of the real-time applications such as increases the security level and reduces latency. The proposed algorithm was divided into two processes: dynamic key generation process using 128-bit hash value to dynamically alter the initial secret keys, and encryption and decryption process using Lorenz system. In the proposed algorithm, the performance evaluation is carried out through efficient simulations and implementations and statistical analysis. In addition, the average time delay in the proposed algorithm and some of the existing algorithms such as AES is compared. The obtained results concluded that, the proposed dynamic speech encryption algorithm is effectually secured against various cryptanalysis attacks and has useful cryptographic properties such as confusion and diffusion for better voice communication in the voice applications field in the Internet.

show abstract

Image encryption algorithm based on Lorenz chaotic map with dynamic secret keys

Cited by 63 publications

References 21 publications

Image Encryption Algorithm Based on Logistic and Two-Dimensional Lorenz

Image Encryption Algorithm Based on Logistic and Two-Dimensional Lorenz

A new RSA public key encryption scheme with chaotic maps

A new dynamic speech encryption algorithm based on lorenz chaotic map over internet protocol

Contact Info

Product

Resources

About