On the security of a class of diffusion mechanisms for image encryption

Zhang, LY; Liu, Y; Pareschi, F; Zhang, Y; Wong, KW; Rovatti, R; Setti, G

On the security of a class of diffusion mechanisms for image encryption

Zhang, LY Liu, Y

Pareschi, F Zhang, Y Wong, KW Rovatti, R Setti, G

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Cybernetics, 2018, 48 (4), pp. 1163 - 1175
Issue Date:: 2018-01-01

Closed Access

	Filename	Description	Size
	07888457.pdf	Published Version	3.4 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Zhang, LY	en_US
dc.contributor.author	Liu, Y https://orcid.org/0000-0002-7680-3155	en_US
dc.contributor.author	Pareschi, F	en_US
dc.contributor.author	Zhang, Y	en_US
dc.contributor.author	Wong, KW	en_US
dc.contributor.author	Rovatti, R	en_US
dc.contributor.author	Setti, G	en_US
dc.date.issued	2018-01-01	en_US
dc.identifier.citation	IEEE Transactions on Cybernetics, 2018, 48 (4), pp. 1163 - 1175	en_US
dc.identifier.issn	2168-2267	en_US
dc.identifier.uri	http://hdl.handle.net/10453/132393
dc.description.abstract	© 2017 IEEE. 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.	en_US
dc.relation.ispartof	IEEE Transactions on Cybernetics	en_US
dc.relation.isbasedon	10.1109/TCYB.2017.26825612168-2267	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	On the security of a class of diffusion mechanisms for image encryption	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	48	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - AAI - Advanced Analytics Institute Research Centre
utslib.copyright.status	closed_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	48	en_US

Abstract:

© 2017 IEEE. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/132393