Abstract
Past research in the field of cryptography has not given much consideration to arithmetic coding as a feasible encryption technique, with studies proving compression-specific arithmetic coding to be largely unsuitable for encryption. Nevertheless, adaptive modeling, which offers a huge model, variable in structure, and as completely as possible a function of the entire text that has been transmitted since the time the model was initialized, is a suitable candidate for a possible encryption-compression combine. The focus of the work presented in this paper has been to incorporate recent results of chaos theory, proven to be cryptographically secure, into arithmetic coding, to devise a convenient method to make the structure of the model unpredictable and variable in nature, and yet to retain, as far as is possible, statistical harmony, so that compression is possible. A chaos-based adaptive arithmetic coding-encryption technique has been designed, developed and tested and its implementation has been discussed. For typical text files, the proposed encoder gives compression between 67.5% and 70.5%, the zeroth-order compression suffering by about 6% due to encryption, and is not susceptible to previously carried out attacks on arithmetic coding algorithms.
Original language | English |
---|---|
Pages (from-to) | 848-857 |
Number of pages | 10 |
Journal | IEEE Transactions on Circuits and Systems I: Regular Papers |
Volume | 53 |
Issue number | 4 |
DOIs | |
State | Published - Apr 2006 |
Externally published | Yes |
Funding
Manuscript received May 23, 2004; revised December 22, 2004 and May 3, 2005. This work was supported by the SERC, Department of Science and Technology, New Delhi. This paper was recommended by Associate Editor S.-G. Chen.
Keywords
- Arithmetic coding
- Chaos
- Compression
- Encryption
- Symmetric key cryptography
- Variable model