CRYPTOGRAPHY & NETWORK SECURITY

Complete Study Guide

Simple • Easy • Beginner-Friendly

📚 Quick Revision Notes

For University Exams

MODULE 1: NUMBER THEORY & BASIC CRYPTOGRAPHY

1.1 Security Goals, Attacks, Services & Mechanisms
What's this about? It's like understanding what makes something secure and what threatens it.
Real-life analogy: Imagine your house. Security goals = locks, gates, alarms. Attacks = burglars. Services =
security guards.
Key Points:
Confidentiality = Only authorized people can read (like a sealed letter)
Integrity = Data doesn't change (like checking if someone opened your letter)
Authenticity = You know it's really from that person (like a real signature)
Modular Arithmetic = Working with numbers in cycles (like a clock - 25 hours = 1 hour)

📌 Summary:
Security has 3 main goals (keep it secret, keep it intact, prove who sent it). Math helps protect data
through number patterns.
Keywords: Confidentiality, Integrity, Authentication, Modular arithmetic

1.2 Classical Encryption Techniques

What's this about? Old ways of hiding messages before computers existed.
Real Examples:
Monoalphabetic cipher = Replace each letter with same letter always (A→D, B→E...). Weak -
hackers can guess.
Polyalphabetic cipher = Replace each letter with DIFFERENT letters each time. Much safer!
Vigenere cipher = Use a keyword to change how you encrypt. Example: keyword 'KEY' makes
encryption different at each position.
 Playfair cipher = Encrypt pairs of letters using a 5×5 grid.
Hill cipher = Uses matrix math to encrypt groups of letters.
Transposition = Rearrange letter positions (like anagramming).

📌 Summary:
Old encryption methods replace or rearrange letters. Some use keywords, some use math grids.
Modern methods are much stronger.
Keywords: Caesar cipher, Vigenere, Playfair, Transposition, Substitution

MODULE 2: SYMMETRIC & ASYMMETRIC CRYPTOGRAPHY

2.1 Block Cipher Principles & DES/AES
What's this about? Modern ways to encrypt data in chunks.
Real analogy: Think of it like a photocopier that scrambles pages. Modes decide HOW it scrambles.
Key Concepts:
Block ciphers = Encrypt fixed-size data chunks (64-bit, 128-bit blocks)
DES = Old standard, 56-bit key, now weak
Triple DES = Apply DES three times, more secure
AES = Modern standard, 128/192/256-bit keys, super secure
RC4 = Stream cipher - encrypts continuous data (like a stream)
Modes of operation = Different ways to use the cipher (ECB, CBC, etc.)

📌 Summary:
Block ciphers encrypt data in fixed chunks. DES is old and weak. AES is modern and strong. Modes
decide how blocks relate.
Keywords: DES, AES, Block cipher, Stream cipher, Encryption modes (ECB, CBC)

2.2 Public Key Cryptography & RSA

What's this about? Using TWO different keys - one public (everyone sees), one private (only you have).
Real-life analogy:
• Public key = Your email address (everyone can send you mail)
• Private key = Your mailbox key (only you can open it)
How RSA Works:
1. Create two huge prime numbers (p and q)
2. Multiply them to get n
3. Calculate keys using special formula
4. Public key (n, e) = What everyone uses to encrypt
5. Private key (n, d) = What only you use to decrypt

📌 Summary:
 Public key encryption uses two keys. Everyone has your public key to send you encrypted messages.
Only you have private key to read them.
Keywords: RSA, Public key, Private key, Prime numbers, Encryption/Decryption

2.3 Key Distribution & Kerberos

What's this about? How do people safely exchange keys? How do servers prove you're really you?
Key Concepts:
KDC (Key Distribution Center) = Trusted middleman who gives keys to people
Needham-Schroeder Protocol = Step-by-step way A and B exchange keys safely
Kerberos = Real-world system (like Active Directory at work)
Diffie-Hellman = Two people create a shared secret over open internet
Digital Certificates & PKI = X.509 format for digital ID, PKI = System of authorities

📌 Summary:
Key distribution systems solve 'how to share secret keys safely?' Kerberos is a real system using
tickets. Diffie-Hellman creates shared secrets.
Keywords: Kerberos, KDC, Diffie-Hellman, X.509, PKI, Digital Certificate

MODULE 3: CRYPTOGRAPHIC HASH FUNCTIONS

