计算机工程与应用2017，Vol.53Issue(3)：131-137,7.DOI:10.3778/j.issn.1002-8331.1505-0175
网络攻击图逆向深度优先生成算法
Network attack graph backward depth-first building algorithm
司健 1陈鹏 1顾宁平 1孙凌枫 1王蔚旻1
作者信息
- 1. 中国电子科技集团公司 第二十八研究所 第一研究部,南京 210007
- 折叠
摘要
Abstract
Large-scale network has numerous nodes and complicated connection, which causes nodes explosion. Aiming at this characteristic, this paper puts forward a kind of attack graph building algorithm based on backward depth-first. Firstly, it explains the attack graph conception briefly, and analyzes the backward building algorithm. Whereas building at-tack graph needs network reachability test, and it brings up rule matching algorithm at the same time. Finally, it validates the attack graph algorithm in real network environment, and analyzes the result, which illuminates that the attack graph building algorithm can test network reachability efficiently in O(lgn)and optimize the attack graph building result.关键词
网络攻击图/攻击模板/有效路径/区间树/规则匹配Key words
network attack graph/attack pattern/available path/segment tree/rule matching分类
信息技术与安全科学引用本文复制引用
司健,陈鹏,顾宁平,孙凌枫,王蔚旻..网络攻击图逆向深度优先生成算法[J].计算机工程与应用,2017,53(3):131-137,7.
