面向网络安全的支撑技术研究
|
摘要
随着网络数据流量和传输速率的增加,当前网络安全防护系统的性能难以满足高速网络环境的需求。软件安全产品中的由CPU指令执行的安全算法逐渐被算法加速芯片所替代。本文针对网络安全防护技术的硬件化实现所涉及的支撑技术开展研究,研究的内容主要包括大数模乘运算和模加运算的快速实现、数据流多模式匹配算法、数据流分类算法等。最后将这些研究的算法集成在一款芯片里进行验证,并分析该芯片的系统结构和性能,实验结果表明,芯片无论在密码处理还是入侵检测方面都有较高的性能。
大数模乘和模加运算是密码算法的关键运算和性能瓶颈。本文提出一种完全并行脉动阵列结构的Montgomery模乘算法和基于并行进位链的大数加法的实现方法。模乘算法的实现方法通过并行的流水线结构提高算法的数据处理能力,采用并行度m和P级流水线的脉动阵列电路结构,既提高了模乘运算的速度,又有利于资源和速度的可配置实现。大数加法的实现方法将参与加法运算的大数进行分组；每个分组采用改进的超前进位技术减少组里的进位延时,组间通过并行进位完成不同进位状态下的加法运算；最后通过每个分组产生的进位状态判断最终结果。该方法通过将进位状态传递过程转换为相邻进位状态等式比较,组间进位延迟时间随着加数位数的增加而保持不变。
高速网络环境下的数据流具有高速、时序性、随时间变化等动态特性,对这些数据流进行实时匹配要求模式匹配算法的时间复杂度和空间复杂度较小、存储容量与数据流的数量无关。基于多模式匹配算法Wu-Manber的思想,本文提出了一种适应不同长度模式串的高速数据流多模式匹配算法Dataflow-Wu-Manber。该算法进行了以下优化：当待匹配字符串没有在模式串中出现时引入了待匹配字符串和模式串前缀的相关度增大移动距离；当待匹配字符串的摘要值匹配成功时采用启发式匹配的方法增大移动距离；通过对字符串的摘要值匹配提高第一次匹配的精度,减少访问存储器的概率；采用多级缓存并行匹配减少长模式串匹配的时间。实验结果表明,新算法对于不同长度模式串的匹配效率大大提高。
在基于数据流的入侵检测分析中,时间段越近的数据流属性对当前检测模型影响越大,越远的数据流属性影响越小。本文针对ensemble classifiers算法时间复杂度较高等缺点,提出了一种基于时间窗口权值的数据流分类算法TWWFP。该算法将数据流划分成连续的滑动窗口,对滑动窗口中的每个基本窗口赋予一个与时间有关的窗口权值,时间越近的窗口权值越大,时间越远的窗口权值越小；采用TWWFP-Tree结构存储当前滑动窗口中每个基本窗口中的频繁数据属性,在新的基本窗口流入当前滑动窗口时实时更新TWWFP-Tree结构；检测相邻两个滑动窗口中权值属性的平均分类误差,发现突变后及时调整下一个滑动窗口的长度以适应数据流的变化。实验结果表明,该算法通过时间窗口权值和检测相邻窗口变化提高了数据流分类的精确度和自适应能力。
针对高速网络环境下的安全防护,提出一种高性能的网络安全防护系统模型,该模型通过算法加速芯片保证数据处理的实时性。算法加速芯片集成了大数模乘运算和大数模加运算的快速实现方法、数据流多模式匹配算法Dataflow-Wu-Manber、数据流分类算法TWWFP,采用专用硬件加速、并行处理技术和流水线技术等减少数据处理的时间,提高了网络安全防护的性能,保证网络的实时性。通过DE2-115开发板验证了算法加速芯片的性能。结果表明,网络安全支撑技术的研究成果大大提高了网络安全防护处理的性能。
As the flow rate of network data and the quantity of information to be transmitted increase, the processing performance of the network security protection system can not meet the current requirements in high speed network. The security algorithm of Security software products that used to be performed by the CPU's instructions has been gradually replaced by the algorithm acceleration chip. This paper focuses on the support technology involved in network security protection implementation based on hardware, such as fast implementation of large number modular multiplication and large number modular addition, data stream multi-pattern matching algorithm, data stream classification algorithm, etc. Finally, the algorithms for these researches are integrated in a chip for validation, and the system architecture and the performance of the chip are also analyzed. The experimental results show that the chip has better capability in cryptographic processing and intrusion detection.
Modular multiplication and modular addition for large numbers are the key operations and performance bottlenecks of cryptographic algorithm. A novel implementation method for modular multiplication called as the entirely parallel systolic array architecture and large number modular addition based on parallel carry-chain is presented in the paper. The implementation method for modular multiplication adopts the systolic array circuit architecture with degree m of parallelism and level P of pipelining, which not only can speed up modular multiplication operation, but also be of great advantage to improve the configurable implementation of resources. The implementation method for large number modular addition divides large numbers involving in adding operation into many groups, and the improved carry look-ahead method is used to reduce carry delay in each group. Carry-parallel method is used to implement adding operation in different states of carry. The final result of addition is determined by carry states of groups. The method keeps the carry delay of addition unchanged as data width increases, because the processing of carry transferring is translated into the carry state equation comparison of groups.
The data stream in high speed network environment has some dynamic features, such as high speed, performance of time sequence, changing over time and so on. The real-time matching algorithm of data stream should have the following characteristics:low complexities of time and space, and the storage capacity being independent of the length of data stream. The paper presents a novel pattern matching algorithm for data stream applicable to pattern strings with different lengths, which is called as Dataflow-Wu-Manber. The novel algorithm adopts the degree of correlation of character strings to be matched and prefix-pattern strings to increase the migration distance when the pattern string does not include character strings to be matched; adopts the heuristic matching method to increase the migration distance when the abstract value of character strings matches successfully; adopts the abstract matching to improve the precision of the first matching and reduce the probability of accessing to the storage, and adopts multi-level cache parallel matching to reduce the time of the length-pattern string matching. The experimental results show that the new method can improve the matching efficiency of pattern strings with different lengths.
In intrusion detection analysis system based on data stream, the closer the time quantum of data stream are, the more the current detection model is affected, while the further the time quantum of data stream are, the less the current detection model is affected. The paper presents the data stream classification algorithm TWWFP based on time window weighted value because of the disadvantages of the higher time complexity of ensemble classifiers algorithm. The data stream is divided into consecutive sliding windows, with every basic window in the sliding window endowed with window weighted value related to time. The closer the time is, the bigger the window weighted value is, while the further the time is, the smaller the window weighted value is. The frequent data attributes of every basic window in the current sliding window are stored in TWWFP-Tree which is updated in real time when a new basic window enters the current sliding window. When detecting the average classification error of the weighted value attributes in two adjacent sliding windows, the length of the next sliding window will be adjusted to adapt to the changes in data stream after an abrupt change is detected. The experimental results show that the novel algorithm improves the precision and the self adaptation capability of data stream classification via the time window weighted value and by detecting the changes in the adjacent windows.
A network security protection system model with high-capability is presented orienting to high speed network environment in the paper, assuring the realtimeness of data processing via algorithm accelerated chip, which integrates fast implementation methods of large number modular multiplication and large number modular addition, data stream multi-pattern matching algorithm Dataflow-Wu-Manber and data stream classification algorithm TWWFP; and adopts the design methods of hardware speedup, parallel processing and pipelining to reduce the time of data processing, improving the capability of network security protection and ensuring the realtimeness of network. The capability of algorithm accelerated chip is validated through DE2-115exploitation board. The results show that the research on support technology of network security protection based on hardware is beneficial to improve the capability of network security protection processing.
大数模乘和模加运算是密码算法的关键运算和性能瓶颈。本文提出一种完全并行脉动阵列结构的Montgomery模乘算法和基于并行进位链的大数加法的实现方法。模乘算法的实现方法通过并行的流水线结构提高算法的数据处理能力,采用并行度m和P级流水线的脉动阵列电路结构,既提高了模乘运算的速度,又有利于资源和速度的可配置实现。大数加法的实现方法将参与加法运算的大数进行分组；每个分组采用改进的超前进位技术减少组里的进位延时,组间通过并行进位完成不同进位状态下的加法运算；最后通过每个分组产生的进位状态判断最终结果。该方法通过将进位状态传递过程转换为相邻进位状态等式比较,组间进位延迟时间随着加数位数的增加而保持不变。
高速网络环境下的数据流具有高速、时序性、随时间变化等动态特性,对这些数据流进行实时匹配要求模式匹配算法的时间复杂度和空间复杂度较小、存储容量与数据流的数量无关。基于多模式匹配算法Wu-Manber的思想,本文提出了一种适应不同长度模式串的高速数据流多模式匹配算法Dataflow-Wu-Manber。该算法进行了以下优化：当待匹配字符串没有在模式串中出现时引入了待匹配字符串和模式串前缀的相关度增大移动距离；当待匹配字符串的摘要值匹配成功时采用启发式匹配的方法增大移动距离；通过对字符串的摘要值匹配提高第一次匹配的精度,减少访问存储器的概率；采用多级缓存并行匹配减少长模式串匹配的时间。实验结果表明,新算法对于不同长度模式串的匹配效率大大提高。
在基于数据流的入侵检测分析中,时间段越近的数据流属性对当前检测模型影响越大,越远的数据流属性影响越小。本文针对ensemble classifiers算法时间复杂度较高等缺点,提出了一种基于时间窗口权值的数据流分类算法TWWFP。该算法将数据流划分成连续的滑动窗口,对滑动窗口中的每个基本窗口赋予一个与时间有关的窗口权值,时间越近的窗口权值越大,时间越远的窗口权值越小；采用TWWFP-Tree结构存储当前滑动窗口中每个基本窗口中的频繁数据属性,在新的基本窗口流入当前滑动窗口时实时更新TWWFP-Tree结构；检测相邻两个滑动窗口中权值属性的平均分类误差,发现突变后及时调整下一个滑动窗口的长度以适应数据流的变化。实验结果表明,该算法通过时间窗口权值和检测相邻窗口变化提高了数据流分类的精确度和自适应能力。
针对高速网络环境下的安全防护,提出一种高性能的网络安全防护系统模型,该模型通过算法加速芯片保证数据处理的实时性。算法加速芯片集成了大数模乘运算和大数模加运算的快速实现方法、数据流多模式匹配算法Dataflow-Wu-Manber、数据流分类算法TWWFP,采用专用硬件加速、并行处理技术和流水线技术等减少数据处理的时间,提高了网络安全防护的性能,保证网络的实时性。通过DE2-115开发板验证了算法加速芯片的性能。结果表明,网络安全支撑技术的研究成果大大提高了网络安全防护处理的性能。
As the flow rate of network data and the quantity of information to be transmitted increase, the processing performance of the network security protection system can not meet the current requirements in high speed network. The security algorithm of Security software products that used to be performed by the CPU's instructions has been gradually replaced by the algorithm acceleration chip. This paper focuses on the support technology involved in network security protection implementation based on hardware, such as fast implementation of large number modular multiplication and large number modular addition, data stream multi-pattern matching algorithm, data stream classification algorithm, etc. Finally, the algorithms for these researches are integrated in a chip for validation, and the system architecture and the performance of the chip are also analyzed. The experimental results show that the chip has better capability in cryptographic processing and intrusion detection.
Modular multiplication and modular addition for large numbers are the key operations and performance bottlenecks of cryptographic algorithm. A novel implementation method for modular multiplication called as the entirely parallel systolic array architecture and large number modular addition based on parallel carry-chain is presented in the paper. The implementation method for modular multiplication adopts the systolic array circuit architecture with degree m of parallelism and level P of pipelining, which not only can speed up modular multiplication operation, but also be of great advantage to improve the configurable implementation of resources. The implementation method for large number modular addition divides large numbers involving in adding operation into many groups, and the improved carry look-ahead method is used to reduce carry delay in each group. Carry-parallel method is used to implement adding operation in different states of carry. The final result of addition is determined by carry states of groups. The method keeps the carry delay of addition unchanged as data width increases, because the processing of carry transferring is translated into the carry state equation comparison of groups.
The data stream in high speed network environment has some dynamic features, such as high speed, performance of time sequence, changing over time and so on. The real-time matching algorithm of data stream should have the following characteristics:low complexities of time and space, and the storage capacity being independent of the length of data stream. The paper presents a novel pattern matching algorithm for data stream applicable to pattern strings with different lengths, which is called as Dataflow-Wu-Manber. The novel algorithm adopts the degree of correlation of character strings to be matched and prefix-pattern strings to increase the migration distance when the pattern string does not include character strings to be matched; adopts the heuristic matching method to increase the migration distance when the abstract value of character strings matches successfully; adopts the abstract matching to improve the precision of the first matching and reduce the probability of accessing to the storage, and adopts multi-level cache parallel matching to reduce the time of the length-pattern string matching. The experimental results show that the new method can improve the matching efficiency of pattern strings with different lengths.
In intrusion detection analysis system based on data stream, the closer the time quantum of data stream are, the more the current detection model is affected, while the further the time quantum of data stream are, the less the current detection model is affected. The paper presents the data stream classification algorithm TWWFP based on time window weighted value because of the disadvantages of the higher time complexity of ensemble classifiers algorithm. The data stream is divided into consecutive sliding windows, with every basic window in the sliding window endowed with window weighted value related to time. The closer the time is, the bigger the window weighted value is, while the further the time is, the smaller the window weighted value is. The frequent data attributes of every basic window in the current sliding window are stored in TWWFP-Tree which is updated in real time when a new basic window enters the current sliding window. When detecting the average classification error of the weighted value attributes in two adjacent sliding windows, the length of the next sliding window will be adjusted to adapt to the changes in data stream after an abrupt change is detected. The experimental results show that the novel algorithm improves the precision and the self adaptation capability of data stream classification via the time window weighted value and by detecting the changes in the adjacent windows.
A network security protection system model with high-capability is presented orienting to high speed network environment in the paper, assuring the realtimeness of data processing via algorithm accelerated chip, which integrates fast implementation methods of large number modular multiplication and large number modular addition, data stream multi-pattern matching algorithm Dataflow-Wu-Manber and data stream classification algorithm TWWFP; and adopts the design methods of hardware speedup, parallel processing and pipelining to reduce the time of data processing, improving the capability of network security protection and ensuring the realtimeness of network. The capability of algorithm accelerated chip is validated through DE2-115exploitation board. The results show that the research on support technology of network security protection based on hardware is beneficial to improve the capability of network security protection processing.
引文
[1]王小非.海上网络战[M].国防工业出版社,2006.
[2]张锦春,鲁智勇,陈永光.C3I系统网络安全试验鉴定环境的设计及试验模式分析[J].电子对抗试验,2006,16(54)：39-42.
[3]王小非.C3I系统中的数据融合技术[M].哈尔滨工程大学出版社,2006.
[4]郑龙,刘敬军,罗鹏程等.C3I系统的网络可靠性综述[J].计算机技术与发展,2006,16(4)：11-13.
[5]夏学知,余幼平,樊兴.信息战条件下海军C3I系统安全性及对策分析[J].舰船电子工程,2004,24(21)：22-25.
[6]W. Stallings. Cryptography and Network Security:Principles and Practice[M]. PrenticeHall. Third edition.2003.
[7]NA W,WOU Bei. A thermal equivalent circuit for PEM fuel cell temperature control design[C]//Proc of International Symposium on Circuits and Systems.2008:2825-2828.
[8]冯登国.国内外密码学研究现状及发展趋势[J],通信学报,2002,23(5)：18-26.
[9]DeverSYS Corporation. Ultra High Speed AES(Rijndael)Crypto Processor [EB/OL]. http://deversys.com/?action=pproject&id=43,2008:12-10.
[10]赵险峰.一种保护芯片设计的多变量加密及其电路结构[J].电子学报.2009,37(6)：1300-1306.
[11]赵佳,韩军,曾晓洋等.AES算法的并发错误检测方法及其VLSI实现[J].计算机研究与发展.2009,46(4)：594-601.
[12]Liu Zhenhua, Hu Yupu, Zhang Xiangsong, et al. Provably Secure multi-proxy, signature scheme with revocation in the standard model [J]. Computer Comm-unications,2011,34(3):494-501.
[13]牟永敏,李美贵,梁琦.入侵检测系统中模式匹配算法的研究[J].电子学报,2006,34(12A)：2488-2490.
[14]卿斯汉,蒋建春,马恒太等.入侵检测技术研究综述[J].通信学报,2004,25(7)：20-29.
[15]Jung Won Kim. Integrating Artificial Immune Algorithms for Intrusion Detection[D]. PhD thesis, UK:Department of Computer Science, University of London,2002.
[16]杨晓辉,戴紫彬,张永福.可重构分组密码处理结构模型研究与设计[J].计算机研究与发展.2009,46(6)：962-967.
[17]G R Blakley. A Computer Algorithm for Calculationg the product AB modulo M[J]. IEEE Trans,1983:C-32(5):497-500.
[18]Koc C K, C Y Hung. Adaptive M-ary Segmentation and Canonical Recoding Algorithms for Multiplication of Large Binary Numbers[J]. Computers and Mathematics with Applications,1992,24(3):2-3.
[19]Montgomery P L. Modular Multiplication without Trial Division [J]. Mathematics of Computation.1985,44(170):519-521.
[20]Wang Yanbing, Ye Bing, Shun Dongyu. The design of the smart-cart coprocessor basing on improving Modular multiplication algorithm [J]. Microelectronic and computer.2004,21 (12):104-105.
[21]S E Eldrifge. C D Walter. Hardware implementation of Montgomery's modular multiplication algorithm[J]. IEEE Transaction on Computers,1993,42(6): 693-699.
[22]Buclunann J, Williams. H. C, Quadratic Fields and Cryptography [M]. Number Theory and ryptography, Loxton J, H ed. Cambridge University Press,1990: 10-25.
[23]Chacko, Mathew Vadakkan. Public Key Crypto-systems:History and Developments[C]. Columbia University, PhD thesis,1999:5-24.
[24]Dusse S R, Kaliski Jr B S. A Cryptographic library for the Motorola DSP56000[C]. Advances in Cryptology EUROCRYPT90,1990:230-244.
[25]Timoth J, Albert F, Schlegel, et al. IBM's S/390 micro- processor [J]. IEEE MICRO,1999,19 (2):12-23.
[26]Kessler R E. The alpha 21264 microprocessor [J]. IEEE MICRO,1999,19(2): 24-36.
[27]Nagendra C, Irwin M J, Owens R W. Area-time-power tradeoffs in parallel adders[J]. IEEE transactions on Circuits and Systems Ⅱ,1996,43(10): 689-702.
[28]Wang Chuachin, Huang Chenjung, Tai Kunchu. A 1.0-GHz 0.6um 8-bit carry lookahead adder using PLA-styled all-n-transister logic[J]. IEEE Transactions on Circuits and Systems,2000,47(2):133-135.
[29]Schulte M J, Chirca K, Glossner J, et al. A low-power carry skip adder with fast saturation [C].Proceedings of the 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors. Los Alamios, CA, USA:IEEE,2004:269-279.
[30]Bedrij O J. Cary-select Adder [J]. IRE Trans Electron Comput,1962, EC-11: 340-346.
[31]Yen-Mou Huang, Kuo J B. A High-Speed Conditional Carry Select (CCS) Adder Circuit with a Successively Incremented Carry Number Block(SICNB) Structure for Low-Voltage VLSI Implementation[J]. Circuits and Systems II:Analog and Digital Signal Processing, IEEE Transactions on.2007, 47(10):1074-1079.
[32]李涛.基于免疫的网络监控模型[J].计算机学报,2006,29(9)：1515-1522.
[33]冉占军,姚全珠,王晓峰等.模式匹配算法在入侵检测中的应用[J].现代电子技术,2009,2：63-67.
[34]吴诚堃,殷健平,蔡志平等.网络入侵检测系统中基于多核平台的模式匹配技术研究.计算机工程与科技.2009,31(9)：1-4.
[35]辛阳,魏景芝,钮心忻等.用于入侵检测的快速多模式匹配算法[J].北京邮电大学学报,2008,31(3)：19-23.
[36]高朝勤,陈元琰,李梅.一种面向入侵检测的快速多模式匹配算法[J].计算机应用,2008,28(1)：82-84.
[37]WU Sun, MANBER U. A fast algorithm for Multi-pattern searching [J]. Tucson: Department of Computer Science, University of Arizona,1994:1-11.
[38]Xuan Y, Shin I, Thai MT, Znati T. Detecting application denial-of-service attacks:Agroup-testing-based approach. IEEE Trans[J]. on parallel and distrobited systerms.2010,21(8):1203-1216. [doi:10.1109/TPPS.20090147].
[39]Huang H, He QM, He JF, Ma LH. RADAR:Rare category detectiong via computation of boundary degree[J]. In:Huang JZ, Cal L, Srivastava J, eds. Advances in knowledge Discovery and Data Mining CPAKDD 2011, LNAI6635, Heidelberg: Springer-verlag,2011.258-269. [doi:10.1007/978-3-642-20847-8-22].
[40]张凤斌,杨永田.遗传算法在基于网络异常的入侵检测中的应用.电子学报[J],2004,32(5)：875-877.
[41]张凤斌,杨永田.基于人工免疫原理的入侵检测技术的研究[J].电机与控制学报.2004,8(2)：183-186.
[42]Yang Y, Lin X. A Re-examination of Text Categorization Methods [C].22nd Annual International ACM SIGIR Conference on Research and Development in the Information Retrieval.New York:ACM Press,1999:42-49.
[43]R.0. Duda & P. E. Hart. Pattern classification and scene analysis[M]. New York:Wiley,1973.
[44]QUINLAN J R. Induction on decision trees[J]. Machine Learning,1986, 13(1):81-106.
[45]QUINLAN J R. C4.5:programs for machine learning[M]. San Mateo:Morgan Kaufmann,1993.
[46]Agrawal R, Srikant R. Fast algorithms for mining association rules[C]. Proceedings of the 1994 Very Large Data Bases. Santiago de, Chile: Morgan Kanfmann,1994:487-499.
[47]侯俊杰,李春平.一种基于模式增长的频繁模式挖掘算法[J].华中科技大学学报(自然科学版),2005,33(10)：272-274.
[48]Babcock B, Babu S, Datar M, et al. Models and issues in data stream systems[C]. Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART- SIGART Symposium on Principles of Database Systems. Madison, USA:ACM Press,2002:1-16.
[49]Golab L, Ozsu M T. Issues in data stream management [J]. ACM SIGMOD Record, 2003,32 (2):5-14.
[50]QIN Shou-ke, QIAN Wei-ning, ZHOU Ao-ying. Approximately processing multi-granularity aggregate queries over a data Engineering. Washington DC:IEEE Computer Society,2006:468-472.
[51]0'Callaghan L, Mishra N. Meyerson A, et al. Streaming-data algorithms for high-quality clustering[C]. Proc of the 18th International Conference on Data Engineering. Washington USA:IEEE Computer Society,2002:685-700.
[52]Guha S, Meyerson A, Mishra N, et al. Clustering data streams:theory and practice[J]. IEEE Transactions on Knowledge and Data Engineering,2003, 15(3):515-528.
[53]张昕,李晓光,王大玲,等.数据流中一种快速启发式频繁模式挖掘方法[J].软件学报,2005,16(12)：2099-2105.
[54]孟小峰,周龙骧,王珊.数据库技术发展趋势[J].软件学报,2004,15(12)：1822-1836.
[55]陈宇峰,鲁东明等.面向大规模网络的聚集TCP流量模拟方法研究[J].通信学报,2006,27(2)：100-106.
[56]赵峰,李庆华,金莉.多维流序列并行算法研究[J].小型微型计算机系统,2007,28(2)：333-336.
[57]Chen Y, Dong G, Han Jia-wei, et al. Multi-dimensional regression analysis of time-series data streams[C]//Proc 2002 Int Conf Very Large Data Bases(VLDB'02),2002:323-334.
[58]Aggarwal C C A framework for projected clustering of high dimensional data streams[C]. Proc of the 30th VLDB Conf. Toronto Canada:VLDB Endowment, 2004:852-863.
[59]Fraleigh, Moon, Lyles, Cotton et al. Packet-Level Traffic Measur-ements from the Sprint IP Backbone, IEEE Network, November/Decem-ber 2003,17 (6).
[60]Diff ie W, Hellman M.E. New direction in cryptography [C]. IEEE Trans, on Information Theory, Vol. IT-22, No.6,1976:644-654.
[61]Rivest R L, Shamir A, Adleman L M. A method for obtaining digital signature and public key cryptosystems[J]. Communications of the ACM.1978.21 (2): 120-126.
[62]Diffie W, Hellman M E. New directions in cryptography[J]. IEEE Transction on Information Theory.1976. IT-22(6):644-654.
[63]ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms[J]. IEEE Transction on Information Theory.1985. IT-31(4):469-472.
[64]S. Jha, K. Tan, R. A. Maxion. Markov Chains, Classifiers, and Intrusion Detection[C].14th IEEE Computer Security Foundations Workshop(CSFW' 01).2001:0206-0219.
[65]C. Sinclair, L. Pierce and S. Matzner. An Application of Machine Learning to Network Intrusion Detection[C].15th Annual Computer Security Applications Conference. Arizona,1999:371-377.
[66]蔡忠闽,管晓宏,邵萍等.基于粗糙集理论的入侵检测新方法[J].计算机学报,2003,26(3)：361-366.
[67]Zhang Lian-hua, Zhang Guan-hua, YU Lang, et al. Intrusion Detection Using Rough Set Classification[J]. Joursnal of Zhejiang university SCIENCE, 2004,5(9):1076-1086.
[68]凌军,曹阳,尹健华等.基于时态知识模型的网络入侵检测方法研究[J].计算机学报,2003,26(11)：1591-1597.
[69]陶新民,陈万海,郭黎利.一种新的机遇模糊聚类和免疫原理的入侵检测模型[J].电子学报,2006,34(7)：1329-1332.
[70]SMITH R, GOYAL N, ORMONT J, et al. Evaluating GPUs for network packet signature matching[C]//Proc of International Symposium on Performance Analysis of Systems and Software.2009.
[71]SMITH R,ESTAN C, JHA S. XFA:fast signature matching with extended automata[C]//Proc of Symposium on Security and Privacy. Los Alamitos:IEEE Computer Society,2008" 187-201.
[72]VASILIADIS G, ANTONATOS S, POLYCHRONAKIS M, et al. Gnort:high performance network intrusion detection using graphics processor[C]//Proc of the 11th International Symposium on Recent Advances in Intrusion Detection. Berlin, Heidelberg:Springer- Verlag,2008:116-134.
[73]WU Chen-kun, YIN Jian-ping, CAI Zhi-ping, et al. A hybrid parallel signature matching model for network security applications using SIMD GPU[C]//Proc of the 8th International Symposium on Advanced Parrallel Processing Technologies.Berlin, Heidelberg:Springer-Verlag,2009:191-204.
[74]Hutchings B L, Franklin R, Carver D. Assisting network intrusion detection with re-configurable hardware[A]. Proceeding of the 10th IEEE FCCMO2. 2002:111-119.
[75]孙志刚,张子文.正则表达式匹配的高效硬件实现[J].计算机工程与科学,2009,31(10)：5-8.
[76]Lyu S, Farid H. Steganalysis using color wavelet statistics and one-class support vector machines [C] SPIE S YMPOSIUM ON ELECTRONIC Imaging, San Jose, CA,2004:2-5.
[77]Walter C D. Systolic modular multiplieation[J]. IEEE Transa- ctions on computer,1992:376-380.
[78]Koc C K. High-speed RSA implementation[R]. RSA Labs technical Report-201, 1994:115-116.
[79]刘强,佟冬,程旭.部分并行的蒙哥马利模乘法器实现研究[J].电子学报,2006,34(8)：1537-1541.
[80]蒋晓娜,段成华.运算精简的蒙哥马利算法模乘器设计[J].计算机仿真,2008,25(5)：101-104.
[81]詹文法,马俊,谢莹等.多位快速加法器的设计[J].合肥工业大学学报(自然科学版),2005,28(10)：1281-1283.
[82]崔晓平,王成华.二级进位跳跃加法器的优化方块分配[J].南京航空航天大学学报.2007,33(4)：495-499.
[83]Daly A, Marnane W. Efficient architectures for implementing Montgomery modular multiplication and RSA modular exponent- iation on recomfigurable logic [A]. Proceedings of the Tenth ACM International Symposium on Field-Programmable Gate Arrays (FPGA 02)[c]. New York ACM Press, 2002:44-49.
[84]Mcivor C, Mcloone M, Mccanny J V, et al. Fast Montgomery modular multiplication and RSA cryptographic processor architectures [A]. Proceedings of the IEEEE 37th Asilomar Conference on Signals, Systems, and Computers[C]. New York:IEEE Press,2003.1:379-384.
[85]Cilardo A, Mazzeo A, Romano L, Saggese G P. Cary save Montgomery moduar exponentiation on reconfigurable hardware[A]. Proceed-ings of IEEE Design, Automation and Test in Europe Conference and Exhibition (DATA04)[C]. New York:IEEE Press,2004,3:206-211.
[86]k. Sakiyama, B. Preneel and I. Verbauwhede. A fast dual-field modular arithmetic logic unit and its hardware implementation [A]. Proceedings of IEEE international Symposium on Circuits and Systems (ISCAS 2006). 2006:787-790.
[87]Osama Al-Khaleel, Chris Papachristou, Kiamal Pekmestzi. FPGA- based Design of a Large Moduli Multiplier for Public-Key Cryptographic Systems[C]. Processing of 24th International Conference on Computer Design (ICCD 2006), San Jose, CA, USA 2006:314-320.
[88]Junfeng Fan, Kazuo Sakiyama, and Ingrid Verbauwhede. Montgomery Modular Multiplication Algorithm on Multi-core [C]. in Proc, IEEE Workshop on Signal Processing Systems:Design and Implemen- tation,2007:261-266.
[89]R. V. Kamala, M. B. Srimivas. High-Throughput Moontgomery Modular Multiplication[C]. Proceedings of 2006 IFIP International Conference on Very Large Scale Integration. Hyderabad 2006:58-62.
[90]MANZOUL M A. Parallel CLA algorithm for fast addition [A]. Proc Intl Par Comput EE Conf [C].2000:55-58.
[91]Pai Yu-ting, Chen Yu-kumg. The fastest carry lookahead dder [A]. Proceedings of the Second IEEE International Workshop on Electronic Design, Test and Applications [C]. Los Alamitos, CA, USA:IEEE,2004:434-436
[92]Cui Xiaoping, Wang Chenghua. Fast Carry-skip Adder Based on Block Carry-Lookahead[J]. Journal of Nanjing University of Aeronautics & Astronautics 2006,38(6):789-792.
[93]王永成,沈州,许一震.改进的多模式匹配算法[J].计算机研究与发展,2002,39(1)：55-60.
[94]Tuck N, Sherwood T, Calder B, Varghese G. Deterministic memory efficient string matching algorithms for intrusion detection[C]. In:LiVOK, ed. Proc. of the IEEE Infocom 2004. Piscataway:IEEE,2004:333-340.
[95]陈瑜,陈国龙.Wu-Manber算法性能分析及其改进[J].计算机科学,2006,33(6)：203-209.
[96]杨东红,徐恪.改进的Wu-Manber多模式匹配算法[J].清华大学学报：自然科学版,2006,46(4)：555-558.
[97]孙晓山,王强.一种改进的Wu-Manber多模式匹配算法以应用[J].中文信息学报,2006,20(2)：47-52.
[98]袁世忠,曹曼.基于WM算法的多模式匹配改进算法WMN[J].计算机工程与应用,2007,43(15)：128-130.
[99]马伟华,刘玉梅.一种改进的Wu-Manber多模式串匹配算法[J].应用科技,2007,34(10)：32-34.
[100]张国军,林南晖.一种快速且节约存储器的多模式匹配算法[J].小型微型计算机系统,2009,30(8)：1511-1527.
[101]Peng Shili, Tan Hansong. Multi-pattern Matching Algorithm Based on Eigenvalue and Realized by Hardware[J]. Computer Engineering and Applications,2005,41 (1):148-149.
[102]刘磊.多模式匹配算法的研究与优化[J].潍坊学院学报,2008.8(2)：37-38.
[103]辛阳,魏景芝,钮心忻,顾阳.用于入侵检测的块速多模式匹配算法[J].北京邮电大学学报.2008.31(3)：20-21.
[104]Cho YH, Mangione-Smith WH. Fast reconfiguring deep packet filter for 1+gigabit network[C]. In:Pocek KL, ed. Proc. Of the 13th Annual IEEE Symp. On Field-programmable Custom Computing Machines. Los Alamitos:IEEE Computer Society,2005:215-224.
[105]Cho YH, Mangione-Smith WH. A pattern matching coprocessor for network security[C]. In:Joyner WH, ed. Proc. Of the 42nd Annual Conf. on Design Automation. New York:ACM Press,2005.234-239.
[106]Dharmapurikar S, Krishnamurthy P, Spoull T, Lockwood J. Deep packet inspection using bloom filters[C]. In:Lockwood J, ed. Proc. Of the Hot Interconnects. Washington:IEEE Computer Society,2003:52-61.
[107]Dharmapurikar S, Lockwood J. Fash and scalable pattern matching for content filtering[C]. In:Berenbaum A, ed. Proc. Of the 2005 Symp. On Architecture for Networking and Communications Systems. New York:ACCM Press,2005:183-192.
[108]Gokhale m, et al, Granidt:Towards Gigabit Rate Network Intrusion Detection technology[C]. Proc. Of the 12th international Conference on Field Programmable Logic and Applications(FPL02),2002:404-413.
[109]Bu L and Chandy J, FPGA Based Network Intrusion Detection Using Content Addressable Memories[C]. Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM04),2004:301-306.
[110]Yu F, Katz RH, Lakshman TV. Gigabit rate packet pattern-matching using TCAM[C].In:Koenig H, ed. Proc. Of the 12th IEEE Int'1 Conf. on Network Protocols(ICNP 2004). Washington:IEEE Computer Society,2004:174-183.
[111]Zhu HS, Wang P, He XM, Li YJ, Wang W, Shi BL. Efficient episode mining with minimal and non-overlapping occvrrences[J]. IN:webb GI, Liv B, Zhang CQ,Gunopulos D,Wu XP, eds. Proc. of the loth Int'1 conf. On Data Mining, sydney:IEEE Computer society,2010.1211-1216. [cdoi:10.1109/ICOM. 2010.25].
[112]DOMINGOS P, HULTEN G. Mining high-speed data streams [C]. Proc of Conference on Knowledge Discovery and Data Mining. New York:ACM Press,2000:71-80.
[113]W Hoeffding. Probability inequalities for sums of bounded random variables[J]. American Statistical Association,1963,58:13-30.
[114]Maron, A Moore. Hoeffding races:Accelerating model selection search for classification and function approximation[J]. Advances in Neural Information Processing Systems.1993,6:59-66.
[115]JIN Ruo-ming, AGRAWAL G. Efficient decision tree construction on streaming data[C].Proc of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York:ACM Press,2003:571-576.
[116]Lee C H, Lin C R, Chen M S. Sliding-window f iltering:An efficient method for incremental mining on a time variant database[J]. Inform System,2005, 30(3):227-244.
[117]Zhu Y, Shasha D. StatStream:Statistical monitoring of thousands of data streams in real time[C].Proc of the 28th VLDB Conf. Hong Kong:VLDB Endowment,2002:358-369.
[118]刘学军,徐宏炳,董逸生,等.基于滑动窗口的数据流闭合频繁模式的挖掘[J].计算机研究与发展,2006,43(10)：1738一1743.
[119]Yishan, Jiao. Maintaining stream statistis over multiscale sliding windows[J]. ACM Transactions on Database Systems,2006,31(4):1305-1334.
[120]Haixun Wang, Wei Fan Philip S Yu, Jiawei Han. Mining concept- drifting data streams using ensemble classifiers[C]. In:Proc of the Int'1 Conf on Knowledge Discovery and Data Mining (SIGKDD03). New York:ACM Press,2003:226-235.
[121]Giannella C, Han J, Pei J, et al. Mining frequent patterns in data streams at multiple time granularities[C]. Proc of the NSF Workshop on Next Generation Data Mining,2004:191-212.
[122]WANG Hai-xun, FAN Wei.YU P, et al. Mining concept-drifting data streams using ensemble classifiers[C]. Proc of the 9th ACM SIGKDD International Conference on Knowledge discovery and Data Mining. New York:ACM Press,2003:226-235.
[123]Jensen C S, Lin D, Ooi B C, Query and Update Efficient B+TREE Based Indexing of Moving Objects[C]. In Proceedings of VLDB. Toronto, Canada:VLDB Endowment,2004.768-779.
[2]张锦春,鲁智勇,陈永光.C3I系统网络安全试验鉴定环境的设计及试验模式分析[J].电子对抗试验,2006,16(54)：39-42.
[3]王小非.C3I系统中的数据融合技术[M].哈尔滨工程大学出版社,2006.
[4]郑龙,刘敬军,罗鹏程等.C3I系统的网络可靠性综述[J].计算机技术与发展,2006,16(4)：11-13.
[5]夏学知,余幼平,樊兴.信息战条件下海军C3I系统安全性及对策分析[J].舰船电子工程,2004,24(21)：22-25.
[6]W. Stallings. Cryptography and Network Security:Principles and Practice[M]. PrenticeHall. Third edition.2003.
[7]NA W,WOU Bei. A thermal equivalent circuit for PEM fuel cell temperature control design[C]//Proc of International Symposium on Circuits and Systems.2008:2825-2828.
[8]冯登国.国内外密码学研究现状及发展趋势[J],通信学报,2002,23(5)：18-26.
[9]DeverSYS Corporation. Ultra High Speed AES(Rijndael)Crypto Processor [EB/OL]. http://deversys.com/?action=pproject&id=43,2008:12-10.
[10]赵险峰.一种保护芯片设计的多变量加密及其电路结构[J].电子学报.2009,37(6)：1300-1306.
[11]赵佳,韩军,曾晓洋等.AES算法的并发错误检测方法及其VLSI实现[J].计算机研究与发展.2009,46(4)：594-601.
[12]Liu Zhenhua, Hu Yupu, Zhang Xiangsong, et al. Provably Secure multi-proxy, signature scheme with revocation in the standard model [J]. Computer Comm-unications,2011,34(3):494-501.
[13]牟永敏,李美贵,梁琦.入侵检测系统中模式匹配算法的研究[J].电子学报,2006,34(12A)：2488-2490.
[14]卿斯汉,蒋建春,马恒太等.入侵检测技术研究综述[J].通信学报,2004,25(7)：20-29.
[15]Jung Won Kim. Integrating Artificial Immune Algorithms for Intrusion Detection[D]. PhD thesis, UK:Department of Computer Science, University of London,2002.
[16]杨晓辉,戴紫彬,张永福.可重构分组密码处理结构模型研究与设计[J].计算机研究与发展.2009,46(6)：962-967.
[17]G R Blakley. A Computer Algorithm for Calculationg the product AB modulo M[J]. IEEE Trans,1983:C-32(5):497-500.
[18]Koc C K, C Y Hung. Adaptive M-ary Segmentation and Canonical Recoding Algorithms for Multiplication of Large Binary Numbers[J]. Computers and Mathematics with Applications,1992,24(3):2-3.
[19]Montgomery P L. Modular Multiplication without Trial Division [J]. Mathematics of Computation.1985,44(170):519-521.
[20]Wang Yanbing, Ye Bing, Shun Dongyu. The design of the smart-cart coprocessor basing on improving Modular multiplication algorithm [J]. Microelectronic and computer.2004,21 (12):104-105.
[21]S E Eldrifge. C D Walter. Hardware implementation of Montgomery's modular multiplication algorithm[J]. IEEE Transaction on Computers,1993,42(6): 693-699.
[22]Buclunann J, Williams. H. C, Quadratic Fields and Cryptography [M]. Number Theory and ryptography, Loxton J, H ed. Cambridge University Press,1990: 10-25.
[23]Chacko, Mathew Vadakkan. Public Key Crypto-systems:History and Developments[C]. Columbia University, PhD thesis,1999:5-24.
[24]Dusse S R, Kaliski Jr B S. A Cryptographic library for the Motorola DSP56000[C]. Advances in Cryptology EUROCRYPT90,1990:230-244.
[25]Timoth J, Albert F, Schlegel, et al. IBM's S/390 micro- processor [J]. IEEE MICRO,1999,19 (2):12-23.
[26]Kessler R E. The alpha 21264 microprocessor [J]. IEEE MICRO,1999,19(2): 24-36.
[27]Nagendra C, Irwin M J, Owens R W. Area-time-power tradeoffs in parallel adders[J]. IEEE transactions on Circuits and Systems Ⅱ,1996,43(10): 689-702.
[28]Wang Chuachin, Huang Chenjung, Tai Kunchu. A 1.0-GHz 0.6um 8-bit carry lookahead adder using PLA-styled all-n-transister logic[J]. IEEE Transactions on Circuits and Systems,2000,47(2):133-135.
[29]Schulte M J, Chirca K, Glossner J, et al. A low-power carry skip adder with fast saturation [C].Proceedings of the 15th IEEE International Conference on Application-Specific Systems, Architectures and Processors. Los Alamios, CA, USA:IEEE,2004:269-279.
[30]Bedrij O J. Cary-select Adder [J]. IRE Trans Electron Comput,1962, EC-11: 340-346.
[31]Yen-Mou Huang, Kuo J B. A High-Speed Conditional Carry Select (CCS) Adder Circuit with a Successively Incremented Carry Number Block(SICNB) Structure for Low-Voltage VLSI Implementation[J]. Circuits and Systems II:Analog and Digital Signal Processing, IEEE Transactions on.2007, 47(10):1074-1079.
[32]李涛.基于免疫的网络监控模型[J].计算机学报,2006,29(9)：1515-1522.
[33]冉占军,姚全珠,王晓峰等.模式匹配算法在入侵检测中的应用[J].现代电子技术,2009,2：63-67.
[34]吴诚堃,殷健平,蔡志平等.网络入侵检测系统中基于多核平台的模式匹配技术研究.计算机工程与科技.2009,31(9)：1-4.
[35]辛阳,魏景芝,钮心忻等.用于入侵检测的快速多模式匹配算法[J].北京邮电大学学报,2008,31(3)：19-23.
[36]高朝勤,陈元琰,李梅.一种面向入侵检测的快速多模式匹配算法[J].计算机应用,2008,28(1)：82-84.
[37]WU Sun, MANBER U. A fast algorithm for Multi-pattern searching [J]. Tucson: Department of Computer Science, University of Arizona,1994:1-11.
[38]Xuan Y, Shin I, Thai MT, Znati T. Detecting application denial-of-service attacks:Agroup-testing-based approach. IEEE Trans[J]. on parallel and distrobited systerms.2010,21(8):1203-1216. [doi:10.1109/TPPS.20090147].
[39]Huang H, He QM, He JF, Ma LH. RADAR:Rare category detectiong via computation of boundary degree[J]. In:Huang JZ, Cal L, Srivastava J, eds. Advances in knowledge Discovery and Data Mining CPAKDD 2011, LNAI6635, Heidelberg: Springer-verlag,2011.258-269. [doi:10.1007/978-3-642-20847-8-22].
[40]张凤斌,杨永田.遗传算法在基于网络异常的入侵检测中的应用.电子学报[J],2004,32(5)：875-877.
[41]张凤斌,杨永田.基于人工免疫原理的入侵检测技术的研究[J].电机与控制学报.2004,8(2)：183-186.
[42]Yang Y, Lin X. A Re-examination of Text Categorization Methods [C].22nd Annual International ACM SIGIR Conference on Research and Development in the Information Retrieval.New York:ACM Press,1999:42-49.
[43]R.0. Duda & P. E. Hart. Pattern classification and scene analysis[M]. New York:Wiley,1973.
[44]QUINLAN J R. Induction on decision trees[J]. Machine Learning,1986, 13(1):81-106.
[45]QUINLAN J R. C4.5:programs for machine learning[M]. San Mateo:Morgan Kaufmann,1993.
[46]Agrawal R, Srikant R. Fast algorithms for mining association rules[C]. Proceedings of the 1994 Very Large Data Bases. Santiago de, Chile: Morgan Kanfmann,1994:487-499.
[47]侯俊杰,李春平.一种基于模式增长的频繁模式挖掘算法[J].华中科技大学学报(自然科学版),2005,33(10)：272-274.
[48]Babcock B, Babu S, Datar M, et al. Models and issues in data stream systems[C]. Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART- SIGART Symposium on Principles of Database Systems. Madison, USA:ACM Press,2002:1-16.
[49]Golab L, Ozsu M T. Issues in data stream management [J]. ACM SIGMOD Record, 2003,32 (2):5-14.
[50]QIN Shou-ke, QIAN Wei-ning, ZHOU Ao-ying. Approximately processing multi-granularity aggregate queries over a data Engineering. Washington DC:IEEE Computer Society,2006:468-472.
[51]0'Callaghan L, Mishra N. Meyerson A, et al. Streaming-data algorithms for high-quality clustering[C]. Proc of the 18th International Conference on Data Engineering. Washington USA:IEEE Computer Society,2002:685-700.
[52]Guha S, Meyerson A, Mishra N, et al. Clustering data streams:theory and practice[J]. IEEE Transactions on Knowledge and Data Engineering,2003, 15(3):515-528.
[53]张昕,李晓光,王大玲,等.数据流中一种快速启发式频繁模式挖掘方法[J].软件学报,2005,16(12)：2099-2105.
[54]孟小峰,周龙骧,王珊.数据库技术发展趋势[J].软件学报,2004,15(12)：1822-1836.
[55]陈宇峰,鲁东明等.面向大规模网络的聚集TCP流量模拟方法研究[J].通信学报,2006,27(2)：100-106.
[56]赵峰,李庆华,金莉.多维流序列并行算法研究[J].小型微型计算机系统,2007,28(2)：333-336.
[57]Chen Y, Dong G, Han Jia-wei, et al. Multi-dimensional regression analysis of time-series data streams[C]//Proc 2002 Int Conf Very Large Data Bases(VLDB'02),2002:323-334.
[58]Aggarwal C C A framework for projected clustering of high dimensional data streams[C]. Proc of the 30th VLDB Conf. Toronto Canada:VLDB Endowment, 2004:852-863.
[59]Fraleigh, Moon, Lyles, Cotton et al. Packet-Level Traffic Measur-ements from the Sprint IP Backbone, IEEE Network, November/Decem-ber 2003,17 (6).
[60]Diff ie W, Hellman M.E. New direction in cryptography [C]. IEEE Trans, on Information Theory, Vol. IT-22, No.6,1976:644-654.
[61]Rivest R L, Shamir A, Adleman L M. A method for obtaining digital signature and public key cryptosystems[J]. Communications of the ACM.1978.21 (2): 120-126.
[62]Diffie W, Hellman M E. New directions in cryptography[J]. IEEE Transction on Information Theory.1976. IT-22(6):644-654.
[63]ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms[J]. IEEE Transction on Information Theory.1985. IT-31(4):469-472.
[64]S. Jha, K. Tan, R. A. Maxion. Markov Chains, Classifiers, and Intrusion Detection[C].14th IEEE Computer Security Foundations Workshop(CSFW' 01).2001:0206-0219.
[65]C. Sinclair, L. Pierce and S. Matzner. An Application of Machine Learning to Network Intrusion Detection[C].15th Annual Computer Security Applications Conference. Arizona,1999:371-377.
[66]蔡忠闽,管晓宏,邵萍等.基于粗糙集理论的入侵检测新方法[J].计算机学报,2003,26(3)：361-366.
[67]Zhang Lian-hua, Zhang Guan-hua, YU Lang, et al. Intrusion Detection Using Rough Set Classification[J]. Joursnal of Zhejiang university SCIENCE, 2004,5(9):1076-1086.
[68]凌军,曹阳,尹健华等.基于时态知识模型的网络入侵检测方法研究[J].计算机学报,2003,26(11)：1591-1597.
[69]陶新民,陈万海,郭黎利.一种新的机遇模糊聚类和免疫原理的入侵检测模型[J].电子学报,2006,34(7)：1329-1332.
[70]SMITH R, GOYAL N, ORMONT J, et al. Evaluating GPUs for network packet signature matching[C]//Proc of International Symposium on Performance Analysis of Systems and Software.2009.
[71]SMITH R,ESTAN C, JHA S. XFA:fast signature matching with extended automata[C]//Proc of Symposium on Security and Privacy. Los Alamitos:IEEE Computer Society,2008" 187-201.
[72]VASILIADIS G, ANTONATOS S, POLYCHRONAKIS M, et al. Gnort:high performance network intrusion detection using graphics processor[C]//Proc of the 11th International Symposium on Recent Advances in Intrusion Detection. Berlin, Heidelberg:Springer- Verlag,2008:116-134.
[73]WU Chen-kun, YIN Jian-ping, CAI Zhi-ping, et al. A hybrid parallel signature matching model for network security applications using SIMD GPU[C]//Proc of the 8th International Symposium on Advanced Parrallel Processing Technologies.Berlin, Heidelberg:Springer-Verlag,2009:191-204.
[74]Hutchings B L, Franklin R, Carver D. Assisting network intrusion detection with re-configurable hardware[A]. Proceeding of the 10th IEEE FCCMO2. 2002:111-119.
[75]孙志刚,张子文.正则表达式匹配的高效硬件实现[J].计算机工程与科学,2009,31(10)：5-8.
[76]Lyu S, Farid H. Steganalysis using color wavelet statistics and one-class support vector machines [C] SPIE S YMPOSIUM ON ELECTRONIC Imaging, San Jose, CA,2004:2-5.
[77]Walter C D. Systolic modular multiplieation[J]. IEEE Transa- ctions on computer,1992:376-380.
[78]Koc C K. High-speed RSA implementation[R]. RSA Labs technical Report-201, 1994:115-116.
[79]刘强,佟冬,程旭.部分并行的蒙哥马利模乘法器实现研究[J].电子学报,2006,34(8)：1537-1541.
[80]蒋晓娜,段成华.运算精简的蒙哥马利算法模乘器设计[J].计算机仿真,2008,25(5)：101-104.
[81]詹文法,马俊,谢莹等.多位快速加法器的设计[J].合肥工业大学学报(自然科学版),2005,28(10)：1281-1283.
[82]崔晓平,王成华.二级进位跳跃加法器的优化方块分配[J].南京航空航天大学学报.2007,33(4)：495-499.
[83]Daly A, Marnane W. Efficient architectures for implementing Montgomery modular multiplication and RSA modular exponent- iation on recomfigurable logic [A]. Proceedings of the Tenth ACM International Symposium on Field-Programmable Gate Arrays (FPGA 02)[c]. New York ACM Press, 2002:44-49.
[84]Mcivor C, Mcloone M, Mccanny J V, et al. Fast Montgomery modular multiplication and RSA cryptographic processor architectures [A]. Proceedings of the IEEEE 37th Asilomar Conference on Signals, Systems, and Computers[C]. New York:IEEE Press,2003.1:379-384.
[85]Cilardo A, Mazzeo A, Romano L, Saggese G P. Cary save Montgomery moduar exponentiation on reconfigurable hardware[A]. Proceed-ings of IEEE Design, Automation and Test in Europe Conference and Exhibition (DATA04)[C]. New York:IEEE Press,2004,3:206-211.
[86]k. Sakiyama, B. Preneel and I. Verbauwhede. A fast dual-field modular arithmetic logic unit and its hardware implementation [A]. Proceedings of IEEE international Symposium on Circuits and Systems (ISCAS 2006). 2006:787-790.
[87]Osama Al-Khaleel, Chris Papachristou, Kiamal Pekmestzi. FPGA- based Design of a Large Moduli Multiplier for Public-Key Cryptographic Systems[C]. Processing of 24th International Conference on Computer Design (ICCD 2006), San Jose, CA, USA 2006:314-320.
[88]Junfeng Fan, Kazuo Sakiyama, and Ingrid Verbauwhede. Montgomery Modular Multiplication Algorithm on Multi-core [C]. in Proc, IEEE Workshop on Signal Processing Systems:Design and Implemen- tation,2007:261-266.
[89]R. V. Kamala, M. B. Srimivas. High-Throughput Moontgomery Modular Multiplication[C]. Proceedings of 2006 IFIP International Conference on Very Large Scale Integration. Hyderabad 2006:58-62.
[90]MANZOUL M A. Parallel CLA algorithm for fast addition [A]. Proc Intl Par Comput EE Conf [C].2000:55-58.
[91]Pai Yu-ting, Chen Yu-kumg. The fastest carry lookahead dder [A]. Proceedings of the Second IEEE International Workshop on Electronic Design, Test and Applications [C]. Los Alamitos, CA, USA:IEEE,2004:434-436
[92]Cui Xiaoping, Wang Chenghua. Fast Carry-skip Adder Based on Block Carry-Lookahead[J]. Journal of Nanjing University of Aeronautics & Astronautics 2006,38(6):789-792.
[93]王永成,沈州,许一震.改进的多模式匹配算法[J].计算机研究与发展,2002,39(1)：55-60.
[94]Tuck N, Sherwood T, Calder B, Varghese G. Deterministic memory efficient string matching algorithms for intrusion detection[C]. In:LiVOK, ed. Proc. of the IEEE Infocom 2004. Piscataway:IEEE,2004:333-340.
[95]陈瑜,陈国龙.Wu-Manber算法性能分析及其改进[J].计算机科学,2006,33(6)：203-209.
[96]杨东红,徐恪.改进的Wu-Manber多模式匹配算法[J].清华大学学报：自然科学版,2006,46(4)：555-558.
[97]孙晓山,王强.一种改进的Wu-Manber多模式匹配算法以应用[J].中文信息学报,2006,20(2)：47-52.
[98]袁世忠,曹曼.基于WM算法的多模式匹配改进算法WMN[J].计算机工程与应用,2007,43(15)：128-130.
[99]马伟华,刘玉梅.一种改进的Wu-Manber多模式串匹配算法[J].应用科技,2007,34(10)：32-34.
[100]张国军,林南晖.一种快速且节约存储器的多模式匹配算法[J].小型微型计算机系统,2009,30(8)：1511-1527.
[101]Peng Shili, Tan Hansong. Multi-pattern Matching Algorithm Based on Eigenvalue and Realized by Hardware[J]. Computer Engineering and Applications,2005,41 (1):148-149.
[102]刘磊.多模式匹配算法的研究与优化[J].潍坊学院学报,2008.8(2)：37-38.
[103]辛阳,魏景芝,钮心忻,顾阳.用于入侵检测的块速多模式匹配算法[J].北京邮电大学学报.2008.31(3)：20-21.
[104]Cho YH, Mangione-Smith WH. Fast reconfiguring deep packet filter for 1+gigabit network[C]. In:Pocek KL, ed. Proc. Of the 13th Annual IEEE Symp. On Field-programmable Custom Computing Machines. Los Alamitos:IEEE Computer Society,2005:215-224.
[105]Cho YH, Mangione-Smith WH. A pattern matching coprocessor for network security[C]. In:Joyner WH, ed. Proc. Of the 42nd Annual Conf. on Design Automation. New York:ACM Press,2005.234-239.
[106]Dharmapurikar S, Krishnamurthy P, Spoull T, Lockwood J. Deep packet inspection using bloom filters[C]. In:Lockwood J, ed. Proc. Of the Hot Interconnects. Washington:IEEE Computer Society,2003:52-61.
[107]Dharmapurikar S, Lockwood J. Fash and scalable pattern matching for content filtering[C]. In:Berenbaum A, ed. Proc. Of the 2005 Symp. On Architecture for Networking and Communications Systems. New York:ACCM Press,2005:183-192.
[108]Gokhale m, et al, Granidt:Towards Gigabit Rate Network Intrusion Detection technology[C]. Proc. Of the 12th international Conference on Field Programmable Logic and Applications(FPL02),2002:404-413.
[109]Bu L and Chandy J, FPGA Based Network Intrusion Detection Using Content Addressable Memories[C]. Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM04),2004:301-306.
[110]Yu F, Katz RH, Lakshman TV. Gigabit rate packet pattern-matching using TCAM[C].In:Koenig H, ed. Proc. Of the 12th IEEE Int'1 Conf. on Network Protocols(ICNP 2004). Washington:IEEE Computer Society,2004:174-183.
[111]Zhu HS, Wang P, He XM, Li YJ, Wang W, Shi BL. Efficient episode mining with minimal and non-overlapping occvrrences[J]. IN:webb GI, Liv B, Zhang CQ,Gunopulos D,Wu XP, eds. Proc. of the loth Int'1 conf. On Data Mining, sydney:IEEE Computer society,2010.1211-1216. [cdoi:10.1109/ICOM. 2010.25].
[112]DOMINGOS P, HULTEN G. Mining high-speed data streams [C]. Proc of Conference on Knowledge Discovery and Data Mining. New York:ACM Press,2000:71-80.
[113]W Hoeffding. Probability inequalities for sums of bounded random variables[J]. American Statistical Association,1963,58:13-30.
[114]Maron, A Moore. Hoeffding races:Accelerating model selection search for classification and function approximation[J]. Advances in Neural Information Processing Systems.1993,6:59-66.
[115]JIN Ruo-ming, AGRAWAL G. Efficient decision tree construction on streaming data[C].Proc of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York:ACM Press,2003:571-576.
[116]Lee C H, Lin C R, Chen M S. Sliding-window f iltering:An efficient method for incremental mining on a time variant database[J]. Inform System,2005, 30(3):227-244.
[117]Zhu Y, Shasha D. StatStream:Statistical monitoring of thousands of data streams in real time[C].Proc of the 28th VLDB Conf. Hong Kong:VLDB Endowment,2002:358-369.
[118]刘学军,徐宏炳,董逸生,等.基于滑动窗口的数据流闭合频繁模式的挖掘[J].计算机研究与发展,2006,43(10)：1738一1743.
[119]Yishan, Jiao. Maintaining stream statistis over multiscale sliding windows[J]. ACM Transactions on Database Systems,2006,31(4):1305-1334.
[120]Haixun Wang, Wei Fan Philip S Yu, Jiawei Han. Mining concept- drifting data streams using ensemble classifiers[C]. In:Proc of the Int'1 Conf on Knowledge Discovery and Data Mining (SIGKDD03). New York:ACM Press,2003:226-235.
[121]Giannella C, Han J, Pei J, et al. Mining frequent patterns in data streams at multiple time granularities[C]. Proc of the NSF Workshop on Next Generation Data Mining,2004:191-212.
[122]WANG Hai-xun, FAN Wei.YU P, et al. Mining concept-drifting data streams using ensemble classifiers[C]. Proc of the 9th ACM SIGKDD International Conference on Knowledge discovery and Data Mining. New York:ACM Press,2003:226-235.
[123]Jensen C S, Lin D, Ooi B C, Query and Update Efficient B+TREE Based Indexing of Moving Objects[C]. In Proceedings of VLDB. Toronto, Canada:VLDB Endowment,2004.768-779.