检索结果-内蒙古大学图书馆

11th International ISC Conference on Information Security and Cryptology (ISCISC)

作者： Hajiabadi, Mohammad Hossein Saidi, Hossein Behdadfar, Mohammad Isfahan Univ Technol Dept Elect & Comp Engn Esfahan Iran IRIB Univ Engn Dept Tehran Iran

ISBN: (纸本)9781479953837

string matching is the primary function of signature based intrusion detection systems. In this paper, a novel string matching algorithm is proposed based on the idea of searching words in a dictionary. We have also presented a scalable, high throughput, memory efficient and modular architecture for large scale string matching based on the proposed algorithm. The words of dictionary have been extracted from malicious patterns of Snort NIDS (2013) database. The memory efficiency of the proposed algorithms is directly proportional to the dissimilarity of patterns. In a large dictionary, it is feasible to create several groups in such a way that the members of each group satisfy a desired condition. The presented architecture is designed for implementation on the Field Programmable Gate Array and profits from the pipeline, modular structure and suitable utilization of distributed memory resources. Due to the routing limitation of FPGAs, the maximum length of patterns has been limited and a further solution suggested for tackling this obstacle. The post place & route implementation results of a set of 11895 patterns (117832 Byte) with lengths within the range from 2 to 20 characters show an efficiency of 1.47 Byte/Char or 0.28 (6-input LUT/char) and a maximum throughput of 2.38Gbps. Other results for a set of 3471 patterns (104399 Byte) with lengths within 21 and 40 characters show an efficiency of 1.87Byte/Char or 0.42 (6-input LUT/char) and the maximum throughput of 1.97Gbps. Adding new string to dictionary is feasible by placing extra modules in architecture.

关键词： string matching intrusion detection system Field programmble gate array FPGA hardware based string matching algorithm

来源：评论

学校读者我要写书评

暂无评论

MDH: A high speed Multi-phase Dynamic Hash string matching algorithm for large-scale pattern set

MDH: A high speed Multi-phase Dynamic Hash string matching a...

引用

9th International Conference on Information and Communications Security

作者： Zhou, Zongwei Xue, Yibo Liu, Junda Zhang, Wei Li, Jun Tsinghua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China Tsinghua Univ Res Inst Informat Technol Beijing 100084 Peoples R China Tsing Hua Nat Lab Informat Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9783540770473

string matching algorithm is one of the key technologies in numerous network security applications and systems. Nowadays, the increasing network bandwidth and pattern set size both calls for high speed string matching algorithm for large-scale pattern set. This paper proposes a novel algorithm called Multi-phase Dynamic Hash (MDH), which cut down the memory requirement by multi-phase hash and explore valuable pattern set information to speed up searching procedure by dynamic-cut heuristics. The experimental results demonstrate that MDH can improve matching performance by 100% to 300% comparing with other popular algorithms, whereas the memory requirement stays in a comparatively low level.

关键词： network security string matching algorithm multi-phases hash dynamic-cut heuristics

来源：评论

学校读者我要写书评

暂无评论

PAC-k: A Parallel Aho-Corasick string matching Approach on Graphic Processing Units Using Non-Overlapped Threads

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2016年第7期E99B卷 1523-1531页

作者： Ho, ThienLuan Oh, Seung-Rohk Kim, HyunJin Dankook Univ Sch Elect & Elect Engn Signal & Syst Lab Yongin South Korea Dankook Univ Sch Elect & Elect Engn Yongin South Korea

A parallel Aho-Corasick (AC) approach, named PAC-k, is proposed for string matching in deep packet inspection (DPI). The proposed approach adopts graphic processing units (GPUs) to perform the string matching in parallel for high throughput. In parallel string matching, the boundary detection problem happens when a pattern is matched across chunks. The PAC-k approach solves the boundary detection problem because the number of characters to be scanned by a thread can reach the longest pattern length. An input string is divided into multiple sub-chunks with k characters. By adopting the new starting position in each sub-chunk for the failure transition, the required number of threads is reduced by a factor of k. Therefore, the overhead of terminating and reassigning threads is also decreased. In order to avoid the unnecessary overlapped scanning with multiple threads, a checking procedure is proposed that decides whether a new starting position is in the sub-chunk. In the experiments with target patterns from Snort and realistic input strings from DEFCON, throughputs are enhanced greatly compared to those of previous AC-based string matching approaches.

关键词： Aho-Corasick algorithm deep packet inspection DEFCON deterministic finite automaton finite state machine graphic processing units Snort string matching algorithm

来源：评论

学校读者我要写书评

暂无评论

Using Different Substitution Matrices in a string-matching Technique for Identifying Viral Polymorphic Malware Variants

