Abstract | ||
---|---|---|
A message digest is a flxed length output produced by applying a crypto- graphic algorithm on input binary data of arbitrary length. If the input data changes even by one bit, the generated message digest will be completely difierent from the original. This is used in digital investigations to verify that stored digital evidence has not been tampered with. This technique has been applied successfully on physical disk images because there is only one continuous stream of data. However, this is not applica- ble to logical disk images where there is no obvious or standard method of concatenating the data to produce an output message digest. This paper de- scribes the di-culties that complicate the computation of a message digest for logical data. In addition, a candidate process for calculating a veriflca- tion value for computer forensic evidence for logical data, regardless of its underlying representation is given. This method is presented in the context of cellphone forensics. |
Year | Venue | Keywords |
---|---|---|
2008 | ISSA | veriflcation,cryptographic hash,computer forensics,message digest,logical disk |
Field | DocType | Citations |
Cryptography,Computer security,Computer science,Cryptographic hash function,Logical data model,Logical disk,Digital evidence,Concatenation,Binary data,Computation | Conference | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pontjho Mokhonoana | 1 | 1 | 0.68 |
Martin S. Olivier | 2 | 465 | 73.94 |