| 一种多项式时间复杂度的密码协议秘密性验证方法 |
| |
| 引用本文： | 吴立军,苏开乐.一种多项式时间复杂度的密码协议秘密性验证方法[J].计算机科学,2005,32(7):109-112. |
| |
| 作者姓名： | 吴立军 苏开乐 |
| |
| 作者单位： | 中山大学计算机科学与技术系,广州,510275;中山大学计算机科学与技术系,广州,510275 |
| |
| 基金项目： | 国家自然科学基金(No.60473004) |
| |
| 摘 要： | 密码协议的秘密性验证是网络安全领域的一个难题，本文在提出协议行为结构的基础上，通过对协议行为及其结构的分析，提出了一种新的密码协议的秘密性验证算法，该算法的时间复杂度是多项式时间的，从而简化了秘密性验证过程，文中最后，作为实例，给出了TMN密码协议的秘密性验证。
|
| 关 键 词： | 密码协议 秘密性 验证 TMN密码协议 |
An Algorithm with Polynomial Time Complexity for Verifying Secrecy Properties of Cryptographic Protocols |
| |
| WU Li-Jun,SU Kai-le.An Algorithm with Polynomial Time Complexity for Verifying Secrecy Properties of Cryptographic Protocols[J].Computer Science,2005,32(7):109-112. |
| |
| Authors: | WU Li-Jun SU Kai-le |
| |
| Affiliation: | WU Li-Jun,SU Kai-Le Department of Computer Science and Technology,Zhongshan University,Guangzhou 510275 |
| |
| Abstract: | The verification of secrecy properties of cryptographic protocols is a hard problem in the area of computer network security. In this paper, based on introduction of framework of actions of protocols and analysis of actions of protocols and its framework, a new algorithm for verification of secrecy properties of cryptographic protocols is pre- sented. The time complexity of the algorithm is polynomial, and so it makes the verification of secrecy properties of cryptographic protocols easier. In the last of paper, as example, the verification of secrecy properties of TMN crypto- graphic protocol is given. |
| |
| Keywords: | Cryptographic protocols Secrecy properties Verification TMN cryptographic protocol |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
