检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学信息科学与技术学院,成都610031
出 处:《计算机应用》2013年第8期2212-2217,共6页journal of Computer Applications
基 金:国家自然科学基金资助项目(60773102);国家自然科学基金与中国工程院联合基金资助项目(U0970122)
摘 要:开放式最短路径优先(OSPF)协议作为目前大规模网络应用最广泛的自治域内路由协议,其安全不仅仅关系到自治域内,同时也关系到自治域外乃至整个网络的正常运行。传统的基于非对称性加密算法的数字签名解决方案能够实现端到端的安全验证,但是却忽略了点对点的方式,而且存储量和额外开销也一直是急需解决的问题。基于对称性加密算法,提出了适宜于OSPF等级区域的安全防护方案HS-OSPF。HS-OSPF扩充了OSPF网原有的二层等级结构,设计了合理、高效的密钥分配与管理方案,克服了传统非对称性密码方案的不足,降低了密钥存储量和系统开销,提高了网内安全通信的实时性。As the most widely used autonomous intra-domain routing protocol for large-scale network,the security of Open Shortest Path First(OSPF) is not only about the normal running of autonomous intra-domain,but also closely related to inter-domain even the whole network.Based on asymmetric encryption algorithm,the traditional digital signature solution can realize the security validation of end-to-end;however,it ignores the issue of point-to-point.Additionally,the problem of storage and extra overhead also needs to be solved urgently.On the basis of symmetrical encryption algorithm,a new solution named HS-OSPF was put forward.HS-OSPF extended the original two-level hierarchical structure as well as designed a reasonable,efficient key distribution and management scheme.The result shows that the shortcomings of traditional solution are overcome,key storage and system overhead are reduced and real-time of security communication is improved.
关 键 词:开放式最短路径优先协议 自治域内 对称加密算法 等级结构 存储量 实时性
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33