Image encryption with chaotic random codes by grey relational grade and Taguchi method

Chuan-Kuei Huang, Hsiau Hsian Nien, Shih Kuen Changchien, Hong Wei Shieh

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

This paper presents a novel scheme for implementation of quasi-optimal chaotic random codes (CRC). Usually, the localization grey relational grade (LGRG) approaches 1 by using less random codes to encrypt digital color images. On the contrary, randomized codes cause highly independent images. In this paper, the LGRG between original and encoded image is used as the quality characteristic, and the chaotic system's initial values x0, y0 and z0 which influence the quality characteristic are chosen as control factors and the levels are also decided. According to the control factors and levels, this paper applied a Taguchi orthogonal array for the experiments, and generated a factor response graph, to figure out a set of chaotic initial values. Finally, the quasi-optimal CRC are decided by these initial values. Eventually, the most effective encryption of digital color images can be obtained by applying the quasi-optimal CRC. The experimental results have demonstrated that the proposed scheme is feasible and efficient.

Original languageEnglish
Pages (from-to)300-310
Number of pages11
JournalOptics Communications
Volume280
Issue number2
DOIs
Publication statusPublished - 2007 Dec 15

Fingerprint

Taguchi methods
Cryptography
grade
Color
Chaotic systems
color
Experiments
causes

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Atomic and Molecular Physics, and Optics
  • Physical and Theoretical Chemistry
  • Electrical and Electronic Engineering

Cite this

Huang, Chuan-Kuei ; Nien, Hsiau Hsian ; Changchien, Shih Kuen ; Shieh, Hong Wei. / Image encryption with chaotic random codes by grey relational grade and Taguchi method. In: Optics Communications. 2007 ; Vol. 280, No. 2. pp. 300-310.
@article{890d03672432430baf871592093335d8,
title = "Image encryption with chaotic random codes by grey relational grade and Taguchi method",
abstract = "This paper presents a novel scheme for implementation of quasi-optimal chaotic random codes (CRC). Usually, the localization grey relational grade (LGRG) approaches 1 by using less random codes to encrypt digital color images. On the contrary, randomized codes cause highly independent images. In this paper, the LGRG between original and encoded image is used as the quality characteristic, and the chaotic system's initial values x0, y0 and z0 which influence the quality characteristic are chosen as control factors and the levels are also decided. According to the control factors and levels, this paper applied a Taguchi orthogonal array for the experiments, and generated a factor response graph, to figure out a set of chaotic initial values. Finally, the quasi-optimal CRC are decided by these initial values. Eventually, the most effective encryption of digital color images can be obtained by applying the quasi-optimal CRC. The experimental results have demonstrated that the proposed scheme is feasible and efficient.",
author = "Chuan-Kuei Huang and Nien, {Hsiau Hsian} and Changchien, {Shih Kuen} and Shieh, {Hong Wei}",
year = "2007",
month = "12",
day = "15",
doi = "10.1016/j.optcom.2007.08.052",
language = "English",
volume = "280",
pages = "300--310",
journal = "Optics Communications",
issn = "0030-4018",
publisher = "Elsevier",
number = "2",

}

Image encryption with chaotic random codes by grey relational grade and Taguchi method. / Huang, Chuan-Kuei; Nien, Hsiau Hsian; Changchien, Shih Kuen; Shieh, Hong Wei.

In: Optics Communications, Vol. 280, No. 2, 15.12.2007, p. 300-310.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Image encryption with chaotic random codes by grey relational grade and Taguchi method

AU - Huang, Chuan-Kuei

AU - Nien, Hsiau Hsian

AU - Changchien, Shih Kuen

AU - Shieh, Hong Wei

PY - 2007/12/15

Y1 - 2007/12/15

N2 - This paper presents a novel scheme for implementation of quasi-optimal chaotic random codes (CRC). Usually, the localization grey relational grade (LGRG) approaches 1 by using less random codes to encrypt digital color images. On the contrary, randomized codes cause highly independent images. In this paper, the LGRG between original and encoded image is used as the quality characteristic, and the chaotic system's initial values x0, y0 and z0 which influence the quality characteristic are chosen as control factors and the levels are also decided. According to the control factors and levels, this paper applied a Taguchi orthogonal array for the experiments, and generated a factor response graph, to figure out a set of chaotic initial values. Finally, the quasi-optimal CRC are decided by these initial values. Eventually, the most effective encryption of digital color images can be obtained by applying the quasi-optimal CRC. The experimental results have demonstrated that the proposed scheme is feasible and efficient.

AB - This paper presents a novel scheme for implementation of quasi-optimal chaotic random codes (CRC). Usually, the localization grey relational grade (LGRG) approaches 1 by using less random codes to encrypt digital color images. On the contrary, randomized codes cause highly independent images. In this paper, the LGRG between original and encoded image is used as the quality characteristic, and the chaotic system's initial values x0, y0 and z0 which influence the quality characteristic are chosen as control factors and the levels are also decided. According to the control factors and levels, this paper applied a Taguchi orthogonal array for the experiments, and generated a factor response graph, to figure out a set of chaotic initial values. Finally, the quasi-optimal CRC are decided by these initial values. Eventually, the most effective encryption of digital color images can be obtained by applying the quasi-optimal CRC. The experimental results have demonstrated that the proposed scheme is feasible and efficient.

UR - http://www.scopus.com/inward/record.url?scp=35448977251&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35448977251&partnerID=8YFLogxK

U2 - 10.1016/j.optcom.2007.08.052

DO - 10.1016/j.optcom.2007.08.052

M3 - Article

AN - SCOPUS:35448977251

VL - 280

SP - 300

EP - 310

JO - Optics Communications

JF - Optics Communications

SN - 0030-4018

IS - 2

ER -