| 摘要: |
| 分析了基于有穷状态自动机的正则表达式匹配方法的时间复杂度、空间复杂度以及二者之间的制约关系,深入讨论了在网络安全应用中遇到的特有问题与挑战.围绕这两个问题,对当前出现的多种优化技术和策略进行了全面的综述和评价,最后对未来的研究方向进行了总结和展望. |
| 关键词: 特征匹配 深度包检测 正则表达式 有穷自动机 内存缩减 |
| DOI：10.3724/SP.J.1001.2011.04034 |
| 分类号: |
| 基金项目:国家自然科学基金(60903209); 国家重点基础研究发展计划(973)(2007CB311100); 国家高技术研究发展计划(863)(2009AA01Z437, 2007AA01Z406, 2007AA01Z467, 2007AA01Z442, 2007AA01Z474, 2011AA012504) |
|
| Regular Expressions Matching for Network Security |
|
ZHANG Shu-Zhuang1, LUO Hao2, FANG Bin-Xing1,2
|
|
1.School of Computer Science and Technology, Harbin Institue of Technology, Harbin 150001, China;2.Information Security Research Center, Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100190, China
|
| Abstract: |
| This paper analyzes the regular expression matching methods’ time complexity, space complexity and the tradeoff between them. The experiences, problems, and challenges encountered by the regular expression matching in network security field are well-classified and discussed in depth. Focusing on the two issues, a comprehensive overview of the current optimizing techniques and strategies adopted by academic and business communities is presented. Finally, a conclusion and some suggestions for future research are put forward. |
| Key words: signature matching deep packet inspection regular expression finite automata memory reduction |
