Skip to Main content Skip to Navigation
Conference papers

Reducing the Time Required for Hashing Operations

Abstract : Due to the increasingly massive amounts of data that need to be analyzed in digital forensic investigations, it is necessary to automatically recognize suspect files and filter out non-relevant files. To achieve this goal, digital forensic practitioners employ hashing algorithms to classify files into known-good, known-bad and unknown files. However, a typical personal computer may store hundreds of thousands of files and the task becomes extremely time-consuming. This paper attempts to address the problem using a framework that speeds up processing by using multiple threads. Unlike a typical multithreading approach, where the hashing algorithm is performed by multiple threads, the proposed framework incorporates a dedicated prefetcher thread that reads files from a device. Experimental results demonstrate a runtime efficiency of nearly 40% over single threading.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01460624
Contributor : Hal Ifip <>
Submitted on : Tuesday, February 7, 2017 - 5:26:31 PM
Last modification on : Thursday, March 5, 2020 - 4:46:40 PM
Document(s) archivé(s) le : Monday, May 8, 2017 - 3:03:13 PM

File

978-3-642-41148-9_7_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Frank Breitinger, Kaloyan Petrov. Reducing the Time Required for Hashing Operations. 9th International Conference on Digital Forensics (DF), Jan 2013, Orlando, FL, United States. pp.101-117, ⟨10.1007/978-3-642-41148-9_7⟩. ⟨hal-01460624⟩

Share

Metrics

Record views

225

Files downloads

508