中文摘要：

当前网络中大规模数据的存储和传输需求使得数据压缩与加密相结合的研究引起了越来越多研究者的关注.虽然在信元的概率密度函数（Possibility Mass Function,PMF）保密的前提下使用Huffman编码压缩数据后得到的编码序列极难破译,但该方法中作为密钥的PMF安全性差且难于存储和传输因此很难被实际应用.为解决这个问题本文提出一种基于Huffman编码的一次一密高安全性对称密码体制.该方案使用具有多项式时间复杂度的Huffman树重构算法与有限域插值算法生成密钥,能够保证密钥长度非常短且在密钥被部分获取的情况下对加密体制的破解依然困难.此外本文证明方案的有效性和安全性并给出一个应用实例.

英文摘要：

Huffman codes can be used to encrypt large scale data when implementing compression because a Huffman coded file is difficult to cryptanalyze if the cryptanalyst does not know the probability mass function（PMF） of the source.However,the PMF is hard to be kept secret when being stored and transmitted as a secret key.To solve the above problem we presented a new symmetrical key cryptography schema called Symmetrical Crypto-system based on Huffman Codes（SCH）.SCH uses refactoring Huffman trees and the finite field interpolation to generate secret keys with fairly short length and high security.The ciphertext is still quite difficult to be cryptanalyzed even when the corresponding secret key partially leaked.This paper proved that a secret key can be generated by a polynomial time algorithm and the key-management is of great security and efficiency.After the proof a simple example was also given to illustrate the practicability of SCH.