The search functionality is under construction.

The search functionality is under construction.

In this paper, we focus on an image encryption scheme based on a truncated Baker transformation. The truncated Baker transformation globally preserves the original dynamics of Baker transformation but incorporates a random local rotation operator between two neighbor elements in the mapping domain in order to keep a finite precision. It generates binary sequences (the dynamics of elements) which have statistically good features on ergodicity, mixing and chaotic properties. The image encryption scheme extended from the truncated Baker transformation efficiently shuffles the input gray level image satisfying fundamental conditions on confusion and diffusion required for image encryption schemes. However, this scheme uses many binary sequences and thus needs to keep a large volume of secret keys. In order to solve this problem we introduce Peano space-filling curve in this scheme, which remarkably reduce the key size and mapping iterations without deteriorating good shuffling properties attained by this scheme.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.9 pp.2025-2035

- Publication Date
- 2002/09/01

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- Special Section PAPER (Special Section on Nonlinear Theory and Its Applications)

- Category

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Kenji YANO, Kiyoshi TANAKA, "Image Encryption Scheme Based on a Truncated Baker Transformation" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 9, pp. 2025-2035, September 2002, doi: .

Abstract: In this paper, we focus on an image encryption scheme based on a truncated Baker transformation. The truncated Baker transformation globally preserves the original dynamics of Baker transformation but incorporates a random local rotation operator between two neighbor elements in the mapping domain in order to keep a finite precision. It generates binary sequences (the dynamics of elements) which have statistically good features on ergodicity, mixing and chaotic properties. The image encryption scheme extended from the truncated Baker transformation efficiently shuffles the input gray level image satisfying fundamental conditions on confusion and diffusion required for image encryption schemes. However, this scheme uses many binary sequences and thus needs to keep a large volume of secret keys. In order to solve this problem we introduce Peano space-filling curve in this scheme, which remarkably reduce the key size and mapping iterations without deteriorating good shuffling properties attained by this scheme.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_9_2025/_p

Copy

@ARTICLE{e85-a_9_2025,

author={Kenji YANO, Kiyoshi TANAKA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Image Encryption Scheme Based on a Truncated Baker Transformation},

year={2002},

volume={E85-A},

number={9},

pages={2025-2035},

abstract={In this paper, we focus on an image encryption scheme based on a truncated Baker transformation. The truncated Baker transformation globally preserves the original dynamics of Baker transformation but incorporates a random local rotation operator between two neighbor elements in the mapping domain in order to keep a finite precision. It generates binary sequences (the dynamics of elements) which have statistically good features on ergodicity, mixing and chaotic properties. The image encryption scheme extended from the truncated Baker transformation efficiently shuffles the input gray level image satisfying fundamental conditions on confusion and diffusion required for image encryption schemes. However, this scheme uses many binary sequences and thus needs to keep a large volume of secret keys. In order to solve this problem we introduce Peano space-filling curve in this scheme, which remarkably reduce the key size and mapping iterations without deteriorating good shuffling properties attained by this scheme.},

keywords={},

doi={},

ISSN={},

month={September},}

Copy

TY - JOUR

TI - Image Encryption Scheme Based on a Truncated Baker Transformation

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 2025

EP - 2035

AU - Kenji YANO

AU - Kiyoshi TANAKA

PY - 2002

DO -

JO - IEICE TRANSACTIONS on Fundamentals

SN -

VL - E85-A

IS - 9

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - September 2002

AB - In this paper, we focus on an image encryption scheme based on a truncated Baker transformation. The truncated Baker transformation globally preserves the original dynamics of Baker transformation but incorporates a random local rotation operator between two neighbor elements in the mapping domain in order to keep a finite precision. It generates binary sequences (the dynamics of elements) which have statistically good features on ergodicity, mixing and chaotic properties. The image encryption scheme extended from the truncated Baker transformation efficiently shuffles the input gray level image satisfying fundamental conditions on confusion and diffusion required for image encryption schemes. However, this scheme uses many binary sequences and thus needs to keep a large volume of secret keys. In order to solve this problem we introduce Peano space-filling curve in this scheme, which remarkably reduce the key size and mapping iterations without deteriorating good shuffling properties attained by this scheme.

ER -