2014
DOI: 10.1016/j.ijleo.2014.06.149
|View full text |Cite
|
Sign up to set email alerts
|

An image encryption scheme using generalized Arnold map and affine cipher

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
45
0
1

Year Published

2017
2017
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 78 publications
(46 citation statements)
references
References 24 publications
0
45
0
1
Order By: Relevance
“…More particularly, one-dimensional non-linear iterative functions are capable of showing chaotic behavior under some conditions related to the tuning parameter and initial conditions. Moreover, their lower computational complexity has facilitated their adoption in many image encryption schemes based on several chaotic maps, such as Matthews [25], logistic [26], Henon [27], Skew Tent [28], Arnold [29], and Baker [30].…”
Section: Encryption Improvementmentioning
confidence: 99%
“…More particularly, one-dimensional non-linear iterative functions are capable of showing chaotic behavior under some conditions related to the tuning parameter and initial conditions. Moreover, their lower computational complexity has facilitated their adoption in many image encryption schemes based on several chaotic maps, such as Matthews [25], logistic [26], Henon [27], Skew Tent [28], Arnold [29], and Baker [30].…”
Section: Encryption Improvementmentioning
confidence: 99%
“…replacement of pixels called confusion and modification of pixel values called diffusion [3] [5] [6]. The flowchart of the proposed cryptosystem is shown in Figure 2.…”
Section: Proposed Cryptosystemmentioning
confidence: 99%
“…For an ideal encryption algorithm, it should be larger than 100 2 to make brute-force attack infeasible [6]. In the cryptosystem, the secret key parameters are 0 , , , x s p q and n .…”
Section: Key Space Analysismentioning
confidence: 99%
See 2 more Smart Citations