InfoSecTube
1.71K subscribers
682 photos
44 videos
273 files
1.71K links
Subscribe to this channel if… you enjoy fun and educational videos about technology & CyberSecurity & ...
YouTube Channel:
https://youtube.com/c/InfoSecTube


Contact:
@InfoSecTube_Bot
Download Telegram
🏒 2. OV – Organization Validation
Purpose: Encrypts and authenticates the organization behind the domain.

βœ… Validation Level: Confirms domain ownership and verifies company details (via business registration, phone, etc.)

πŸ“„ Certificate Info: Includes organization name and location

πŸ‘ Browser Bar: Padlock only, but company name visible in cert details

πŸ’° Cost: Moderate

🧰 Use Case: Business websites, login portals, B2B platforms

Example:
Issued to: example.com
Organization: Example Corp, US

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ“š OS Concepts β€” What Happens When the System Runs Out of RAM? πŸ’₯🧡
Let’s break down how the OS reacts when memory is almost full! πŸ”

🧠 The Problem:
Your system is running low on RAM. New apps need memory, but there’s no space left! What does the OS do?

πŸ”Ή Option 1: Swapping / Paging Out
πŸ’½ Move memory pages from RAM β†’ disk (swap area)
🧊 Frees up RAM for urgent tasks
⚠️ Disk is much slower β†’ system may feel sluggish ("thrashing")

πŸ“Œ Think: Push books to a shelf to make space on your desk

πŸ”Ή Option 2: Killing Processes (OOM Killer / LMK)
πŸ’€ OS starts terminating processes to free memory

🧠 OOM Killer (Linux): kills least important process

πŸ“± LMK (Android): aggressively frees memory by killing background apps

⚠️ Risk: Important work may be lost if a process is killed



🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ“š OS & Computer Architecture β€” Understanding Caches & TLB 🧡
Let’s break down how your system stores & accesses memory efficiently!

πŸ”Έ A. L1 Cache (Level 1 Cache)
⚑️ Ultra-fast, small-sized cache (typically 16KB–128KB)
πŸ“ Located inside the CPU core
🧠 Stores frequently used instructions & data
βš™οΈ Split into L1-I (Instructions) and L1-D (Data)
⏱️ Fastest access (~1–2 CPU cycles)
πŸš€ Purpose: Minimize delay between CPU and memory

πŸ”Έ B. Page Cache
πŸ—ƒ Part of the OS's memory management
πŸ’Ύ Caches data read from or written to disk
🎯 Works at the file system level (pages, not bytes)
πŸ“ˆ Improves I/O performance by reducing disk access
βœ… Example:
When you cat file.txt, the data goes to page cache so next reads are instant (RAM-based)!

πŸ”Έ C. TLB (Translation Lookaside Buffer)
🧭 Special cache inside the CPU
πŸ” Maps virtual addresses β†’ physical addresses
πŸ“ Speeds up memory address translation
πŸ”„ Without TLB, each memory access requires a page table lookup
⏱️ Much faster than walking full page tables
🚨 TLB Miss = CPU has to do extra work (slow)

πŸ”Έ D. L3 Cache (Level 3 Cache)
πŸ“¦ Shared cache across multiple CPU cores
πŸ” Larger but slower than L1/L2 (e.g., 4MB–64MB)
πŸ“‰ Latency: ~10–20 CPU cycles
🧠 Holds data that doesn't fit in L1/L2 but is still reused often
🧰 Acts as a "last chance" before going to main memory

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
🐞CVE is a catalog of known software flaws, with each ID representing a specific vulnerability. CWE, on the other hand, is a category system for software and hardware weaknesses that can lead to vulnerabilities.
🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ₯ƒMitigating DDoS attacks onξ€Ÿtheξ€Ÿinternet ofξ€Ÿthings using federated learning

Link


🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ“š OS Concepts β€” Cooperative vs Preemptive Scheduling 🧡
Ever wondered how your computer decides who gets the CPU and when? Let’s break it down:

πŸ”Ή 1. Cooperative Scheduling
🀝 The process gives up the CPU voluntarily
πŸ›‘ If it never gives up, no one else runs
⚠️ One buggy program = system freeze
πŸ— Used in old Windows, embedded systems

πŸ”Ή 2. Preemptive Scheduling (Non-Cooperative)
⏱️ OS uses a timer to interrupt running processes
πŸ” CPU is forcefully switched between tasks
πŸ’ͺ More stable & fair
πŸƒ Used in Linux, Android, Windows, etc.

πŸ“Œ Key Difference:

Cooperative: β€œI’ll tell you when I’m done”

Preemptive: β€œTime’s up! Next process please”

πŸ’‘ Modern OS = Preemptive, for fairness + safety!

#OS #Scheduling #Preemptive #Cooperative #CSBasics #InfoSecTube

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸͺ‘Internet Key Exchange (IKE) is a secure key management protocol that establishes secure, authenticated communication channels over IP networks. It's used to set up security associations (SAs) in Internet Protocol Security (IPsec) for VPN connections, ensuring both parties use common encryption and authentication methods for secure data exchange.

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ› 3. EV – Extended Validation
Purpose: Maximum trust; strictest authentication.

