EFFICIENT N-BYTE SLACK SPACE HASHING IN RETRIEVING AND IDENTIFYING PARTIALLY RECOVERED DATA

Ireneusz Jozwiak, Michal Kedziora

2011

Abstract

This paper describes modification of slack space block hashing algorithm which improves performance in the handling with process of identification of recovered data. In our research we relied on hash block algorithm and present improvements which allow increase efficiency by analyzing time reduction. N-Byte Slack Space Hashing is especially useful in data recovery process where due to a file system limitations, it is possible to recover only fragments of data which was erased and partially overwritten. The Algorithm is faster than block hashing and allows to identify partially erased files using modified hash sets.

Paper Citation

in Harvard Style

Jozwiak I. and Kedziora M. (2011). EFFICIENT N-BYTE SLACK SPACE HASHING IN RETRIEVING AND IDENTIFYING PARTIALLY RECOVERED DATA . In Proceedings of the 6th International Conference on Software and Database Technologies - Volume 1: ICSOFT, ISBN 978-989-8425-76-8, pages 309-312. DOI: 10.5220/0003605703090312

in Bibtex Style

@conference{icsoft11,
author={Ireneusz Jozwiak and Michal Kedziora},
title={EFFICIENT N-BYTE SLACK SPACE HASHING IN RETRIEVING AND IDENTIFYING PARTIALLY RECOVERED DATA},
booktitle={Proceedings of the 6th International Conference on Software and Database Technologies - Volume 1: ICSOFT,},
year={2011},
pages={309-312},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003605703090312},
isbn={978-989-8425-76-8},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Software and Database Technologies - Volume 1: ICSOFT,
TI - EFFICIENT N-BYTE SLACK SPACE HASHING IN RETRIEVING AND IDENTIFYING PARTIALLY RECOVERED DATA
SN - 978-989-8425-76-8
AU - Jozwiak I.
AU - Kedziora M.
PY - 2011
SP - 309
EP - 312
DO - 10.5220/0003605703090312