Share Email Print
cover

Proceedings Paper

Data encryption scheme with extended arithmetic coding
Author(s): Hiroyuki Ishibashi; Kiyoshi Tanaka
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this work, we extend arithmetic coding and present a data encryption scheme that achieves data compression and data security at the same time. This scheme is based on a chaotic dynamics, which makes use of the fact that the decoding process of arithmetic coding scheme can be considered as the repetition of Bernoulli shift map. Data encryption is achieved by controlling the piecewise linear maps by a secret key in three kinds of approach: (i) perturbation method, (ii) switching method, and (iii) source extension method. Experimental results show that the obtained arithmetic codes for a message are randomly distributed on the mapping domain [0,1) by using different keys without seriously deteriorating the compression ratio, and the transition of the orbits in the domain [0,1) is similar to the chaotic dynamics.

Paper Details

Date Published: 5 December 2001
PDF: 12 pages
Proc. SPIE 4475, Mathematics of Data/Image Coding, Compression, and Encryption IV, with Applications, (5 December 2001); doi: 10.1117/12.449585
Show Author Affiliations
Hiroyuki Ishibashi, Shinshu Univ. (Japan)
Kiyoshi Tanaka, Shinshu Univ. (Japan)


Published in SPIE Proceedings Vol. 4475:
Mathematics of Data/Image Coding, Compression, and Encryption IV, with Applications
Mark S. Schmalz, Editor(s)

© SPIE. Terms of Use
Back to Top