Autonomous Penetration Test Path Planning Based on OIPPO

Intelligent penetration testing combines deep reinforcement learning to plan attack paths and simulate complex attack scenarios to identify system weaknesses. Compared with traditional penetration testing, it can learn and optimize strategies independently and simulate more complex attack paths and attacker behaviors.However, the existing methods have problems such as gradient explosion, gradient disappearance and suboptimal solution in the training process. In order to solve these problems, this paper introduces proximal policy optimization (PPO) algorithm, and proposes an improved PPO algorithm which combines orthogonal initialization and policy entropy control (OIPPO).The algorithm combines the advantages of orthogonal initialization and PPO algorithm, and improves the performance and efficiency of the algorithm through policy entropy control. The experimental results show that the convergence speed of OIPPO algorithm is better than that of traditional PPO and its improved algorithms in various network scenarios, and it shows better effectiveness, scalability and compatibility when the network scale is expanded.

Authors

Institutions

Publication Details

Published
2024-12-06
DOI
https://doi.org/10.1109/ricai64321.2024.10911631
Citations
2
Primary Topic
Network Packet Processing and Optimization
Type
article
Field-Weighted Citation Impact
0.98
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Autonomous Penetration Test Path Planning Based on OIPPO

Qiang Yang, Yan Huang, Mengqi Zhang, Bo Yu
2 citations
Network Packet Processing and Optimization
0.98
article

Autonomous Penetration Test Path Planning Based on OIPPO

Qiang Yang, Yan Huang, Mengqi Zhang, Bo Yu
article en
2 citations

Abstract

Intelligent penetration testing combines deep reinforcement learning to plan attack paths and simulate complex attack scenarios to identify system weaknesses. Compared with traditional penetration testing, it can learn and optimize strategies independently and simulate more complex attack paths and attacker behaviors.However, the existing methods have problems such as gradient explosion, gradient disappearance and suboptimal solution in the training process. In order to solve these problems, this paper introduces proximal policy optimization (PPO) algorithm, and proposes an improved PPO algorithm which combines orthogonal initialization and policy entropy control (OIPPO).The algorithm combines the advantages of orthogonal initialization and PPO algorithm, and improves the performance and efficiency of the algorithm through policy entropy control. The experimental results show that the convergence speed of OIPPO algorithm is better than that of traditional PPO and its improved algorithms in various network scenarios, and it shows better effectiveness, scalability and compatibility when the network scale is expanded.

National University of Defense Technology (CN)
Openalex Percentile: Top 21%
Network Packet Processing and Optimization
0.98
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Autonomous Penetration Test Path Planning Based on OIPPO — Qiang Yang, Yan Huang, et al. · (2024) | TGRS Research Map | TGRS