2019 2nd Scientific Conference of Computer Sciences (SCCS) 2019
DOI: 10.1109/sccs.2019.8852590
|View full text |Cite
|
Sign up to set email alerts
|

A New Permutation-Substitution Scheme Based on Henon Chaotic Map for Image Encryption

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 15 publications
0
4
0
Order By: Relevance
“…Finally, the diffused image is permuted using the second sequence of values generated by the Henon map to produce the cipher image. In [24], Hussein et al introduced a new permutation-substitution algorithm based on the Henon map. The algorithm utilizes the Henon map to generate two sets of keystreams, namely X and Y, each having a length of (height × width + 100), where the first 100 generated values are removed from the keystream.…”
Section: Henon Mapsmentioning
confidence: 99%
“…Finally, the diffused image is permuted using the second sequence of values generated by the Henon map to produce the cipher image. In [24], Hussein et al introduced a new permutation-substitution algorithm based on the Henon map. The algorithm utilizes the Henon map to generate two sets of keystreams, namely X and Y, each having a length of (height × width + 100), where the first 100 generated values are removed from the keystream.…”
Section: Henon Mapsmentioning
confidence: 99%
“…Any system can get good resistance to the brute-force attack by making its key space sufficient big (i.e. as a rule, the main space has a key space lower than 2 128 is not reasonable to be secure enough), otherwise in a limited period of time, it will be discovered by somewhat long inspection to obtain the secret key [13,14]. In this encryption system, the key space is constructed from the initial and control values that are needed for generating the key (CKNG).…”
Section: Brute Force Attack Analysesmentioning
confidence: 99%
“…It is a try to get the decryption key using a simple variation in the input. Here, the large enough output variation, the more difficult for an attacker to find the decryption key [13][14][15]. A reliable cipher system must distribute the effect of The differential attack is analyzed by calculating the sum of the absolute difference (SAD) between each pair of encrypted databases.…”
Section: Differential Attack Analysismentioning
confidence: 99%
See 1 more Smart Citation