2010
DOI: 10.1016/j.cnsns.2010.01.004
|View full text |Cite
|
Sign up to set email alerts
|

A fast image encryption and authentication scheme based on chaotic maps

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
56
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 101 publications
(56 citation statements)
references
References 21 publications
0
56
0
Order By: Relevance
“…While the NPCR and UACI of the proposed, Yang et al's cryptosystems is 0.996185 and 0.334795, respectively [9].…”
Section: (1) Plainimage Sensitivitymentioning
confidence: 99%
See 1 more Smart Citation
“…While the NPCR and UACI of the proposed, Yang et al's cryptosystems is 0.996185 and 0.334795, respectively [9].…”
Section: (1) Plainimage Sensitivitymentioning
confidence: 99%
“…Jiri Giesl et al used the chaotic maps of Peter de Jong's attractor to improve the chaos image encryption speed [5]. Yang et al introduced a keyed hash function to generate a 128-bit hash value so that the scheme could be used to encrypt and authenticate [9].…”
Section: Introductionmentioning
confidence: 99%
“…In their system, two a general cat-map is used for permutation and diffusion, as well as the OCML (one-way coupled map lattice), which is applied for substitution. These two methods are operated alternately in every round of encryption process [1]. In our altered method the original images should be partitioned or merged into N× 2N pixel blocks at first.…”
Section: The Proposed Schemementioning
confidence: 99%
“…This paper applies an alternate structure of the classic block cipher applied with Arnold Cat map is used for encryption and hash function is used for Authentication purpose. The paper that is being followed uses a keyed hash function is introduced to generate hash values from both the plain-image and the secret hash keys [1], which leads to large computational time, whereas our schemes computational time is less as compared to the previous. The experimental results show that the proposed encryption technique is efficient and has high security features.…”
Section: Introductionmentioning
confidence: 99%
“…Huaqian Yang et al [8]crypt analyzed some chaos-based image encryption algorithms with substitution-diffusion structure and identified the common flaws or deficiencies of these algorithms. The summarization of the flaws is (a) the key for encryption/decryption is independent of the plainimage and this favors known plaintext and chosen plaintext attacks, (b) in the diffusion process, the change in the current pixel value only affects a few cipher image pixels in one round and so at least two overall rounds of substitutiondiffusion are required and (c) it is difficult for the receiver to determine whether the decrypted image is exactly the one sent.…”
Section: Related Workmentioning
confidence: 99%