Using Different Substitution Matrices in a String-Matching T...

引用

IEEE Congress on Evolutionary Computation (CEC) held as part of IEEE World Congress on Computational Intelligence (IEEE WCCI)

作者： Naidu, Vijay Narayanan, Ajit Auckland Univ Technol Sch Comp & Math Sci Auckland New Zealand

ISBN: (纸本)9781509006229

Antivirus systems have difficulty in detecting polymorphic variants of known viruses without explicit signatures for such variants. Initial work on investigating efficient and effective string-based approaches for the automatic generation of signatures for the identification of some or all new polymorphic variants, was initially encouraging. That initial work was restricted by a number of experimental aspects. The aim of the research reported here is to examine the effects of using different substitution matrices in a string-based methods for the automatic generation of signatures for the detection of some or all new polymorphic variants. We establish how our proposed syntactic-based method using the well-known string matching Smith-Waterman algorithm can successfully identify the known polymorphic variants of *** virus. Our string-matching technique may metamorphose our understanding of polymorphic variant generation and may lead to a new phase of syntactic-based anti-viral software.

关键词： string matching algorithm Smith-Waterman algorithm JS.Cassandra virus local pairwise sequence alignment substitution matrix multiple sequence alignment data mining algorithm automatic signature generation

来源：评论

学校读者我要写书评

暂无评论

SSSM-Semantic set and string matching based malware detection

SSSM-Semantic set and string matching based malware detectio...

引用

7th IEEE Symposium on Computational Intelligence for Security and Defense Applications (IEEE-CISDA)

作者： Nguyen Van Nhuong Vo Thi Yen Nhi Nguyen Tan Cam Mai Xuan Phu Cao Dang Tan Ho Chi Minh City Univ Sci Dept Informat Technol Ho Chi Minh City Vietnam Hoa Sen Univ Dept Informat Technol Ho Chi Minh City Vietnam

ISBN: (纸本)9781479954315

Malware is a program used to disrupt computer operation or to gather the sensitive information or to gain access to private computer system. Malware detection methods can only work well on some specific types of malware. For example, API/function based methods can detect malware quickly, but are unable to identify advanced transformable malwares or unknown malwares. To deal with these malwares, researchers proposed data mining methods which can recognize various types of malware. However, these method not only requires more overhead for training and detecting process but also is still ineffective to identify metamorphic malwares. A semantic set, a set of changed values of registers and variables allocated in memory when a program is executed, supports detecting most of malware variants even when they use complicated transformation techniques such as metamorphic malwares. Nevertheless, this approach requires that malware files must be disassembled. Based on analyzed results of these methods, we concluded that these methods can be combined together to create a powerful malware detection system because each method's advantages can cover the others' disadvantages. Namely, each of method is able to perform effectively in the specific range of malwares, so this combined system can detect all types of malware while separately each method could not. In this paper, we proposed an SSSM system (semantic set and string matching detection) which combined three methods: API/function signature based method, data mining method and semantic set method. SSSM system has been experimented on different datasets and achieved the accuracy up to 99.07% and detection rate nearly 100%.

关键词： API/function data mining x86 register value string matching algorithm semantic set malware obfuscation techniques malware detection

来源：评论

学校读者我要写书评

暂无评论

FAULT-TOLERANT NETWORKS BASED ON THE DE BRUIJN GRAPH

引用

IEEE TRANSACTIONS ON COMPUTERS 1991年第10期40卷 1167-1174页

作者： SRIDHAR, MA RAGHAVENDRA, CS UNIV SO CALIF DEPT ELECT ENGN SYSTLOS ANGELESCA 90089

We introduce a new class of networks based on the de Bruijn graph. These directed graphs are regular of degree k, have N = k(n) vertices for some n, and can tolerate up to k - 2 node faults. Their fault-free diameter is n = log(k)N, and this increases by at most 1 hop in the presence of k - 2 faults. This class is very rich: for any given N = k(n), we can construct at least 2N different such graphs. This is in sharp contrast to most other such constructions (including the de Bruijn graph), in which only one graph exists for each N. We also show how to implement certain algorithms on these networks. First, we exhibit an optimal algorithm for performing fault-tolerant routing in these networks. Given a source vertex S, a destination vertex D, and a set F of faulty vertices, our algorithm executes in time O(n\F\), and this is asymptotically optimal. It is interesting that this time bound is independent of the value of k. The techniques that we employ draw from the known theory of string overlaps, and are therefore likely to be applicable to other similar problems. We also show how to compute strongly-connected components on these networks in the presence of arbitrarily many faults;this uses some constructions from the theory of finite-state automata. Finally, we show how to handle time-varying faults. These algorithms run in time polynomial in n = log(k)N and the number of faults.

