Generation Method of Network Attack Graph Based On Greedy Heuristic Algorithm

Abstract

mailfengy@163.com Abstract State explosion has become a serious problem of attack graph generation method, which results in a large-scale attack graph. Attackers always try to infiltrate into the internal network quickly, access to the more important host directly and get higher access right. The model of network attack graph generation is established based on these premises. The model expands network state node according to the evaluation function. If the valuation function value is smaller, it is the priority to expand. The evaluation value is calculated by the path length, attack difficulty, type of target host and authority obtained after the attack. Experimental results show that the network attack graph generation method based on greedy heuristic algorithm can do well in network attack graph generation, and it has a lower time complexity and good scalability. The research for this article has a great significance to improve the usefulness of network attack