5 December 2001 Data encryption scheme with extended arithmetic coding
Author Affiliations +
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.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hiroyuki Ishibashi, Hiroyuki Ishibashi, Kiyoshi Tanaka, Kiyoshi Tanaka, } "Data encryption scheme with extended arithmetic coding", Proc. SPIE 4475, Mathematics of Data/Image Coding, Compression, and Encryption IV, with Applications, (5 December 2001); doi: 10.1117/12.449585; https://doi.org/10.1117/12.449585
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Reordering palettes for archiving color-mapped images
Proceedings of SPIE (November 20 1995)
Design of secure group key management system
Proceedings of SPIE (July 25 2001)
Secure Lempel-Ziv compression with embedded encryption
Proceedings of SPIE (March 20 2005)
Enhanced MHT encryption scheme for chosen plaintext attack
Proceedings of SPIE (November 25 2003)
Synchronization properties of cyber behaviors
Proceedings of SPIE (April 28 2010)

Back to Top