3.1 Cryptographic Hash Functions
What's this about? Creating a unique digital fingerprint of data.
Real analogy:
• Input = Whole book
• Output = 5-digit code
• Different books → Different codes
• Change ONE letter in book → Code completely changes
How it Works:
1. Take any data (1 byte or 1000 GB)
2. Run through hash function
3. Get fixed-size output (like always 128 bits or 256 bits)
4. Impossible to reverse (can't get original data back)
Important Properties:
One-way = Can't reverse it
Deterministic = Same input = Same output always
Avalanche effect = Tiny change = Huge different output
No collisions = Different inputs can't give same output
Common Hash Functions:
MD5 = Old, 128-bit (don't use anymore)
 SHA-1 = Medium security, 160-bit (getting old)
SHA-256, SHA-512 = Modern and secure
HMAC = Hash with secret key, proves sender AND data integrity

📌 Summary:
Hash functions create unique fingerprints for data. Can't reverse them. Used to verify if data changed.
Keywords: Hash function, MD5, SHA-1, SHA-256, HMAC, Collision, One-way function

MODULE 4: AUTHENTICATION & DIGITAL SIGNATURES

4.1 User Authentication
What's this about? Proving 'I am really who I claim to be.'
Password-based:
• You type password (something you know)
• System checks if it matches
• Weak if password is weak
Challenge-Response:
• System asks random question: 'What is 7+5?'
• You answer
• System checks
• Real example: When your bank texts you a code for transactions

4.2 Digital Signatures

What's this about? Proving 'This is really from me and hasn't been changed.'
Real analogy: Your physical signature on a check proves it's from you.
How Digital Signature Works:
1. Create hash (fingerprint) of document
2. Encrypt hash with YOUR private key
3. Send document + encrypted hash to others
4. They decrypt using YOUR public key to verify
5. If hash matches = Really from you AND document unchanged

📌 Summary:
Digital signature proves who sent it and it wasn't changed. Uses private key to create, public key to
verify.
Keywords: Digital signature, Private key encryption, Non-repudiation, RSA signature

MODULE 5: NETWORK SECURITY & APPLICATIONS

5.1 Network Security Basics & Attacks
What's this about? Threats when data travels over internet.
Common Attacks:
Packet Sniffing = Hacker listens to internet traffic like reading letters
ARP Spoofing = Fake 'address book' of internet, route traffic through you
Port Scanning = Find open ports on server (like checking which doors unlocked)
IP Spoofing = Fake your IP address (like fake return address on letter)

📌 Summary:
Network attacks intercept data (sniffing), fake identities (spoofing), or map targets (scanning).
Happens at different layers.
Keywords: Packet sniffing, ARP spoofing, IP spoofing, Port scanning, Network vulnerabilities

5.2 Denial of Service (DoS) Attacks

What's this about? Overwhelming servers so they can't serve real users.
Real analogy: Calling someone's phone 1000 times per second so they can't answer others.
Types:
ICMP Flood (Ping Flood) = Send massive PING requests
SYN Flood = Send fake connection requests, server gets overwhelmed
UDP Flood = Send massive UDP packets, consumes bandwidth
DDoS (Distributed Denial of Service) = Attack from 1000s of computers at once using botnet

📌 Summary:
DoS overwhelms servers with traffic so real users can't access. DDoS uses many computers attacking
together.
Keywords: DoS, DDoS, ICMP flood, SYN flood, UDP flood, Botnet

5.3 Internet Security Protocols

What's this about? Real-world systems protecting internet communication.
PGP (Pretty Good Privacy) = Encrypts emails end-to-end. Only you and recipient can read.
SSL/TLS = Encrypts web traffic (HTTPS). See 🔒 in browser.
IPSEC = Encrypts at network layer. Entire network traffic protected.
Firewalls = Security guard at building entrance. Blocks unwanted traffic.
IDS (Intrusion Detection System) = Watches network for suspicious patterns. Alerts on attack.

📌 Summary:
PGP encrypts emails. SSL/HTTPS encrypts websites. Firewalls block attacks. IDS detects attacks.
Keywords: PGP, SSL/TLS, HTTPS, IPSEC, Firewall, IDS, End-to-end encryption

MODULE 6: SYSTEM SECURITY

6.1 Buffer Overflow, Malware & SQL Injection
What's this about? Software vulnerabilities hackers exploit locally.
Buffer Overflow:
• Memory bucket = 'buffer' with fixed size
• You pour in more water than it holds → Overflows
• Overflow water can overwrite other data
• Hackers write code in overflow to take control
Malware (Worms & Viruses):
Virus = Code that attaches to files and spreads when files run
Worm = Self-spreading without needing to attach to files
• Steals data, encrypts files for ransom, uses your computer for attacks
SQL Injection:
• Web form asks for username
• Hacker types: admin' OR '1'='1' instead of name
• Server runs special query → Gets all users!
• Hacker can read/change/delete database

📌 Summary:
Buffer overflow overfills memory to hijack code. Malware spreads and damages. SQL injection tricks
databases using special characters.
Keywords: Buffer overflow, Virus, Worm, Malware, SQL injection, Stack overflow

🎯 QUICK REVISION CHECKLIST

☐ Classical encryption = Old methods (Caesar, Vigenere)
☐ Symmetric encryption = One key (DES, AES)
☐ Asymmetric encryption = Two keys (RSA, Public/Private)
☐ Hash = Fingerprint (MD5, SHA)
☐ Digital Signature = Prove identity (private key sign, public key verify)
☐ DoS = Overwhelm servers
☐ Network attacks = Intercept/fake (sniffing, spoofing)
☐ Malware = Worms/viruses
☐ SQL injection = Trick database with special characters

Good luck with your exams! 📚✨