What Is Digital Forensics ? Part (42) Raspberry Pi Forensics




Raspberry Pi ဆုိတာ ဘယ္လုိမ်ဳိးလဲ ဘာလုပ္လုိ႕ရလဲ ဆုိတာ IT EC ပုိင္းကလူေတြ သိၿပီးသားပါ။ ARM-Based RISC OS Plan 9 FreeBSD Chromium OS Windows 10 IoT AmigaOS IchigoJam BASIC Kali * စတဲ့ OS ေတြ တင္ႏုိင္ပါတယ္။ အခုဆုိရင္ Raspberry Pi 3 Model B အထိေရာက္လာပါၿပီး အရင္ Model ေတြမွာ မပါတဲ႔ WiFI Blue tooth စနစ္ေတြပါ၀င္လာပါတယ္။ ပုိျပီး portable 
ျဖစ္လာပါတယ္​.​​​​အဲ့ေတာ့ Pentest အတြက္လဲ အသုံး
ခ်ႏုိင္သလုိ Remote အေနအထားနဲ႔ေရာ , WiFI Base အေနအထားနဲ႕လဲ အသုံးခ်လာႏုိင္ပါတယ္။ အခုအခ်ိန္မွာ ျဖစ္မလာေပမဲ့ ေနာင္တစ္ခ်ိန္မွာ ျဖစ္လာႏုိင္ေခ်ေတြ 
အတြက္ပါ။
Raspberry Pi မွာ OS loading အတြက္ေရာ Storage အတြက္ေရာ USB, SD card Class 10 ကုိေတာ္ေတ္ာမ်ားမ်ားအသုံးၿပဳၾကပါတယ္။ 
အခ်ဳိ႕ ေသာ Raspberry Pi ေတြမွာ​ေတာ့ memory အတြက္ Chip ကုိအသုံးၿပဳပါတယ္။ OS ေတာ္ေတာ္မ်ားမ်ားကေတာ့ linux Base ျဖစ္တဲ့ အတြက္ File System ကေတာ့ Ext4
ျဖစ္ပါတယ္။
How To Forensics
ဘယ္အခ်ိန္ ​​ဘယ္ေနရာမွာ ဘယ္လုိအေနအထားနဲ႕ အသုံးခ်တာလဲ 
(When where and How) 
ဘာေတြနဲ႕ခ်ိတ္ဆက္ထားလဲ 
( How to Connect With ) 
ခ်ိတ္​ဆက္​ထားတဲ့အတြက္​ ျဖစ္​မလဲ ... ?
(What Happen ?)
Imaging and hasing ပုိင္​းမွာ သတိထားရပါမယ္​.
Connector ​ေကာင္​းရပါမယ္​ 
SD, USB , linux Forensics အပုိင္းနဲ႕ဆက္စပ္ရပါမယ္။

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 valu
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

Volatility Workbench (GUI) for the Volatility tool

Image
 Memory Dump ကနေ Artifacts တွေကို ရယူနိုင်ဖို့ Volatility (Command Line) ကို တော်တော်များများ အသုံးပြုကြပါတယ်။ Pass Mark OS Forensics ကနေ GUI မသုံးချင်သူတွေ / နှစ်မျိုးလုံး အသုံးပြုချင်သူတွေအတွက် Volatility Workbench (GUI) ကိုပြုလုပ်ထားပါတယ်။ တွဲပြီးအသုံးပြုရမဲ့ Profile တွေကိုလဲ အသင့် Download ရယူနိုင်ပါတယ်။ Sample File တွေလဲပေးထားပါတယ်။ Open Source Computer Forensics Tool ဖြစ်တဲ့ Autopsy အပြင် Commercial Computer Forensics Tools တွေကလဲ လက်ရှိအချိန်ထိ Open Source ဖြစ်တဲ့ Volatility ကိုပဲ သူတို့ရဲ့ Software ထဲမှာ အသုံးပြုထားပါတယ်။                                                           Link  Volatility Workbench (GUI) for the Volatility tool
Read more