arXiv:2308.10208
Real-time Regular Expression Matching
원문 초록
This paper is devoted to finite state automata, regular expression matching, pattern recognition, and the exponential blow-up problem, which is the growing complexity of automata exponentially depending on regular expression length. This paper presents a theoretical and hardware solution to the exponential blow-up problem for some complicated classes of regular languages, which caused severe limitations in Network Intrusion Detection Systems work. The article supports the solution with theorems on correctness and complexity.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Robust PPO-optimized Tabular Transformer Framework for Intrusion Detection in Industrial IoT Systems
CAGN-GAT Fusion: A Hybrid Contrastive Attentive Graph Neural Network for Network Intrusion Detection
Evaluating the Potential of Quantum Machine Learning in Cybersecurity: A Case-Study on PCA-based Intrusion Detection Systems
A Comparative Analysis of DNN-based White-Box Explainable AI Methods in Network Security
Continual Learning with Strategic Selection and Forgetting for Network Intrusion Detection
PyOD 2: A Python Library for Outlier Detection with LLM-powered Model Selection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.