By Topic

Protecting Smart-Grid with Breno-Silva fast single pattern match algorithm for small patterns

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Silva Pinto, B. ; Open Inf. Security Found. (OISF), Brasilia, Brazil ; Chun Che Fung

Security of future Electrical power supply and the Smart-Grid will rely on the integrity of the communication network and in particular the Internet. Intrusion Prevention System (IPS) is crucial to guard against malicious and intentional attacks. Network packet search and string processing tasks in high-speed networks are critical for secure IPS performance. Slower algorithms could mean a portion of the packets could have been bypassed and slip through the protective border, which leads to security vulnerability. A novel pattern matching algorithm is proposed in this paper and the new algorithm has worst, best, and average time complexities of O(n + 2m), O(2m), and O(n + m) respectively - when applied for large alphabets - while searching a m bytes pattern on a text of n bytes. Experiments on 256-bytes alphabet |Σ| text files have been conducted to compare the performance of the new algorithm with other alternatives. In all tests, the proposed algorithm has demonstrated an improved performance of at least 50% better on the mentioned alphabet size.

Published in:

Machine Learning and Cybernetics (ICMLC), 2010 International Conference on  (Volume:6 )

Date of Conference:

11-14 July 2010