Optimized Aho-Corasick String Matching Algorithm for Smart Phones

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review

2 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publication2016 IEEE Conference on Communications and Network Security (CNS) 2016
Subtitle of host publicationIEEE CNS 2016 - Posters
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages342-343
ISBN (Print)9781509030651
Publication statusPublished - Oct 2016

Conference

Title2016 IEEE Conference on Communications and Network Security (CNS 2016)
PlaceUnited States
CityPhiladelphia
Period17 - 19 October 2016

Abstract

String matching is a core component of signature-based malware detection. Unlike personal computers, smart phones have limited memory resources. In this poster, we shall present an optimized version of the Aho-Corasick (AC) string matching algorithm for smart phones. The basic AC algorithm consisting of the GOTO and failure functions is very memory efficient, but its processing speed is slow. On the other hand, the version with fully expanded transition rule table is much faster but it requires huge amount of memory space. The proposed optimized AC algorithm has outstanding performances in both space and time. The memory cost of the proposed algorithm is close to the basic AC algorithm, and the processing speed can be faster than the fully expanded version when executed on smart phones.

Research Area(s)

  • malware detection, mobile devices, string matching, transition rule table compression

Citation Format(s)

Optimized Aho-Corasick String Matching Algorithm for Smart Phones. / Lu, Rui; Pao, Derek.

2016 IEEE Conference on Communications and Network Security (CNS) 2016: IEEE CNS 2016 - Posters. Institute of Electrical and Electronics Engineers Inc., 2016. p. 342-343 7860502.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)peer-review