Method for quickly searching killing chain path based on complex network
The invention discloses a method for quickly searching a killing chain path based on a complex network. The method comprises the following steps: acquiring a combat network and a killing chain type character string; splitting the killing chain type character string to obtain single characters repres...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The invention discloses a method for quickly searching a killing chain path based on a complex network. The method comprises the following steps: acquiring a combat network and a killing chain type character string; splitting the killing chain type character string to obtain single characters representing node types, and calculating a transfer matrix of adjacent node types in the combat network; sequentially multiplying all the transfer matrixes to obtain an arrival matrix; calculating traces reaching the matrix; extracting row and column serial numbers of non-zero elements in the transfer matrix, and constructing a directed network; and calculating to obtain a shortest closed path by using a complex network method, and outputting all non-repeated paths of the killing chain type. The invention also discloses a system for quickly searching the killing chain path based on the complex network. According to the method, a killing chain path is quickly searched for a complex combat network, systematization, scienti |
---|