2022
DOI: 10.32985/ijeces.13.10.4
|View full text |Cite
|
Sign up to set email alerts
|

Color Image Encryption Using LFSR, DNA, and 3D Chaotic Maps

Abstract: One of the most important challenges facing researchers is to find new methods to protect data sent over the Internet and prevent unauthorized access to it. In this paper, we present a new method for encrypting image data divided into two stages. The first stage requires redistributing the positions of the pixels by using a key of random numbers generated by linear feedback shift registers and then encrypting the data using deoxyribonucleic acid rules. The data generated in the previous stage is encrypted agai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…The proposed method was tested on a group of colored images: Lena, Baboon, Barbara, and Pepper of size (256×256). In the permutation stage, we used three registers of different (29,31,33) and different (13, 7, 2), (3, 2, 1), (22, 13, 11,) respectively, and each register had a unique initial value(seed). The number of sequences bits required to generate each number depended on the number of pixels in one-half of the image size.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The proposed method was tested on a group of colored images: Lena, Baboon, Barbara, and Pepper of size (256×256). In the permutation stage, we used three registers of different (29,31,33) and different (13, 7, 2), (3, 2, 1), (22, 13, 11,) respectively, and each register had a unique initial value(seed). The number of sequences bits required to generate each number depended on the number of pixels in one-half of the image size.…”
Section: Resultsmentioning
confidence: 99%
“…In the begging, the inputting color image is divided into two equal parts (upper UP and lower LW) with size Sk. Second, using LFSRs that comprise three registers with different lengths (29,31,33) and different taps (2,7,13), (1,2,3), (11,13,22), respectively, key K is generated that contains non-repetitive random numbers with size Sk. The same key is used to redistribute the locations of the pixels in each part.…”
Section: Changing the Pixel's Position (Confusion)mentioning
confidence: 99%