A chaotic map with trigonometric functions: Dynamical analysis and its application in image encryption based on sparse representation and convolutional filters

Sriram, Balakrishnan; Ghaffari, Aboozar; Rajagopal, Karthikeyan; Jafari, Sajad; Tlelo-Cuautle, Esteban

doi:10.1016/j.ijleo.2022.170379

Cited by 11 publications

(5 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 21 gives test results for these two special images. So, one can see that the cipher images do not exhibit any regular or special information [47][48][49][50]. Then, the histograms also indicate uniform distribution for pixels in the cipher images.…”

Section: Chosen-plaintext Attack Analysismentioning

confidence: 96%

Image encryption scheme based on pseudo-DWT and cubic S-box

Qiao,

Mei,

Jia

et al. 2024

Phys. Scr.

View full text Add to dashboard Cite

Combining a pseudo-Discrete Wavelet Transform (pseudo-DWT) and a novel cubic S-box technique, an image encryption scheme using a newly-developed four-dimensional hyperchaotic system (NewHS) is presented in this paper. The principal advantage of this method resides in its enhanced security, with hash values (computed by SHA-256) of the plaintext, thereby bolstering resistance to chosen-plaintext attack. Initially, a novel three-dimensional cubic S-box is designed via chaotic sequence, increasing the complexity and randomness. Subsequently, the proposed scheme employs a Ladder permutation for image scrambling, achieving a one-time pad encryption effect. Finally, a pseudo-DWT is devised to segment and reconstruct the image, implementing scrambling and diffusion encryption. Moreover, experiments and security analysis also prove that the proposed encryption scheme can show good performance.

show abstract

Section: Chosen-plaintext Attack Analysismentioning

confidence: 96%

Image encryption scheme based on pseudo-DWT and cubic S-box

Qiao,

Mei,

Jia

et al. 2024

Phys. Scr.

View full text Add to dashboard Cite

show abstract

“…Chaos is renowned for its sensitivity to initial values and the unpredictable nature of the sequences it generates [2,3]. In recent years, chaotic maps have found extensive applications in the realm of encryption [4][5][6][7][8][9][10][11][12]. However, traditional low-dimensional chaotic systems exhibit certain shortcomings in cryptographic applications, such as discontinuous chaotic intervals and predictable chaotic signals.…”

Section: Introductionmentioning

confidence: 99%

Application of high performance one-dimensional chaotic map in key expansion algorithm

2023

Preprint

View full text Add to dashboard Cite

In this paper, we present a key expansion algorithm based on a high-performance one-dimensional chaotic map. Traditional one-dimensional chaotic maps exhibit several limitations, prompting us to construct a new map that overcomes these shortcomings. By analyzing the structural characteristics of classic 1D chaotic maps, we propose a high-performance 1D map that outperforms multidimensional maps introduced by numerous researchers in recent years. In block cryptosystems, the security of round keys is of utmost importance. To ensure the generation of secure round keys, a sufficiently robust key expansion algorithm is required. The security of round keys is assessed based on statistical independence and sensitivity to the initial key. Leveraging the properties of our constructed high-performance chaotic map, we introduce a chaotic key expansion algorithm. Our experimental results validate the robust security of our proposed key expansion algorithm, demonstrating its resilience against various attacks. The algorithm exhibits strong statistical independence and sensitivity to the initial key, further strengthening the security of the generated round keys.

show abstract

“…In engineering, chaotic maps can be used to design secure communication systems and pseudo-random number generators [11][12][13]. In computer science, chaotic maps are used for tasks such as image compression, encryption, and signal processing [14,15]. One popular application of chaotic maps is in the development of random number generators [16][17][18].…”

Section: Introductionmentioning

confidence: 99%

Building Fixed Point-Free Maps with Memristor

Almatroud

Pham

2023

Mathematics

View full text Add to dashboard Cite

A memristor is a two-terminal passive electronic device that exhibits memory of resistance. It is essentially a resistor with memory, hence the name “memristor”. The unique property of memristors makes them useful in a wide range of applications, such as memory storage, neuromorphic computing, reconfigurable logic circuits, and especially chaotic systems. Fixed point-free maps or maps without fixed points, which are different from normal maps due to the absence of fixed points, have been explored recently. This work proposes an approach to build fixed point-free maps by connecting a cosine term and a memristor. Four new fixed point-free maps displaying chaos are reported to illustrate this approach. The dynamics of the proposed maps are verified by iterative plots, bifurcation diagram, and Lyapunov exponents. Because such chaotic maps are highly sensitive to the initial conditions and parameter variations, they are suitable for developing novel lightweight random number generators.

show abstract

A chaotic map with trigonometric functions: Dynamical analysis and its application in image encryption based on sparse representation and convolutional filters

Cited by 11 publications

References 48 publications

Image encryption scheme based on pseudo-DWT and cubic S-box

Image encryption scheme based on pseudo-DWT and cubic S-box

Application of high performance one-dimensional chaotic map in key expansion algorithm

Building Fixed Point-Free Maps with Memristor

Contact Info

Product

Resources

About