Secure finite state integer arithmetic codes

In this paper finite state characteristic of integer arithmetic codes (FSAC) is combined with prefix free characteristic of Huffman codes to yield security in source codes. Some random jumps are inserted in transition sequence of state diagram to provide security. Huffman codes are used to make possible tracking and therefore decoding in jump instants.

[1]  Enrico Magli,et al.  Selective encryption of JPEG 2000 images by means of randomized arithmetic coding , 2004, IEEE 6th Workshop on Multimedia Signal Processing, 2004..

[2]  Mohammad Reza Aref,et al.  Joint source-channel coding using finite state integer arithmetic codes , 2009, 2009 IEEE International Conference on Electro/Information Technology.

[3]  J. Vitter,et al.  Practical Implementations of Arithmetic Coding , 1991 .

[4]  Hyungjin Kim,et al.  Binary arithmetic coding with key-based interval splitting , 2006, IEEE Signal Processing Letters.

[5]  Enrico Magli,et al.  Multimedia Selective Encryption by Means of Randomized Arithmetic Coding , 2006, IEEE Transactions on Multimedia.

[6]  Hyungjin Kim,et al.  Secure Arithmetic Coding , 2007, IEEE Transactions on Signal Processing.

[7]  Prasit Teekaput,et al.  Secure embedded error detection arithmetic coding , 2005, Third International Conference on Information Technology and Applications (ICITA'05).

[8]  Ranjan Bose,et al.  A novel compression and encryption scheme using variable model arithmetic coding and coupled chaotic system , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[9]  Michel Kieffer,et al.  Asymptotic Error-Correcting Performance of Joint Source-Channel Schemes based on Arithmetic Coding , 2006, 2006 IEEE Workshop on Multimedia Signal Processing.