TY - JFULL AU - Hyungkeun Jee and Jooyoung Lee and Dowon Hong PY - 2007/9/ TI - High Speed Bitwise Search for Digital Forensic System T2 - International Journal of Electrical and Computer Engineering SP - 1129 EP - 1133 VL - 1 SN - 1307-6892 UR - https://publications.waset.org/pdf/14551 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 8, 2007 N2 - The most common forensic activity is searching a hard disk for string of data. Nowadays, investigators and analysts are increasingly experiencing large, even terabyte sized data sets when conducting digital investigations. Therefore consecutive searching can take weeks to complete successfully. There are two primary search methods: index-based search and bitwise search. Index-based searching is very fast after the initial indexing but initial indexing takes a long time. In this paper, we discuss a high speed bitwise search model for large-scale digital forensic investigations. We used pattern matching board, which is generally used for network security, to search for string and complex regular expressions. Our results indicate that in many cases, the use of pattern matching board can substantially increase the performance of digital forensic search tools. ER -