A secure and robust image encryption based on chaotic permutation multiple circular shrinking and expanding

Yohan Suryanto, Suryadi, Kalamullah Ramli

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)

Abstract

In this paper, we propose a secure and robust image encryption based on the chaotic permutation multiple circular shrinking and expanding. An image with the n × m size is encrypted in n set columns and m set rows using the permutation multiple circular and linked bitxor. The proposed method characterized by a very large key space, such that for an image size of 256 × 256, the key space reaches 2862208 which is probably the largest key space ever recorded in a chaotic image encryption. It is sensitive to changes in key, so that the change 1 bit in initial key among 21684 possibilities is likely to produce a significant different ciphered images (for image peppers NPCR 99:65%, UACI 33.35, r < 0:008). It also resistant to differential attack due to a change 1 bit in the plain image lead to completely different ciphered image (for image lena NPCR 99:60% and UACI 33:47%). The proposed method is also resistant to JPEG compression, noise scheme (Gaussian, Poisson, Salt&Pepper, and speckle), data loss, and brightness-contrast adjustment, so the ciphered image can be stored in smaller file size and transmitted in a noisy communication system.

Original languageEnglish
Pages (from-to)697-713
Number of pages17
JournalJournal of Information Hiding and Multimedia Signal Processing
Volume7
Issue number4
Publication statusPublished - 1 Jan 2016

Keywords

  • Chaotic permutation
  • Circular shrinking and expanding
  • Image encryption
  • Large key space
  • Robust to noise

Fingerprint

Dive into the research topics of 'A secure and robust image encryption based on chaotic permutation multiple circular shrinking and expanding'. Together they form a unique fingerprint.

Cite this