On the Security of a Class of Diffusion Mechanisms for Image Encryption

The need for fast and strong image cryptosystems motivates researchers to develop new techniques to apply traditional cryptographic primitives in order to exploit the intrinsic features of digital images. One of the most popular and mature technique is the use of complex dynamic phenomena, including...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cybernetics 2018-04, Vol.48 (4), p.1163-1175
Main Authors: Zhang, Leo Yu, Liu, Yuansheng, Pareschi, Fabio, Zhang, Yushu, Wong, Kwok-Wo, Rovatti, Riccardo, Setti, Gianluca
Format: Article
Language:English
Subjects:
Ciphers
Complexity
Computer systems
Cryptanalysis
Cryptography
diffusion
Diffusion rate
Digital imaging
Encryption
High-speed optical techniques
image encryption
Multimedia communication
plaintext attack
Security
Streaming media
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The need for fast and strong image cryptosystems motivates researchers to develop new techniques to apply traditional cryptographic primitives in order to exploit the intrinsic features of digital images. One of the most popular and mature technique is the use of complex dynamic phenomena, including chaotic orbits and quantum walks, to generate the required key stream. In this paper, under the assumption of plaintext attacks we investigate the security of a classic diffusion mechanism (and of its variants) used as the core cryptographic primitive in some image cryptosystems based on the aforementioned complex dynamic phenomena. We have theoretically found that regardless of the key schedule process, the data complexity for recovering each element of the equivalent secret key from these diffusion mechanisms is only {O} (1). The proposed analysis is validated by means of numerical examples. Some additional cryptographic applications of this paper are also discussed.
ISSN:2168-2267
2168-2275
DOI:10.1109/TCYB.2017.2682561