一种低代价、可靠的OSPF验证机制  

A Cheap and Reliable Mechanism for OSPF Verification

作　　者：谢蒂[1] 杨静[1] 

机构地区：[1]山东大学计算机科学与技术学院,山东济南250061

出　　处：《计算机应用》2003年第12期33-34,45,共3页journal of Computer Applications

基　　金：山东省自然科学基金项目 (Y2 0 0 0C2 6 )

摘　　要：为了保障OSPF协议的安全,同时尽可能降低其安全方面的开销,提出了一种全新的验证机制。该机制综合使用对称密码体制、非对称密码体制和散列链等技术,提高了验证OSPF分组的效率;通过采用时间戳和一次验证等方法,充分保证了验证过程的可靠性。最后,对该机制的性能和代价进行了分析。In order to guarantee the security of OSPF protocol and to reduce its cost as much as possible, a new verification mechanism was proposed. This mechanism utilized symmetric cryptosystems, public cryptosystems and hash chains etc. to highly improve the verification efficiency, and adopted timestamp and one-time authentication to sufficiently assure the verification process. Furthermore, the performance and the cost of the verification mechanism were discussed.'

关 键 词：OSPF 链路状态更新分组 散列链 验证 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]