Loss‐Guided Dynamic Step Adversarial Attack Algorithm for Network Intrusion Detection Systems

ABSTRACT Deep Neural Networks (DNNs) have recently achieved remarkable success in the field of network security, and deep neural network‐based Intrusion Detection Systems (IDSs) are able to automatically learn potential patterns from network traffic and detect malicious traffic. However, IDSs are vulnerable to adversarial network traffic, which weakens their defense capabilities. Therefore, IDSs need high‐quality adversarial traffic for adversarial training to improve robustness. Existing adversarial sample generation algorithms are mainly focused on image‐based applications, overlooking the textual features of network traffic and inadequately considering perturbation magnitude. In response to these challenges, this paper proposes a Loss‐Guided Dynamic Step Adversarial Attack for Network Intrusion Detection Systems (LGDA) and a Discrete Adversarial Rounding (DAR) scheme. The LGDA analyzes model loss trend and dynamically adjusts perturbation step size to balance attack effectiveness and perturbation magnitude. The DAR targets discrete text features in network traffic, using integer encoding and rounding to allow partial preservation of perturbation direction, ensuring compatibility between existing adversarial attack algorithms and network traffic. Compared with state‐of‐the‐art adversarial attacks, experimental results on the NSL‐KDD, UNSW‐NB15, and CIC‐IDS2017 datasets using five models (LR, MLP, CNN, LSTM, and Transformer) show that the LGDA improves the attack success rate by 12.9% and reduces the perturbation magnitude by 19.1%. Additionally, the DAR scheme can be incorporated into any adversarial attack algorithm in the field of network security, increasing adversarial sample's attack success rate by 6.9%.

Authors

Institutions

Publication Details

Journal
Concurrency and Computation Practice and Experience
Published
2025-11-08
DOI
https://doi.org/10.1002/cpe.70340
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Loss‐Guided Dynamic Step Adversarial Attack Algorithm for Network Intrusion Detection Systems

Ying Du, Roshan Kumar, Xiaoyu Du, Haodong Zhao et al.
Concurrency and Computation Practice and Experience
Network Security and Intrusion Detection
article

Loss‐Guided Dynamic Step Adversarial Attack Algorithm for Network Intrusion Detection Systems

Ying Du, Roshan Kumar, Xiaoyu Du, Haodong Zhao, Jun Jiang
article en

Abstract

ABSTRACT Deep Neural Networks (DNNs) have recently achieved remarkable success in the field of network security, and deep neural network‐based Intrusion Detection Systems (IDSs) are able to automatically learn potential patterns from network traffic and detect malicious traffic. However, IDSs are vulnerable to adversarial network traffic, which weakens their defense capabilities. Therefore, IDSs need high‐quality adversarial traffic for adversarial training to improve robustness. Existing adversarial sample generation algorithms are mainly focused on image‐based applications, overlooking the textual features of network traffic and inadequately considering perturbation magnitude. In response to these challenges, this paper proposes a Loss‐Guided Dynamic Step Adversarial Attack for Network Intrusion Detection Systems (LGDA) and a Discrete Adversarial Rounding (DAR) scheme. The LGDA analyzes model loss trend and dynamically adjusts perturbation step size to balance attack effectiveness and perturbation magnitude. The DAR targets discrete text features in network traffic, using integer encoding and rounding to allow partial preservation of perturbation direction, ensuring compatibility between existing adversarial attack algorithms and network traffic. Compared with state‐of‐the‐art adversarial attacks, experimental results on the NSL‐KDD, UNSW‐NB15, and CIC‐IDS2017 datasets using five models (LR, MLP, CNN, LSTM, and Transformer) show that the LGDA improves the attack success rate by 12.9% and reduces the perturbation magnitude by 19.1%. Additionally, the DAR scheme can be incorporated into any adversarial attack algorithm in the field of network security, increasing adversarial sample's attack success rate by 6.9%.

Concurrency and Computation Practice and ExperienceVol. 37(27-28)
Henan University of Science and Technology (CN), Henan University of Technology (CN), Henan University of Engineering (CN), Henan Forestry Vocational College (CN)
Openalex Percentile: Top 61%
Network Security and Intrusion Detection
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.