Reducing the Time Required for Hashing Operations - Advances in Digital Forensics IX Access content directly
Conference Papers Year : 2013

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.
Fichier principal
Vignette du fichier
978-3-642-41148-9_7_Chapter.pdf (1.41 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01460624 , version 1 (07-02-2017)

Licence

Attribution

Identifiers

Cite

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⟩
122 View
511 Download

Altmetric

Share

Gmail Facebook X LinkedIn More