โš ๏ธ You Left the Quiz

Switching tabs, apps, or exiting fullscreen during the assessment is logged automatically.

1

This count will appear on your completion certificate. Click below to return to fullscreen and continue where you left off.

โ† Back to ITF Labs
๐Ÿ” Encryption & Key Exchange
ITF Lab ยท Cybersecurity ยท Wildcats Tech
1. Caesar Cipher 2. Key Exchange 3. Public/Private Keys 4. Assessment

Before You Begin

Enter your name exactly as you'd like it to appear on your completion certificate.

๐ŸŽฏ Lab Overview

This lab walks you through the history of encryption โ€” from a 2,000-year-old cipher to the same math that secures your bank's website today. There are three hands-on activities, each unlocking the next:

  1. Caesar Cipher โ€” encode/decode messages, then try to crack one
  2. Key Exchange (Diffie-Hellman) โ€” simulate two people agreeing on a secret key in full view of an eavesdropper
  3. Public/Private Keys (RSA-lite) โ€” encrypt and decrypt using two different keys

Once all three are complete, a 20-question randomized assessment unlocks. That part runs in fullscreen โ€” leaving it is detected and logged on your certificate.

๐Ÿ”ค Activity 1: The Caesar Cipher

The Caesar cipher shifts every letter in a message forward by a fixed number of positions in the alphabet. A shift of 3 turns A into D, B into E, and so on. It's one of the oldest known ciphers โ€” Julius Caesar reportedly used it to send military orders.

Try It Yourself

Result will appear here

๐Ÿ•ต๏ธ Crack This Code

Below is a message encrypted with a Caesar cipher using a secret shift you don't know. Since there are only 26 possible shifts, you can simply try all of them โ€” this is called a brute-force attack.

๐Ÿ”’ Crack the code above to unlock Activity 2

๐Ÿค Activity 2: The Handshake (Diffie-Hellman Key Exchange)

Symmetric encryption (like the Caesar cipher) uses one key to both encrypt and decrypt. The problem: how do two people agree on that key over a connection someone else might be listening to?

Diffie-Hellman solves this. Two publicly known numbers โ€” a prime p and a base g โ€” are shared openly. Each person picks a secret number they never share, does some math to create a public value, and exchanges that public value. Both sides can then calculate the exact same shared secret โ€” but an eavesdropper watching everything public still can't feasibly figure it out.

Public prime (p) =    Public base (g) =

You (Alice)

Bob (Simulated)

Bob's secret number is hidden โ€” just like a real eavesdropper, you never see it, only his public value.

๐Ÿ”’ Complete the handshake above to unlock Activity 3

๐Ÿ”‘ Activity 3: Public & Private Keys

Diffie-Hellman solves key agreement. But there's another approach entirely: asymmetric encryption, where two different keys are used โ€” a public key anyone can see, and a private key only you have. Anyone can encrypt a message with your public key, but only your private key can decrypt it.

This tool uses tiny numbers so the math is visible โ€” real systems like RSA use numbers hundreds of digits long, which is what actually makes them secure.

Prime p =   Prime q =   n = p ร— q =   ฯ†(n) =

๐Ÿ”’ Complete the encryption demo and quick check to unlock the assessment

๐Ÿ“ Final Assessment

You've unlocked the assessment. It pulls 20 randomly selected questions from a larger bank, in random order, with answer choices shuffled โ€” covering everything from the three activities.

Each question requires a correct answer before you move on โ€” wrong answers just give you a hint and let you try again, no penalty.

โš ๏ธ Fullscreen Required: This part runs in fullscreen mode. If you switch tabs, switch apps, or exit fullscreen, it will be detected and logged. You can resume, but the violation count will appear on your final certificate.

โœ… Lab Complete!

Nice work โ€” you've finished the Encryption & Key Exchange lab.

Student
Date
Questions
First-Try Accuracy
Focus Losses

Your verification code:

------

This code is generated from your name, date, and results. It changes if any of those change.