Skip to main content

Red Team and Pentest study


 Red Team and Pentest study 

knowledge requirements :

Red Team and Pentest study  শিখতে হলে আপনাকে প্রযুক্তি সম্পর্কে ভাল ধারনা থাকতে হবে। কোডিং এবং প্রোগ্রাম সম্পর্কে জানতে হবে। যারা হ্যাকিং করে তার ভাল মানের প্রোগ্রামার তাঁদের চিন্তা ভাবনা সাধারন মানুষের চিন্তা ভাবনার অনেক উপরে।। 


১.নেটওয়ার্কিং:

1. Good understanding of OSI layer model

2. Understating of communication flow through each layer

3. Good understanding of functions of each layer

4. Understanding of major protocols in each layer

5. In-depth understanding of Layer 3 & Layer 4 protocols, IP, ICMP (layer 3) TCP, and UDP Protocols (layer 4).


Overview of TCP/IP Layer model:

1. ARP / Understanding of Client & Server communication model

2. Ports common services run on Ephemeral port vs Well known ports.

Understanding of major (everyday Layer 7) services/protocols:

1. DNS

2. DHCP

3. HTTP

4. HTTP Header

5. Fields HTTP Status Codes

6. HTTP maintains a state

7. HTTPS vs HTTP o FTP.


Active vs Passive data transfer:

1. SSH / SSH handshake

2. Telnet /Telnet Handshake

3. SMTP / SMTP handshake (Mail from/ rcpt to) / How attachments are handled Network.

Troubleshooting Methodology:

1. Understanding of Network Address Translation (NAT)

2. Understanding of Port Address Translation (PAT)

3. Understanding of Proxies / Overview of Virtual Private Networks (VPNs)



ref:

https://www.imperva.com/learn/application-security/osi-model/

Comments

Popular posts from this blog

Discrete Mathematics - Rules of Inference

To deduce new statements from the statements whose truth that we already know,  Rules of Inference  are used. What are Rules of Inference for? Mathematical logic is often used for logical proofs. Proofs are valid arguments that determine the truth values of mathematical statements. An argument is a sequence of statements. The last statement is the conclusion and all its preceding statements are called premises (or hypothesis). The symbol “ ∴ ∴ ”, (read therefore) is placed before the conclusion. A valid argument is one where the conclusion follows from the truth values of the premises. Rules of Inference provide the templates or guidelines for constructing valid arguments from the statements that we already have. Table of Rules of Inference Rule of Inference Name Rule of Inference Name P ∴ P ∨ Q P ∴ P ∨ Q Addition P ∨ Q ¬ P ∴ Q P ∨ Q ¬ P ∴ Q Disjunctive Syllogism P Q ∴ P ∧ Q P Q ∴ P ∧ Q Conjunction P → Q Q → R ∴ P → R P → Q Q → R ∴ P → R ...

discrete mathematics:Introduction to Trees

Tree  is a discrete structure that represents hierarchical relationships between individual elements or nodes. A tree in which a parent has no more than two children is called a binary tree. Tree and its Properties Definition  − A Tree is a connected acyclic undirected graph. There is a unique path between every pair of vertices in  G G . A tree with N number of vertices contains  ( N − 1 ) ( N − 1 )  number of edges. The vertex which is of 0 degree is called root of the tree. The vertex which is of 1 degree is called leaf node of the tree and the degree of an internal node is at least 2. Example  − The following is an example of a tree − Centers and Bi-Centers of a Tree The center of a tree is a vertex with minimal eccentricity. The eccentricity of a vertex  X X  in a tree  G G  is the maximum distance between the vertex  X X  and any other vertex of the tree. The maximum eccentricity is the tree diameter. If a ...

discrete mathematics: Venn Diagrams

Venn Diagrams Venn diagram, invented in 1880 by John Venn, is a schematic diagram that shows all possible logical relations between different mathematical sets. Examples Set Operations Set Operations include Set Union, Set Intersection, Set Difference, Complement of Set, and Cartesian Product. Set Union The union of sets A and B (denoted by  A ∪ B A ∪ B ) is the set of elements which are in A, in B, or in both A and B. Hence,  A ∪ B = { x | x ∈ A   O R   x ∈ B } A ∪ B = { x | x ∈ A   O R   x ∈ B } . Example  − If  A = { 10 , 11 , 12 , 13 } A = { 10 , 11 , 12 , 13 }  and B =  { 13 , 14 , 15 } { 13 , 14 , 15 } , then  A ∪ B = { 10 , 11 , 12 , 13 , 14 , 15 } A ∪ B = { 10 , 11 , 12 , 13 , 14 , 15 } . (The common element occurs only once) Set Intersection The intersection of sets A and B (denoted by  A ∩ B A ∩ B ) is the set of elements which are in both A and B. Hence,  A ∩ B = { x | x ∈ A   A N D...