eCDFP (Module-6) (Window Forensics) (Part - 1 )




လက်ရှိအချိန်မှာ PC/Laptop သုံးစွဲတဲ့အထဲမှာ Window အသုံးပြုသူက ကမ္ဘာမှာ အများဆုံးဖြစ်ပါတယ်။ Operation System အနေနဲ့ကြည့်မယ်ဆိုရင် ဒုတိယအများဆုံးဖြစ်ပါတယ်၊ ပထမအများဆုံးကတော့ Android ဖြစ်ပါတယ်။ Window 1.0 ကနေ အခုနောက်ဆုံးထွက်တဲ့ Window 11 အထိမှာ လက်ရှိလူတွေ အများဆုံးအသုံးပြုတာကတော့ Window 10/ Window 11 ဖြစ်ပါတယ်။ Forensics Analysis လုပ်မယ်ဆိုရင် Window ကနေရနိုင်တဲ့ Artifact (2) မျိုးရှိပါတယ်။

(1) System Artifacts 

(2) User Artifacts 


System Artifacts  ကတော့ Window Operation System   ကနေရနိုင်တဲ့ Artifacts တွေဖြစ်ပါတယ်။ 
System Artifacts Example 

Registry Artifacts
Event Logs
File System Artifacts (Master File Table)
Prefetch Files
Volume Shadow Copies 




User Artifacts ကတော့ User အသုံးပြုတဲ့ Computer ပေါ်မှာ User ကနေအသုံးပြုတဲ့ Activity တွေဖြစ်ပါတယ်။ တစ်ကယ်တန်း Forensics Analysis လုပ်မယ်ဆိုရင် System Artifacts ကိုရော User Artifacts ကိုရော Analysis ပြုလုပ်ပါတယ်။ 

User Artifacts Example 

UserAssist 
LNK Files
Browser Artifacts 
Recycle Bin 
Recent File 
Jump Lists 


.LNK File (Shortcut) Analysis 

What is .LNK File ? 

According to Microsoft, a .lnk file, also known as a Shell Link or shortcut file, is a file that contains information used to access another data object, such as a file, folder, or application. These files are used to create shortcuts that allow users to quickly access the target item without navigating through the file system.


တစ်ခါတစ်လေမှာ မြန်မာလိုထက် English လိုကဖတ်ရတာပိုရှင်းပါတယ်။ .LNK File ဆိုတာက Computer မှာ တွေ့နေကျဖြစ်တဲ့ Shortcut File တွေဖြစ်ပြီး အဲဒီ Shortcut File တွေက .LNK Extension နဲ့ဖြစ်ပါတယ်။


LNK File (Shortcut) file ကို Hex Editor နဲ့ဖွင့်ကြည့်မယ်ဆိုရင် Offset 0 မှာ  ( 4C 00 00 00 ) Signature ကိုတွေ့ရမှာဖြစ်ပါတယ်။ အဲဒီ ( 4C 00 00 00 01 14 02 00 ) Signature ကြောင့် .LNK File တွေကို Carve/Recovery ပြုလုပ်လို့ရပါတယ်။ Recovery  သို့မဟုတ် Computer Forensics တွေက File Type တစ်ခုချင်စီမှာရှိတဲ့ Signature ကိုကြည့်ပြီး Recovery Process ပြုလုပ်တာဖြစ်ပါတယ်။



Comments

Mana said…
How does the header signature 4C 00 00 00 in LNK files indicate that they are recoverable? Do every recoverable files have this signature?
12 July 2024 at 21:27
Forensics Myanmar said…
recovery program or forensics Tools will carve 4C00000001140200 header signature for LNK File
17 July 2024 at 09:55
Post a Comment

Popular posts from this blog

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

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