论文部分内容阅读
本文讨论了一般背包公钥密码系统的位安全性问题，建立了这种系统中原文整体和某些特定位的安全性的等价关系。提出了一个新的基于背包问题的公钥系统，且不涉及任何背包分量超递增序列，与Merkle-Hellman系统有着本质的区别。此外，适当选择参数时，系统密度可达很高。因而，现有的Shamir的破译算法和Brickell解低密度背包问题的算法对该系统均无效。
This article discusses the bit security of the general backpack public key cryptosystem, and establishes the equivalence relation between the whole original text and the security of some specific bits in this system. A new public key system based on knapsack problem is proposed, and does not involve any overpack sequence of backpack components, which is essentially different from the Merkle-Hellman system. In addition, the system density can be very high when the parameters are properly selected. Therefore, the existing algorithms of Shamir’s deciphering algorithm and Brickell’s solution of low-density knapsack problem are invalid for this system.