Enhanced chaotic key-based algorithm for low-entropy image encryption

As computing power of today's computer enhances rapidly, secure encryption is getting harder and the need for powerful secure encryption methods becomes inevitable. To avoid brute-force attacks it is necessary to have a larger key space, which makes the chaotic systems more attractive. In order...

Full description

Saved in:
Bibliographic Details
Published inSignal Processing and Communications Applications Conference pp. 385 - 388
Main Authors Yavuz, Erdem, Yazici, Rifat, Kasapbasi, Mustafa Cem, Yamac, Ezgi
Format Conference Proceeding
LanguageEnglish
Japanese
Turkish
Published IEEE 01.04.2014
Subjects
chaos
Chaotic communication
Conferences
Encryption
entropy
Histograms
image encryption
NIST
Signal processing
Signal processing algorithms
Online AccessGet full text
ISSN2165-0608
DOI10.1109/SIU.2014.6830246

Cover

More Information
Summary:As computing power of today's computer enhances rapidly, secure encryption is getting harder and the need for powerful secure encryption methods becomes inevitable. To avoid brute-force attacks it is necessary to have a larger key space, which makes the chaotic systems more attractive. In order to sufficiently apply confusion and diffusion rules for an image data with any entropy structure, a two-dimensional chaotic system, which has high sensitivity to initial states, has been utilized in this study. The fact that adjacent pixels of an image have naturally close values makes it easier for crackers to perform statistical analysis. So, two chaotic functions are used to disrupt correlations among them, one for shuffling pixel positions and one for changing pixels values. Even with low entropy images the proposed algorithm has been proved to be more secure and faster than the previous algorithms.
ISSN:2165-0608
DOI:10.1109/SIU.2014.6830246