OODA Loop

Incident Response တွင်သာမက Network နဲ့ချိတ်ဆက်ထားတဲ့ Electronic Devices တွေကို Forensics ပြုလုပ်ရမှာ သိမ်းဆည်းရာမှာ အသုံးပြုတဲ့ OODA Loop ပါ။Triage လုပ်တဲ့နေရာမှာ အသုံးပြုရမှာဖြစ်ပါတယ်။
Source: Cybertriage

ThirdEye
ForensicsMyanmar

Comments

Post a Comment

Popular posts from this blog

eCDFP (Data Representation & File Examination) (Part-5)

Image
Exe Analysis  EXE File တွေကို အခြားသော File Type တွေလိုပဲ Analysis, Extract ပြုလုပ်လို့ရပါတယ်။ Text, Document, Word File တွေကို ဖွင့်ကြည့်တာက Executing ပြုလုပ်တာမဟုတ်ပါ။ EXE File ကိုTEXT File လိုသဘောထားကြည့်မယ်ဆိုရင် EXE File ထဲမှာ Processor ကို Read, Execute လုပ်ဖို့အတွက် Instruction တွေပါဝင်ပါတယ်။  Executable File Format တွေက Operation System အပေါ်မူတည်ပြီး ကွာခြားမှုတွေရှိပါတယ်။ Window မှာဆိုရင် Portable Executable (PE) Or (EXE) လို့ခေါ်ပါတယ်။ Linux မှာဆိုရင်တော့ Executable Linkable Format (ELF) OR Binary File  လို့ခေါ်ပါတယ်။ EXE File တွေကို Compiler ကနေပြုလုပ်ထားပြီး C, C++,C#, JAVA တို့နဲ့ရေးသားပြီး EXE File အဖြစ် Compiles လုပ်ထားတာဖြစ်ပါတယ်။ Compiler ကနေ Original Code ကိုယူပြီး Processor နားလည်ဖို့အတွက် Machine Code အဖြစ်ပြောင်းလဲပေးပါတယ်။  EXE File အဖြစ်မပြောင်းလဲခင်မှာ Code ထဲကို Compiler က  Header  ကို ပါပေါင်းထည့်ပါတယ်။ EXE EXE File တိုင်မှာ ကိုယ်ပိုင် Pre-defined format ရှိပါတယ်။ Header  ပါတဲ့ EXE File တိုင်းမှာ Investigation အတွက် အသုံးဝင်တဲ့ Metadata တွေပါဝင်ပါတယ်။ EXE Fil
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 attrib
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 valu
Read more