HomeResearchPublications

Reducing the Time Required for Hashing Operations

back to overview

Reference

Breitinger, F., & Petrov, K. (2013). Reducing the Time Required for Hashing Operations. Paper presented at the Advances in Information and Communication Technolgy.

Publication type

Paper in Conference Proceedings

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.

Persons

Organizational Units

  • Institute of Information Systems
  • Hilti Chair for Data and Application Security

Original Source URL

Link

DOI

http://dx.doi.org/doi:10.1007/978-3-642-41148-9_7