Hidden Data Identification in Solid State Drive Forensics

1. A method of isolating hidden data in a solid state memory system, the method comprising: obtaining a logical block address (LBA) image from the memory system; obtaining a physical block address (PBA) image; determining whether an error exists in the PBA image and correcting the error; calculating an error tolerant cyclic redundancy check (ETCRC) on each sector of the LBA image and building a search tree indexed on the ETCRC value; for each sector in the PBA image, computing the ETCRC value and searching for the ETCRC value in the LBA search tree; if the ETCRC value found, comparing a cyclic redundancy check (CRC) of the LBA and PBA sectors; and outputting to an output file the PBA sector as hidden data if either the ETCRC value is not found in the LBA search tree or the CRC comparison fails.

2. The method according to claim 1 , further comprising: selecting one of several puncturing patterns for ETCRC values; building a punctured ETCRC working search tree from the LBA search tree; for each sector in the hidden data file, computing the punctured ETCRC value and searching for the punctured ETCRC value in the working search tree; if the ETCRC value is found, comparing the data of the LBA and hidden data sectors; and outputting to a new hidden data output file the previous hidden data file sector if either the ETCRC value is not found in the LBA search tree or the data comparison fails as specified by a predefined limit.

3. The method according to claim 1 , wherein the search tree indexed on the ETCRC value is an Adelson-Velsky and Landis' (AVL) tree.

4. The method according to claim 1 , further comprising: after the step of obtaining a physical block address (PBA) image, determining whether an error exists in the PBA image and correcting the error.

5. The method according to claim 4 , wherein for each sector in the PBA image, the processing unit computes an ETCRC value and searches for the ETCRC value in the LBA search tree.

6. The system method according to claim 5 , wherein the processing unit outputs to an output file the PBA sector as hidden data if either the ETCRC value is not found in the LBA search tree or the CRC comparison fails.

7. A method of computing a total hash function of an array of values which limits the impact of a change in the array of values to a subfield in the hash value, the method comprising: dividing the array of values into a number of sections; computing a hash function over each section; and concatenating the computed hash function values to create a total hash function of the array of values, wherein a change in one of the array of values is reflected as a change in the total hash function in only one subfield; wherein the hash function is tolerant of bit errors in the source data.

8. A hidden data determination system for locating hidden data in a memory array of a solid state device, the system comprising: an interface to access memory space on a memory device; a processing unit to create a plurality of hash values for a logical block address (LBA) memory space of the memory device and to create a plurality of hash values for a physical block address (PBA) memory space of the memory to identify data hidden within the PBA memory space from view of the LBA memory space; wherein the graphics processing unit: creates a PBA index table associated with the plurality of PBA hash values; compares the plurality of LBA hash values with the PBA index table; identifies matches of any of the plurality of LBA hash values and any of the plurality of PBA hash values resulting from the step of comparing; and identifies data hidden within the PBA memory space when data identified in the PBA index table has no identified with any of the plurality of LBA hash values; and a display device to show the data hidden.

9. The system according to claim 8 , wherein the processing unit creates the hash value for both the LBA and PBA memory spaces as an error tolerant cyclic redundancy check (ETCRC) table for both the LBA memory space and PBA memory space.

10. The system according to claim 9 , further comprising creating at least one of the LBA ETCRC table and the PBA ETCRC table with a search tree.

11. The system according to claim 8 , wherein the processing unit selectively ignores combinations of fields with the PBA ETCRC table and LBA ETCRC table to resolve any uncorrected bit errors in the PBA memory space.

12. The system according to claim 8 , wherein the processing unit identifies matches by removing the matches after initially identifying matches occurs and then creates a second LBA ETCRC table, and then repeats to identify matches to increase a rate of execution.

13. The system according to claim 8 , wherein the processing unit selectively ignores combinations of fields with the PBA ETCRC table and the second LBA ETCRC table to resolve any uncorrected bit errors in the PBA memory space.

14. The system according to claim 8 , wherein the processing unit creates the LBA ETCRC table from each memory sector of the LBA memory space, and the processing unit creates the PBA memory space table from each memory sector of the PBA memory space.

15. The system according to claim 8 , wherein hidden data located is located without regard to a flash translation layer (FTL) mapping relationship between the PBA memory space and LBA memory space.

16. The system according to claim 8 , wherein the search tree comprises an Adelson-Velsky and Landis' (AVL) tree.

17. The system according to claim 8 , wherein the processing unit calculates an ETCRC on each sector of the LBA image and builds a search tree indexed on the ETCRC value.

18. The system according to claim 17 , wherein if the ETCRC value is found, the unit compares the cyclic redundancy check (CRC) of the LBA and PBA sectors.