A new source coding scheme with small expected length and its application to simple data encryption

被引：2
作者：
Department of Electrical and Computer Engineering, North Dakota State University, Fargo, ND 58105-5285, United States [1 ]
机构：
[1] Department of Electrical and Computer Engineering, North Dakota State University, Fargo
来源：
IEEE Trans Comput | 2006年 / 10卷 / 1300-1305期
关键词：
Code length; Data compression; Encryption; Huffman codes; Prefix codes; Shannon-Fano-Elias codes; Source coding; Variable-length codes;
D O I：
10.1109/TC.2006.155
中图分类号：
学科分类号：
摘要：
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. © 2006 IEEE.
引用
收藏
页码：1300 / 1305
页数：5
相关论文
共 12 条
  • [1] Yang J., Gao L., Zhang Y., Improving Memory Encryption Performance in Secure Processors, IEEE Trans. Computers, 54, 5, pp. 630-640, (2005)
  • [2] Johnson M., Ishwar P., Prabhakaran V.M., Schonberg D., Ramchandran K., On Compressing Encrypted Data, IEEE Trans. Signal Processing, 52, 10, pp. 2992-3006, (2004)
  • [3] Klein S.T., Bookstein A., Deerwestern S., Storing Text Retrieval Systems on CD-ROM: Compression and Encryption Considerations, ACM Trans. Information Systems, 7, 3, pp. 230-245, (1989)
  • [4] Lekatsas H., Henkel J., Chakradhar S., Jakkula V., Cypress: Compression and Encryption of Data and Code for Embedded Multimedia Systems, IEEE Design and Test of Computers, 21, 5, pp. 406-415, (2004)
  • [5] Huffman D.A., A Method for the Construction of Minimum Redundency Codes, Proc. IRE, 40, pp. 1098-1101, (1952)
  • [6] Robin F., Cryptographic Aspects of Data Compression Codes, Cryptologia, 3, 4, pp. 202-205, (1979)
  • [7] Gillman D.W., Mohtashemi M., Rivest R.L., On Breaking a Huffman Code, IEEE Trans. Information Theory, 42, 3, pp. 972-976, (1996)
  • [8] Lempel A., Ziv J., On the Complexity of Finite Sequences, IEEE Trans. Information Theory, 22, pp. 75-88, (1976)
  • [9] Williems F.M.J., Shtarkov Y.M., Tjalkens T.J., The Context-Tree Weighting Method: Basic Properties, IEEE Trans. Information Theory, 41, 3, pp. 653-664, (1995)
  • [10] Pasco R., Source Coding Algorithm for Fast Data Compression, (1976)
12