βœ… Validation Level: Very thorough business verification (legal, physical, operational existence)

πŸ“„ Certificate Info: Full organization details

πŸ‘ Browser Bar: Padlock + organization name in address bar (some browsers now hide this, but cert details still contain it)

πŸ’° Cost: Most expensive

🧰 Use Case: Banks, e-commerce, government portals, high-trust sites

Example:
Address bar: πŸ”’ [Example Corp] https://example.com


🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
A one-time pad is a cryptographic technique that ensures perfect secrecy, meaning it's mathematically impossible to decrypt a message without knowing the key. It works by using a random key of the same length as the message, encrypting each character or bit of the plaintext with the corresponding character or bit from the key using operations like XOR or modular addition. Crucially, the key is only used once and then discarded.

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ“š OS Concepts β€” Dining Philosophers Problem 🧡
Let’s solve a dinner table mystery that teaches us all about deadlock and resource sharing πŸ‘‡

πŸ‘¨β€πŸŽ“ The Setup:

5 philosophers sit around a table 🍽

5 forks placed between them 🍴

To eat, each needs 2 forks (left + right)

After eating β†’ Think β†’ Get hungry again


😱 The Problem:
If each picks up their left fork first, they all wait forever for the right fork
β†’ This causes a deadlock πŸ’₯

πŸ”‘ Solutions:

βœ… Lock Ordering: Always pick lower-numbered fork first
βœ… Asymmetric Strategy: Odd picks left-first, even picks right-first
βœ… At Most 4 at Table: Prevents total deadlock
βœ… Use a Waiter: Central manager checks availability

πŸ“Œ Core Concepts:

Philosophers = Threads

Forks = Shared Resources

Eat = Critical Section

Think = Non-Critical Work

Deadlock, starvation, and concurrency β€” all on one dinner table!


#OS #Deadlock #DiningPhilosophers #Semaphores #Concurrency #InfoSecTube



🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
❀1
🚨 Replay Attack Explained πŸ”
A replay attack is a sneaky cyber trick where attackers intercept legit data and resend it to fool systems into thinking it’s real β€” leading to unauthorized access or action manipulation.

πŸ” How It Works:
1️⃣ Interception:
Attacker sniffs data between two parties (e.g. login or transaction).
2️⃣ Re-transmission:
They replay that data to the receiver, pretending to be the legit sender.
3️⃣ Deception:
The receiver gets tricked, thinking it’s valid β€” and boom πŸ’₯, the attacker is in!

πŸ“Œ Examples:
πŸ”“ Login Replay:
Stealing & reusing login credentials to access accounts.
πŸ’Έ Transaction Replay:
Duplicating a payment to drain funds or cause confusion.
πŸ›‘ Session Replay:
Using stolen session tokens to impersonate users.

🧠 Stay safe! Use encryption, session expiration, and anti-replay mechanisms.
#CyberSecurity #ReplayAttack #InfoSec #HackingExplained #CyberAwareness #StaySecure


🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ” What is HOTP? (HMAC-based One-Time Password) πŸ”

HOTP is a powerful algorithm used in multi-factor authentication (MFA) to boost your security beyond just passwords.

🧠 It works by generating one-time, unique passwords using:
πŸ”‘ A shared secret key
πŸ“ˆ A counter value (increases with each use)

Every time the counter updates, a new password is created β€” and it’s valid only once. Even if someone sees it, they can't reuse it! πŸ™…β€β™‚οΈ

βœ… Why Use HOTP?
πŸ”Έ Adds an extra layer of security
πŸ”Έ Prevents password reuse
πŸ”Έ Great for offline devices (no need for real-time clock)

πŸ’‘ Used in hardware tokens, MFA apps, and enterprise systems.

#CyberSecurity #HOTP #MFA #OneTimePassword #Authentication #SecureAccess #InfoSec #IdentityVerification #2FA

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
β›‘Port mirroring, also known as SPAN (Switched Port Analyzer), is a networking technique where a network switch or router duplicates network packets from one port (the source port) and forwards them to another port (the destination or mirrored port). This allows network administrators to monitor and analyze traffic on a specific port without interrupting normal network operations.

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ‘1
πŸ’» 4. IV – Individual Validation (for Code Signing)
Purpose: Authenticates individual developers for signing software/code.

βœ… Validation Level: Verifies personal identity (via government ID, utility bills, etc.)

πŸ“„ Certificate Info: Includes individual's legal name

πŸ‘ Prompt: Shows developer’s name when users run signed software

πŸ’° Cost: Varies

🧰 Use Case: Independent developers releasing apps or tools

Example (in a code-signing dialog):
"Publisher: John Doe"
πŸ“š OS Concepts β€” When Do Kernel Modules Run? 🧡
Let’s break down how and when kernel module or device driver code executes!

πŸ”§ A kernel module (like a device driver) is a piece of code that can be loaded/unloaded into the kernel at runtime. But when does it actually run?


βœ… It runs when…

