This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Source Coding Scheme with Small Expected Length and Its Application to Simple Data Encryption
October 2006 (vol. 55 no. 10)
pp. 1300-1305
We present a new source coding scheme with smaller expected length than Shannon-Fano-Elias codes. The ordering of source symbols input to the proposed encoding algorithm can be arbitrary. We show that this property leads to exponential complexity for eavesdropping even though an adversary knows the code construction rule and the probability mass function of the source.

[1] J. Yang, L. Gao, and Y. Zhang, “Improving Memory Encryption Performance in Secure Processors,” IEEE Trans. Computers, vol. 54, no. 5, pp. 630-640, May 2005.
[2] M. Johnson, P. Ishwar, V.M. Prabhakaran, D. Schonberg, and K. Ramchandran, “On Compressing Encrypted Data,” IEEE Trans. Signal Processing, vol. 52, no. 10, pp. 2992-3006, Oct. 2004.
[3] S.T. Klein, A. Bookstein, and S. Deerwestern, “Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations,” ACM Trans. Information Systems, vol. 7, no. 3, pp. 230-245, July 1989.
[4] H. Lekatsas, J. Henkel, S. Chakradhar, and V. Jakkula, “Cypress: Compression and Encryption of Data and Code for Embedded Multimedia Systems,” IEEE Design and Test of Computers, vol. 21, no. 5, pp. 406-415, May/June 2004.
[5] D.A. Huffman, “A Method for the Construction of Minimum Redundency Codes,” Proc. IRE, vol. 40, pp. 1098-1101, Sept. 1952.
[6] F. Robin, “Cryptographic Aspects of Data Compression Codes,” Cryptologia, vol. 3, no. 4, pp. 202-205, 1979.
[7] D.W. Gillman, M. Mohtashemi, and R.L. Rivest, “On Breaking a Huffman Code,” IEEE Trans. Information Theory, vol. 42, no. 3, pp. 972-976, May 1996.
[8] A. Lempel and J. Ziv, “On the Complexity of Finite Sequences,” IEEE Trans. Information Theory, vol. 22, pp. 75-88, 1976.
[9] F.M.J. Williems, Y.M. Shtarkov, and T.J. Tjalkens, “The Context-Tree Weighting Method: Basic Properties,” IEEE Trans. Information Theory, vol. 41, no. 3, pp. 653-664, May 1995.
[10] R. Pasco, “Source Coding Algorithm for Fast Data Compression,” PhD thesis, Standford Univ., 1976.
[11] N. Abramson, Information Theory and Coding. New York: McGraw-Hill, 1963.
[12] C.E. Shannon, “A Mathematical Theory of Communication,” Bell Systems Technical J., vol. 27, pp. 379-423, 623-656 July-Oct. 1948.

Index Terms:
Code length, data compression, encryption, Huffman codes, prefix codes, Shannon-Fano-Elias codes, source coding, variable-length codes.
Citation:
Xiaoyu Ruan, Rajendra S. Katti, "A New Source Coding Scheme with Small Expected Length and Its Application to Simple Data Encryption," IEEE Transactions on Computers, vol. 55, no. 10, pp. 1300-1305, Oct. 2006, doi:10.1109/TC.2006.155
Usage of this product signifies your acceptance of the Terms of Use.