A Comparative Study on Signature Based Ids Using Pattern Matching Algorithm
DOI:
https://doi.org/10.26438/ijcse/v6i9.646649Keywords:
Signature based ids, Pattern matching algorithm, String matching algorithm, finite state automationAbstract
Innovation and imagination in string coordinating can play a massive part to get time effective execution in different areas of software engineering. String coordinating calculations are fundamental for arrange gadgets that channel parcels and streams in light of their payload. Applications like interruption discovery/aversion, web sifting, hostile to infection, and against spam all raise the interest for productive calculations managing string coordinating There is expanding sorts and quantities of malevolent assaults that endeavours to bargain the trustworthiness, privacy, accessibility, and other security parts of PCs and systems.
References
[1] A Fast String Searching Algorithm, with R.S. Boyer. Communications of the Association for Computing Machinery, 20(10), 1977, pp. 762-772
[2] Akhtar Rasool Amrita Tiwari et al, String Matching Methodologies: A Comparative Analysis / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (2) , 2012,3394 - 3397 Proceedings of the 6th Colloquium on Automata, Languages and Programming, pages 118–132, London, UK, 1979 Springer.
[3] An Examination of Pattern Matching Algorithms for Intrusion Detection Systems submitted by James Kelly Dr. Frank Dehne (Director, School of Computer Science) Dr. Paul Van Oorschot (Thesis Supervisor) Carleton University, August 2006. Pages 21-39.
[4] https://brilliant.org/wiki/rabin-karp algorithm/#implementation-of-rabin- karp.
[5] https://www.geeksforgeeks.org/wildcard-pattern-matching/
[6] http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm.
[7] In 2007, Matyas Sustik and I thought of an apparently new variation that gives very good performance on small alphabets and has a small table. The algorithm is described in UTCS Tech Report TR-07-62, ``String Searching over Small Alphabets.``
[8] International Journal of Innovative Research in Computer Science and Engineering (IJIRCSE) www.ioirp.com ISSN: 2394-6364, Volume – 3, Issue – 1. March 2018 a survey on intrusion detection system using anamoly and signature based detectors submitted by Dr.K.Prabha, S.Mohanapriya, and K.Nirmaladevi.
[9] Network intrusion detection system using string matching algorithms submitted by Siddharth Saha and Telugu Praveen Kumar Department of Computer Science & Engineering National Institute of Technology Rourkela 2010. Pages 17-25
[10] Rolling Hash. Retrieved May 28, 2016, fromhttps://en.wikipedia.org/wiki/Rolling_hash.B. Commentz-Walter. A string matching algorithm fast on the average. Technical Report 79.09.007, IBM Heidelberg Scientific Center, 1979.
[11] S. Wu and U. Manber, A fast algorithm for multi-pattern searching, Technical Report TR-94-17, Department of Computer Science, University of Arizona, 1994.
[12] String searching algorithm from Wikipedia :https://en.wikipedia.org/wiki/Stringsearching_algorithm#Algorithms_using_a_finite_set_of_patterns
[13] YU Jianming, XUE Yibo, LI Jun, Memory Efficient String Matching Algorithm for Network Intrusion Management System, Tsinghua Science and Technology.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Mohanapriya S, Prabha K
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
