ForensicsWiki will continue to operate as it has before and will not be shutting down. Thank you for your continued support of ForensicsWiki.
Difference between revisions of "Piecewise hashing"
From ForensicsWiki
(initial stub) 
m 

Line 1:  Line 1:  
{{expand}}  {{expand}}  
'''Piecewise hashing''' is a [[hashing]] technique to divide an input into chunks and hash each chunk separately. It was invented by [[Nick Harbour]] in [[dcfldd]] to improve the reliability of [[:Category:Disk imagingdisk imaging]]. The theory was that if one chunk became corrupted, only the integrity of that chunk would be threatened. The piecewise hashes of the other chunks, which hadn't changed, could be used to prove their integrity.  '''Piecewise hashing''' is a [[hashing]] technique to divide an input into chunks and hash each chunk separately. It was invented by [[Nick Harbour]] in [[dcfldd]] to improve the reliability of [[:Category:Disk imagingdisk imaging]]. The theory was that if one chunk became corrupted, only the integrity of that chunk would be threatened. The piecewise hashes of the other chunks, which hadn't changed, could be used to prove their integrity.  
+  
+  ==References==  
+  * [[md5deep]], [[hashdeep]], etc.  
+  * [[dcfldd]]  
== See Also ==  == See Also ==  
* [[Context Triggered Piecewise Hashing]]  * [[Context Triggered Piecewise Hashing]] 
Revision as of 17:33, 27 July 2012
Please help to improve this article by expanding it.

Piecewise hashing is a hashing technique to divide an input into chunks and hash each chunk separately. It was invented by Nick Harbour in dcfldd to improve the reliability of disk imaging. The theory was that if one chunk became corrupted, only the integrity of that chunk would be threatened. The piecewise hashes of the other chunks, which hadn't changed, could be used to prove their integrity.