| 一种新的背包加强算法 |
| |
| 引用本文： | 谭显伦,阮永良. 一种新的背包加强算法[J]. 数字社区&智能家居, 2004, 0(29) |
| |
| 作者姓名： | 谭显伦 阮永良 |
| |
| 作者单位： | [1]同济大学电子与信息工程学院 [2]同济大学电子与信息工程学院 上海 |
| |
| 摘 要： | 背包问题是著名的NP问题,因此它一度成为密码学界的研究热点。由最初的Merkle-Hellman背包算法到后来的Chor-Rivest背包算法,但很多算法都相继被破译。本文提出了一种加强背包算法,具有操作简易性和较强的安全性,可以运用于网络通信加密系统。
|
| 关 键 词： | 网络安全 公钥系统 背包算法 |
A new improved algorithm of knapsack |
| |
| TAN Xian-lun,RUAN Yong-liangCollege of Electronics , Information Engineering,Tongji University,Shanghai ,China. A new improved algorithm of knapsack[J]. Digital Community & Smart Home, 2004, 0(29) |
| |
| Authors: | TAN Xian-lun RUAN Yong-liangCollege of Electronics & Information Engineering Tongji University Shanghai China |
| |
| Affiliation: | TAN Xian-lun,RUAN Yong-liangCollege of Electronics & Information Engineering,Tongji University,Shanghai 200331,China |
| |
| 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. |
| |
| Keywords: | Networks security Public-key system Knapsack algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
