【摘要】 背包问题是著名的NP问题,因此它一度成为密码学界的研究热点。由最初的Merkle-Hellman背包算法到后来的Chor-Rivest背包算法,但很多算法都相继被破译。本文提出了一种加强背包算法,具有操作简易性和较强的安全性,可以运用于网络通信加密系统。更多还原

【Abstract】 Question about Knapsack is a well-known puzzle, so it had been a focus in cryptography field. People posed many algorithms about knapsack problem, including Merkle-Hellman algorithm, Chor- Rivest algorithm, but most of them have been seen through. In the essay describes an improved knapsack algorithm which is more simple and security than ever. Therefore, it may be applied to cryptogram system about communication on networks.更多还原