An image encryption algorithm based on 3-D DNA level permutation and substitution scheme

The authors extend their appreciation to Deanship of scientific research at king khalid university for funding this work through general research project under grant number GRP/189/42.ABSTRACT Recently, a little research into image encryption has been used on chaotic economic maps. The current paper suggests a bit-level permutation and a non-invertible chaotic economic map to encrypt an image. Firstly, the secret key generation is linked to the plain image. So, the suggested algorithm may resist both known-plaintext and chosen-plaintext attacks. Then a bit-level permutation is performed for all the binary bits of the plain image's pixels, using the logistic map (permutation stage). It is used to improve the algorithm's security. Then pixel diffusion is applied using the 2D non-invertible chaotic economic map and bit-wise XOR operations. It is used to change the pixels' values and make them highly random. The results of the experiments and the security analyses show that the given image encryption algorithm is efficient with higher security. Some comparisons showed that the proposed algorithm outperformed many recent algorithms. Finally, the proposed algorithm may be able to withstand a variety of attacks.

show abstract

“…[33] Ref. [ The correlation coefficient ρ xy for each pair is calculated [30] 0.0034 −0.0003 −0.0011 Ref. [35] 0.0022 −0.0062 0.0026 Ref.…”

Section: Imagementioning

confidence: 99%

New Encryption Algorithm Using Bit-Level Permutation and Non-Invertible Chaotic Map

Karawia

Elmasry

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…χ 2 test can be used to detect whether the pixel value distribution of the encrypted image is uniform. χ 2 can be calculated by using (19).…”

Section: Histogram Analysismentioning

confidence: 99%

A New Image Encryption Scheme Based on a Novel One-Dimensional Chaotic System

Wang

Liu

2020

IEEE Access

View full text Add to dashboard Cite

This paper introduces a novel one-dimensional sine chaotic system (1DSCS) with large parameter interval. The evaluation of 1DSCS indicates that the system has good chaotic characteristics and large parameters space. Based on 1DSCS, a new image encryption scheme is proposed. First, the image is scrambled by the row and column indexes, and then scrambled by the dynamic parameters Arnold map. This scheme avoids the inadequacy of row-column index scrambling and the periodicity of Arnold map. Second, four highly sensitive dynamic diffusion formulas related to plaintext are designed, and the dynamic formulas are selected through the chaotic sequence generated by 1DSCS. Third, the scheme proposed in this paper can also be applied to color image encryption. The experimental results demonstrate that the 1DSCS system is suitable for image encryption and the encryption scheme has good security to resist common attacks.

show abstract

“…DNA computing has various advantages such as high parallelism and information density, as well as low power consumption [27]. Since then, various DNAbased cryptographic algorithms have been proposed [28]- [33]. DNA encryption is made up of DNA encoding and computing, which includes biological processes and algebraic operations.…”

Section: Introductionmentioning

confidence: 99%

A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence

et al. 2021

View full text Add to dashboard Cite

Many chaos-based hash functions have convoluted designs that are not based on proper design principles, complicating the verification of security claims. We address this problem by proposing a hash function based on a chaotic sponge construction and DNA sequence. DNA sequence is used to design state transition rules of a deterministic chaotic finite-state automata (DCFSA), a chaotic structure that enhances the chaoticity of digital chaotic maps. We use a DCFSA configuration consisting of four states associated with logistic maps. Analysis shows that the DCFSA configuration is efficient and has high chaotic complexity. Both DCFSA and DNA are used to design the sponge-based hash function. An input message is transformed into a DNA sequence and divided into fixed-length blocks. Each block is absorbed into a sponge structure via DNA-XOR. The sponge state is then updated with a new DNA sequence by iterating DCFSA as a compression function. Statistical evaluations indicate that the proposed hash function has near-ideal diffusion, confusion, collision resistance and distribution properties. The proposed hash can also extend the provably secure notions of the sponge construction, specifically the indifferentiability from random oracles. Furthermore, the hash function has a high level of performance as compared to other chaosbased hash functions.INDEX TERMS Chaotic map DNA data integrity finite state automata hash function security

show abstract

An image encryption algorithm based on 3-D DNA level permutation and substitution scheme

Cited by 44 publications

References 62 publications

New Encryption Algorithm Using Bit-Level Permutation and Non-Invertible Chaotic Map

New Encryption Algorithm Using Bit-Level Permutation and Non-Invertible Chaotic Map

A New Image Encryption Scheme Based on a Novel One-Dimensional Chaotic System

A Novel Hash Function Based on a Chaotic Sponge and DNA Sequence

Contact Info

Product

Resources

About