πŸ”Ή A device or syscall triggers a registered event
πŸ”Ή You load the module β†’ insmod β†’ runs init_module()
πŸ”Ή You unload the module β†’ rmmod β†’ runs cleanup_module()
πŸ”Ή A special file (like /dev/zero) is accessed β†’ the corresponding driver’s function runs

🧠 Example:
Reading from /dev/zero calls the read handler of its device driver.

πŸ“Œ Takeaway:
Drivers respond to events, they don’t idle or run endlessly!

#Kernel #DeviceDriver #OS

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ”„ Reflection Attack in Symmetric Protocols πŸ›‘

A Reflection Attack is a clever trick used by attackers to exploit symmetric authentication protocols, especially when both parties use the same secret key. The attacker "reflects" a challenge back to the sender to bypass authentication without knowing the secret key.

βš™οΈ How It Works:
1️⃣ The attacker initiates a connection to the victim and receives a challenge (e.g. a nonce).
2️⃣ Instead of solving it, the attacker opens a second connection to the victim and sends the same challenge back.
3️⃣ The victim unknowingly solves their own challenge, thinking it's coming from a legit source.
4️⃣ The attacker grabs the valid response and uses it to authenticate in the original session. 😈

πŸ’₯ Why It’s Dangerous:
Because the same protocol and key are used for both sides, there's no way to tell that the challenge came from the same party. It allows attackers to bypass authentication without breaking encryption.

πŸ›‘ Mitigation Tips:
βœ… Use different keys or roles for client/server
βœ… Add origin identifiers in challenges
βœ… Employ asymmetric authentication if possible

#CyberSecurity #ReflectionAttack #SymmetricEncryption #NetworkSecurity #InfoSecTube #Hacking101 #StaySecure

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
❀1
β›±A value flow graph (VFG) is a representation of a program's data flow, showing how values are defined and used throughout the code. It's a directed graph where nodes represent definitions and uses of values, and edges represent the flow of data between them. VFGs are used in static analysis to understand how data changes during program execution and are crucial for analyzing things like vulnerabilities, optimizations, and code transformations.
🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
Defense in depth is a security strategy that uses multiple layers of protection to safeguard assets. It's a proactive approach that aims to deter threats before they happen and mitigate damage if an attack is successful. By layering security controls, defense in depth provides redundancy and helps contain breaches, even if one layer fails.

Examples of Security Controls in a DiD Strategy:
Perimeter Security: Firewalls, intrusion prevention systems.
Network Security: Network segmentation, VPNs.
Endpoint Security: Antivirus, endpoint detection and response (EDR).
Application Security: Security testing, vulnerability management.
Data Security: Encryption, access control lists.
Identity and Access Management: Multi-factor authentication, least privilege principle.
Security Awareness Training: Educating users about potential threats.

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
⏱️ What is TOTP? (Time-based One-Time Password) πŸ”

TOTP stands for Time-based One-Time Password, a widely used algorithm in multi-factor authentication (MFA) that generates a new, temporary password every 30 seconds based on time and a shared secret.

πŸ›  How It Works:
πŸ”‘ A shared secret key
πŸ•’ The current timestamp
Together, these generate a short, unique code β€” valid for a limited time (usually 30 seconds). After that, it's gone! 🚫

πŸ“² Commonly used in apps like Google Authenticator, Authy, and Microsoft Authenticator.

βœ… Why TOTP is Great:
πŸ”’ Codes constantly refresh
πŸ’₯ Resistant to replay attacks
πŸ“Ά No need for constant internet β€” works offline
πŸš€ Easy to implement and user-friendly

⚠️ Just remember: if your device's time is off, TOTP might not work correctly!

#CyberSecurity #TOTP #2FA #OneTimePassword #MFA #Authentication #InfoSec #StaySecure #AuthApps #TimeBasedSecurity

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
β›‘Intermediate code (also known as intermediate representation, or IR) is a machine-independent representation of a program, generated by a compiler as a step between the source code and machine code. It allows for better optimization and portability, making it easier to target different hardware architectures with a single compiler.

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us
πŸ“š OS Concepts β€” Deadlocks Made Simple! 🧡
Let’s break down how deadlocks happen, how to avoid them, and how to fix them if things go wrong πŸ’₯

πŸ”’ Deadlock Needs 4 Conditions:


Mutual Exclusion β†’ Only one thread uses a resource

Hold & Wait β†’ Hold one lock, wait for another

No Preemption β†’ Can’t force release of resources

Circular Wait β†’ A waits for B, B for C, C for A

πŸ›‘ How to Avoid Deadlocks:

πŸ” Lock Ordering β†’ Always lock in the same order

βœ‹ Hold & Wait Prevention β†’ Grab all locks at once

πŸ”„ Try-Lock + Retry β†’ Release & retry after random delay

βš™οΈ Lock-Free (Atomic ops) β†’ Avoid locks entirely

🚨 If Deadlock Happens:

☠️ Kill one thread β†’ Free its resources

βͺ Rollback & Restart β†’ Safer but needs saved state

🎯@InfoSecTube
πŸ“ŒYouTube channel
🎁Boost Us