SSD Structure & Forensics [Second Edition] PDF

 




Download From Archive



Comments

Post a Comment

Popular posts from this blog

B-Trees (NTFS)

Image
  B-Trees An NTFS index sort attributes into a tree, specifically a B-tree. A tree is a group of data structures called nodes that are linked together such that there is a head node and its branches out to the other nodes. Consider Figure 11.13(A), where we see node A on top and it links to nodes B and C. Node B links to nodes D and E. A parent node is one that links to other nodes, and a child node is one that is linked to. For example, A is a parent node to B and C, which are children of A. A leaf node is one that has no links from it. Nodes C, D, and E are leaves. The example shown is a binary tree because there are a maximum of two children per node. Figure 11.13. Examples of A) a tree with 5 nodes and B) the same tree that is sorted by the node values FIG- 11.3 Trees are useful because they can be used to easily sort and find data. Figure 11.13(B) shows the same tree as we saw on the left side, but now with values that are assigned to each node. If we are trying to look up a ...
Read more

NTFS Index Attributes

Image
  NTFS Index Attributes Now that we have described the general concept of B-trees, we need to describe how they are implemented in NTFS to create indexes. Each entry in the tree uses a data structure called an index entry to store the values in each node. There are many types of index entries, but they all have the same standard header fields, which are given in Chapter 13. For example, a directory index entry contains a few header values and a $FILE_NAME attribute. The index entries are organized into nodes of the tree and stored in a list. An empty entry is used to signal the end of the list. Figure 11.18 shows an example of a node in a directory index with four $FILE_NAME index entries. Figure 11.18. A node in an NTFS directory index tree with four index entries. Figure 11.18 The index nodes can be stored in two types of MFT entry attributes. The $INDEX_ROOT attribute is always resident and can store only one node that contains a small number of index entries. The $INDEX_ROOT at...
Read more

Low Budget, High Impact Digital Forensics Investigation

ယခု  PDF သည်  Digital Forensics  ကိုစိတ်ပါဝင်စားသည့် လူတစ်ဉီးတစ်ယောက် (သို့မဟုတ်) အဖွဲ့အစည်းများက Digital Forensics Lab  တစ်ခုကို ကုန်ကျစာရိတ် သက်သာ စွာဖြင့် တည်ထောင်လုပ်ကိုင်နိုင်ရန်အတွက် Reference ပြုလုပ်နိုင်ရန်ဖြစ်ပါသည်။ တစ်ခုချင်းစီကို ဘယ်လိုအသုံးပြုရမလဲဆိုတာကိုမဖော်ပြထားပါ။   Low Budget, High Impact Digital Forensics Investigation
Read more