A Chaos-based Joint Compression and Encryption Scheme Using Mutated Adaptive Huffman Tree
暂无分享,去创建一个
Wei Zhang | Hai Yu | Zhi-Liang Zhu | Wei Zhang | Zhi-liang Zhu | Hai Yu | Ying Tang | Ying Tang | Qiong Liu | Qiong Liu
[1] Prasant Mohapatra,et al. Joint Video Compression and Encryption using Arithmetic Coding and chaos , 2010, 2010 IEEE 4th International Conference on Internet Multimedia Services Architecture and Application.
[2] 염흥렬,et al. [서평]「Applied Cryptography」 , 1997 .
[3] Glen G. Langdon,et al. Arithmetic Coding , 1979 .
[4] Hyungjin Kim,et al. Secure Arithmetic Coding , 2007, IEEE Transactions on Signal Processing.
[5] Jeffrey Scott Vitter,et al. Design and analysis of dynamic Huffman codes , 1987, JACM.
[6] Gonzalo Álvarez,et al. Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems , 2003, Int. J. Bifurc. Chaos.
[7] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[8] Safya Belghith,et al. Joint compression and encryption using chaotically mutated Huffman trees , 2010 .
[9] David Salomon. A Concise Introduction to Data Compression , 2007, Undergraduate Topics in Computer Science.
[10] C.-C. Jay Kuo,et al. Design of integrated multimedia compression and encryption systems , 2005, IEEE Transactions on Multimedia.
[11] Oscar C. Au,et al. Security Analysis of Multimedia Encryption Schemes Based on Multiple Huffman Table , 2007, IEEE Signal Processing Letters.
[12] Oscar C. Au,et al. Adaptive Chosen-Ciphertext Attack on Secure Arithmetic Coding , 2009, IEEE Transactions on Signal Processing.