###
Journal of Software:2011.22(8):1838-1854

面向网络安全的正则表达式匹配技术
张树壮,罗浩,方滨兴
(哈尔滨工业大学 计算机科学与技术学院,黑龙江 哈尔滨 150001;中国科学院 计算技术研究所 信息安全研究中心,北京 100190)
Regular Expressions Matching for Network Security
ZHANG Shu-Zhuang,LUO Hao,FANG Bin-Xing
(School of Computer Science and Technology, Harbin Institue of Technology, Harbin 150001, China;Information Security Research Center, Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100190, China)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 7073   Download 8136
Received:March 22, 2010    Revised:October 11, 2010
> 中文摘要: 分析了基于有穷状态自动机的正则表达式匹配方法的时间复杂度、空间复杂度以及二者之间的制约关系,深入讨论了在网络安全应用中遇到的特有问题与挑战.围绕这两个问题,对当前出现的多种优化技术和策略进行了全面的综述和评价,最后对未来的研究方向进行了总结和展望.
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.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(60903209); 国家重点基础研究发展计划(973)(2007CB311100); 国家高技术研究发展计划(863)(2009AA01Z437, 2007AA01Z406, 2007AA01Z467, 2007AA01Z442, 2007AA01Z474, 2011AA012504) 国家自然科学基金(60903209); 国家重点基础研究发展计划(973)(2007CB311100); 国家高技术研究发展计划(863)(2009AA01Z437, 2007AA01Z406, 2007AA01Z467, 2007AA01Z442, 2007AA01Z474, 2011AA012504)
Foundation items:
Reference text:

张树壮,罗浩,方滨兴.面向网络安全的正则表达式匹配技术.软件学报,2011,22(8):1838-1854

ZHANG Shu-Zhuang,LUO Hao,FANG Bin-Xing.Regular Expressions Matching for Network Security.Journal of Software,2011,22(8):1838-1854