💻 Slide 1: Title Slide: Cryptanalysis & Ethical Hacking

Core Message

The session is not about breaking things for malicious fun; it’s about understanding
failure to ensure robust security systems1.

Key Concept / Teaching Explanation

The famous quote you are using is perfect: “If you don’t know how a lock breaks, you
will never learn to build a stronger lock.”

 Cryptanalysis is the defensive mindset applied to offensive actions.

 Ethical Hacking is the legal, authorized application of those offensive skills.

🔒 Slide 2: What is Cryptanalysis?

Concept: The Science of Breaking Crypto 2

Cryptanalysis is the study of methods for obtaining the plaintext of a message, or the secret
key, without having the legal right to do so.

Goal What it Means

Figuring out the original message (e.g., "Meet me at 9 PM")

Recover Plaintext 4
without recovering the key.

Discovering the secret key (e.g., the 256-bit AES key) that
Identify Key 5
can then be used to decrypt all future messages.

Find Flaws in Algorithm or Identifying a bug in the code or a statistical weakness in

Implementation 6 the cipher math.

Deep Dive: Math vs. Human Mistakes 7

The modern reality is that attacks rarely focus on breaking the math of ciphers like AES or
RSA, which are proven secure. Attacks focus on the implementation:

 Configuration Errors: Using an obsolete cipher mode (like ECB) or a weak key size.

 User Error: Weak passwords that are easy to guess.

 Protocol Flaws: Errors in the sequence of cryptographic steps (e.g., how the keys
are exchanged).

Example: WhatsApp uses strong AES-256 encryption. If a user leaves their phone unlocked
(a human mistake), the encryption becomes irrelevant because the attacker has direct
access to the decrypted chat history.

⚔️Slide 3: Types of Cryptanalytic Attacks

This slide establishes the information asymmetry between the attacker and the system
being targeted.

Information Known to
Attack Type Explainer/Analogy
Attacker

Minimum: Only the intercepted

Ciphertext- Like intercepting a postcard written in code.
encrypted data and the
only 9 You have no context. Hardest to succeed.
algorithm10.

You intercept a message, and later see the

Ciphertext, algorithm, AND at
Known- user tweet the plaintext ("The weather is
least one plaintext/ciphertext
Plaintext 11
fine!"). This pair helps you deduce patterns
pair12.
or the key.

You feed a known file into a target system's

Attacker can select the input
Chosen- encryption module and get the output.
(plaintext) and get the
Plaintext 13
Very powerful for breaking stream
corresponding ciphertext14.
ciphers.

Attacker can select the Padding Oracle Attack: Attackers modify

Chosen- ciphertext and get the encrypted blocks and observe the tiny
Ciphertext 15
corresponding decrypted system behavior (like an error message) to
plaintext/error message16. deduce information, bit by bit.

Measuring power, time, sound, or

Side-
Attacking the physical process of electromagnetic emissions during
channel
computation, not the data itself. encryption/decryption to reveal the secret
attacks 17
key.

📜 Slide 4: Classical Cryptanalysis

Concept: Linguistic Redundancy

Classical ciphers were weak because they failed to obscure the natural statistical patterns
of the language. In English, the letter 'E' appears $\sim 12.7\%$ of the time.

Cipher Flaw/Attack Deep Dive

Caesar Frequency Preserves letter frequency, only shifts the letters. Easy to break
Cipher Analysis by counting letter occurrences.

Uses a polyalphabetic key (a word) to scramble the frequency.

Vigenère
Kasiski Test The Kasiski test finds repeated ciphertext segments to
Cipher
determine the key length (period).

Playfair Digram Encrypts pairs of letters. Attackers analyze the frequency of

Cipher Frequency common letter pairs (like 'th' or 'er').
🧪 Slide 5: Hands-On Demo: Frequency Analysis

Teaching Strategy

Show students how an apparently random jumble of letters instantly reveals its patterns
when analyzed statistically.

 Demo 1 (CyberChef): Show a short Caesar-encrypted message. Run the "Frequency

Distribution" operation. The resulting chart will visually show one letter dominating,
quickly revealing the key.

 Demo 2 (CrypTool2/online tool): Demonstrate the Kasiski Test concept on a

Vigenère cipher. Show how the tool uses repeated patterns to suggest the correct key
length.

⚙️Slide 6: Modern Cryptanalysis

Core Concept: Attacks on Implementation 18

Modern cryptography assumes the math is safe. The attacks focus on the surrounding
human, software, and hardware environment.

Attack Type Target Focus Real-World Example

User passwords and

Brute-force /
weakly configured Attacking a stolen hash database.
Dictionary 20
keys.

Rainbow tables Unsalted password A Time-Memory Trade-off that pre-calculates

21
hashes (MD5, SHA-1). common hashes.

Meet-in-the- Older ciphers (like Attacker encrypts from the start and decrypts from
Middle (MitM) 2DES) that use the end, looking for a match in the middle to
22
sequential keys. reduce complexity.

Spectre/Meltdown (CPU attacks) or Cloudflare's

Side-channel Hardware timing
2017 timing leak, which revealed data based on
attacks 23 differences.
the key exchange duration.

📚 Slide 7: Brute Force vs Dictionary vs Rule-based

Deep Dive: Efficiency of Attack

This is about working smarter, not harder.

 Brute Force24: The theoretical baseline. Try every single possible character
combination. Impractical for complex passwords.

 Dictionary25: Use common words, names, and phrases. Effective, but limited.
  Rule-based (e.g., Hashcat)26: The most efficient and dangerous method. It applies
intelligent mutation rules based on observed user behavior 27.

Example:

 Dictionary Word: winter

 Rule-based Mutations:

o Append Year: winter2024

o Capitalize: Winter2024

o Leet Speak/Symbols: W1nter2024! (replacing letters with similar-looking

numbers/symbols).

🔑 Slide 8: Hash Cracking & Password Security

Core Concept: The One-Way Function

Hashing is for integrity and verification, not confidentiality. The hash is an irreversible
fingerprint.

 Weak Hashing28: MD5 and SHA-1 are too fast and suffer from collision issues. When
their hashes are stolen, they are instantly compromised.

 Proper Hashing29: bcrypt and Argon2 (Key Derivation Functions - KDFs).

o They are intentionally slow (using a work factor or cost parameter) to

defeat brute force.

o They are resistant to specialized hardware (GPUs/ASICs).

o They are used with a unique salt for every password to defeat Rainbow
Tables.

Live Demo: Show a common password's MD5 hash and how quickly it's found on
CrackStation. Then, mention how a modern hash (bcrypt) would take hundreds of
milliseconds just to compute once, crippling an attacker's speed.

⚖️Slide 9: Ethical Hacking & Responsible Use

The Golden Rule: Authorization 30

Possessing offensive skills carries high legal risk31. The tools are neutral; the permission
determines legality.

 Legal Practice Zones32:

o Your own systems33: (Personal laptops, VMs, servers you own).

o Authorized CTFs34: Competitions with specific, written rules.

 o Isolated Labs35: Virtual machines running a known vulnerable OS (like
Metasploitable).

 Consequence: Highlight the IT Act 2000 penalties36. Accessing a system without

written permission is trespass to a computer system—intent usually doesn't
matter.

🎯 Slide 10: Recap & Preparation for the Gauntlet

Teaching Strategy

End the session with energy, connecting today's theory and analysis to tomorrow's
practical application.

 Recap: We learned why ciphers fail (patterns/human error) and how to test systems
(cracking hashes/passwords).

Forward Look: Tomorrow, students will apply these cryptanalytic skills to break codes and
solve puzzles, proving their defensive understanding through offensive skill.