Chaotic image encryption in transform domains

Naeem, Ensherah A.; Elnaby, Mustafa M. Abd; Hadhoud, Mohiy M.

doi:10.1109/icces.2009.5383309

Cited by 11 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After applying m-iteration for confusion and n-iteration for diffusion to each color channel, the three-color channels are combined to get the final encrypted image. The authors of [29] investigated the usage of chaotic mapping with different frequency domains. First, the plainimage is transformed using the chosen transform.…”

Section: Introductionmentioning

confidence: 99%

Dual Image Cryptosystem Using Henon Map and Discrete Fourier Transform

Alhumyani¹

2023

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

This paper introduces an efficient image cryptography system. The proposed image cryptography system is based on employing the two-dimensional (2D) chaotic henon map (CHM) in the Discrete Fourier Transform (DFT). The proposed DFT-based CHM image cryptography has two procedures which are the encryption and decryption procedures. In the proposed DFT-based CHM image cryptography, the confusion is employed using the CHM while the diffusion is realized using the DFT. So, the proposed DFT-based CHM image cryptography achieves both confusion and diffusion characteristics. The encryption procedure starts by applying the DFT on the image then the DFT transformed image is scrambled using the CHM and the inverse DFT is applied to get the finally encrypted image. The decryption procedure follows the inverse procedure of encryption. The proposed DFT-based CHM image cryptography system is examined using a set of security tests like statistical tests, entropy tests, differential tests, and sensitivity tests. The obtained results confirm and ensure the superiority of the proposed DFT-based CHM image cryptography system. These outcomes encourage the employment of the proposed DFT-based CHM image cryptography system in real-time image and video applications.

show abstract

Section: Introductionmentioning

confidence: 99%

Dual Image Cryptosystem Using Henon Map and Discrete Fourier Transform

Alhumyani¹

2023

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

show abstract

“…The DST has proven to be an effective tool in the medical field as well, combining multiple images of different modes into a singular, highly detailed image for more accurate diagnoses [36], [37]. Expansion upon the fractional DST has also broadened the transform's role in the field of cyber security, particularly for applications in image encryption [38]- [40]. It was shown in [38] that the DST increases the entropy of encryption schemes that rely on processing within transform domains.…”

Section: Introductionmentioning

confidence: 99%

“…Expansion upon the fractional DST has also broadened the transform's role in the field of cyber security, particularly for applications in image encryption [38]- [40]. It was shown in [38] that the DST increases the entropy of encryption schemes that rely on processing within transform domains. This paper explores this concept further in Section VIII.…”

Section: Introductionmentioning

confidence: 99%

Sparse Matrix Based Low-Complexity, Recursive, and Radix-2 Algorithms for Discrete Sine Transforms

Perera

Lingsch

2021

IEEE Access

View full text Add to dashboard Cite

This paper presents factorizations of each discrete sine transform (DST) matrices of types I, II, III, and IV into a product of sparse, diagonal, bidiagonal, and scaled orthogonal matrices. Based on the proposed matrix factorization formulas, reduced multiplication complexity, recursive, and radix-2 DST-I/II/III/IV algorithms are presented. We will present the lowest multiplication complexity DST-IV algorithm in the literature. The paper fills a gap in the self-recursive, exact, and radix-2 DST-I/II/III algorithms executed via diagonal, bidiagonal, scaled orthogonal, and simple matrix factors for any input n = 2 t (t ≥ 1). The paper establishes a novel relationship between DST-II and DST-IV matrices using diagonal and bidiagonal matrices. Similarly, a novel relationship between DST-I and DST-III matrices is proposed using sparse and diagonal matrices. These interweaving relationships among DST matrices enable us to bridge the existing factorizations of the DST matrices with the proposed factorization formulas. We present signal flow graphs to provide a layout for realizing the proposed algorithms in DST-based integrated circuit designs. Additionally, we describe an implementation of algorithms based on the proposed DST-II and DST-III factorizations within a double random phase encoding (DRPE) image encryption scheme.INDEX TERMS Discrete sine transforms, self/completely recursive and radix-2 algorithms, complexity and performance of algorithms, sparse and orthogonal matrices, signal flow graphs VOLUME ....

show abstract