关键词： DE BRUIJN GRAPH NETWORK TOPOLOGY DESIGN ROUTING algorithmS string matching algorithm

来源：评论

学校读者我要写书评

暂无评论

Generalized pattern matching and periodicity under substring consistent equivalence relations

引用

THEORETICAL COMPUTER SCIENCE 2016年第PartB期656卷 225-233页

作者： Matsuoka, Yoshiaki Aoki, Takahiro Inenaga, Shunsuke Bannai, Hideo Takeda, Masayuki Kyushu Univ Dept Informat Fukuoka Japan Kyushu Univ Dept Elect Engn & Comp Sci Fukuoka Japan

Let approximate to be a substring consistent equivalence relation (SCER) on strings such that for any two strings x, y, x approximate to y implies that (1) vertical bar x vertical bar = vertical bar y vertical bar and (2) x[i..j] approximate to y[i..j] for all 0 <= i <= j < vertical bar x vertical bar. Examples of SCER are parameterized pattern matching and order-preserving pattern matching. We present a generalized and efficient algorithm for pattern matching with SCER approximate to. Also, we show analogues of Fine and Wilt's periodicity lemma hold for SCER. (C) 2016 Elsevier B.V. All rights reserved.

关键词： string matching algorithm Generalized periodicity lemma Order-preserving pattern matching Parameterized pattern matching

来源：评论

学校读者我要写书评

暂无评论

Waiting time and complexity for matching patterns with automata

引用

INFORMATION PROCESSING LETTERS 2003年第3期87卷 119-125页

作者： Crochemore, M Stefanov, VT Univ Marne la Vallee Inst Gaspard Monge F-77454 Marne La Vallee 2 France Kings Coll London London WC2R 2LS England Univ Western Australia Sch Math & Stat Perth WA 6009 Australia

The paper shows how to compute exactly expectations, standard deviations, and cumulative probabilities of the searching times of string-matching algorithms based on the use of automata. This is derived from a methodology based on viewing the underlying Markov chains as exponential families and applying recent results on them. (C) 2003 Elsevier B.V. All rights reserved.

关键词： string matching algorithm Markov chain stopping time algorithms formal languages

来源：评论

学校读者我要写书评

暂无评论

Real-time Context-aware Network Security Policy Enforcement System (RC-NSPES)

Real-time Context-aware Network Security Policy Enforcement ...

引用

5th International Conference on Networking and Services (ICNS)

作者： Badii, A. Carter, A. Handzlik, A. Bojanic, S. Englert, T. Patel, D. Pejovic, V. Chorazyczewski, A. Hameed, K. Bankovic, Z. Univ Reading Reading RG6 2AH Berks England Netexpose Creteil France Microtech Int Ltd Wroclaw Poland Univ Politecn Madrid Madrid Spain

ISBN: (纸本)9781424436880

The major technical objectives of the RC-NSPES are to provide a framework for the concurrent operation of reactive and pro-active security functions to deliver efficient and optimised intrusion detection schemes as well as enhanced and highly correlated rule sets for more effective alerts management and root-cause analysis. The design and implementation of the RC-NSPES solution includes a number of innovative features in terms of real-time programmable embedded hardware (FPGA) deployment as well as in the integrated management station. These have been devised so as to deliver enhanced detection of attacks and contextualised alerts against threats that can arise from both the network layer and the application layer protocols. The resulting architecture represents an efficient and effective framework for the future deployment of network security systems.

关键词： Network Security Policy Enforcement Intrusion detection system FPGA contextualised alerts communication protocols (generic) security rules rules language string matching algorithm network management station machine learning algorithm RC-NSPES real-time IDS

来源：评论

学校读者我要写书评

暂无评论

Evolving the Efficiency of Searching Technique Using Map-Reduce Hashing Technique 1st

Evolving the Efficiency of Searching Technique Using Map-Red...

引用

1st International Conference on Smart Computing and Informatics (SCI)

作者： Pandey, Shivendra Kumar Tripathi, Priyanka Natl Inst Tech Teachers Training & Res Bhopal Madhya Pradesh India

ISBN: (纸本)9789811055447;9789811055430

Nowadays as data volume is increasing, it is becoming difficult to access the data within span of time. So, our aim is to process required data as fast as possible. Though we have variety of algorithms but none of them are specially designed to manage the large data (e.g. peta byte size of data). In this research paper, authors have proposed an algorithm based on hashing technique which uses Hadoop framework to reduce search time.

关键词： string matching algorithm Hashing Hadoop clustering Map-reduce programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：