Quizzes

Every knowledge check, in one place

40 quizzes, 380 questions total — one for every Learn module, Use Case, and Standards body, each with an explanation for every answer. No login, no tracking, just immediate feedback.

Learn modules

The history and purpose of cryptography

Before the math: what cryptography is actually trying to do, and the 2,500-year arms race between codemakers and codebreakers that got us here.

10 questions
The math underneath: modular arithmetic & one-way functions

Every public-key algorithm in this catalog leans on the same idea: a calculation that's easy in one direction and effectively impossible to undo in the other.

10 questions
Symmetric-key cryptography & AES

The same key locks and unlocks the data. Fast, simple in concept, and everywhere — from disk encryption to the bulk of every TLS session.

10 questions
The Data Encryption Standard (DES)

AES's predecessor and the first cipher the world ever standardized. What retired it wasn't a flaw in the design — it was a key that was always too short.

10 questions
Stream ciphers & ChaCha20-Poly1305

Not every symmetric cipher works in fixed blocks. ChaCha20 generates a keystream instead — and paired with Poly1305, it's AES-GCM's fastest rival.

10 questions
RSA & public-key cryptography

Two mathematically linked keys — one public, one private — solve the problem symmetric crypto can't: how do you share a secret with someone you've never met?

10 questions
RSA padding: OAEP, PKCS#1 v1.5, and why raw RSA fails

Textbook RSA is deterministic and malleable. Padding schemes are what actually make RSA encryption and signing safe to use in the real world.

10 questions
Elliptic Curve Cryptography (ECC / ECDSA)

The same public-key guarantees as RSA, with dramatically smaller keys — because the underlying hard problem is different math entirely.

10 questions
Diffie-Hellman key exchange

Two parties agree on a shared secret over a public channel, without ever transmitting the secret itself — the idea that started public-key cryptography.

10 questions
The ElGamal cryptosystem

Diffie-Hellman lets two people agree on a secret together. ElGamal uses that same discrete-log idea to let anyone encrypt to a public key — no live handshake required.

10 questions
Hash functions & digital signatures

One-way fingerprints for data, and the mechanism that proves a message is authentic and untampered — without encrypting anything.

10 questions
Password hashing & key derivation: PBKDF2, bcrypt, scrypt, Argon2

A cryptographic hash is too fast for passwords. KDFs deliberately slow things down — and not all of them do it the same way.

10 questions
X.509 certificates & the PKI trust hierarchy

A certificate is just a signed statement binding a public key to an identity. Here's what's actually inside one, and how revocation works.

10 questions
JSON Web Tokens & API authentication

JWTs put a signed claim in every request header. They're everywhere in modern APIs — and a few well-known implementation mistakes keep recurring.

10 questions
Passkeys & WebAuthn

A passkey is what you get when you replace a password with a public-key challenge-response protocol. It fixes reuse, phishing, and breaches in one move.

10 questions
SSH: key exchange, host keys, and authentication

The protocol behind every remote login and git push combines the same primitives as TLS, arranged slightly differently.

10 questions
TLS in practice: how HTTPS puts it all together

Every padlock icon runs a coordinated handshake combining key exchange, certificates, symmetric encryption, and integrity checks — in under a round trip.

10 questions
End-to-end encrypted messaging: the Signal Protocol

TLS protects data in transit to a server. The Signal Protocol's Double Ratchet goes further — encrypting so not even the server operator can read your messages.

10 questions
Key sizes & security levels: what the numbers mean

128-bit AES, 2048-bit RSA, 256-bit ECC — these numbers aren't comparable at face value. Here's how to actually read them.

10 questions
Random number generation: the primitive everything else depends on

Every key, nonce, and IV in this catalog assumes truly unpredictable randomness. When that assumption breaks, everything built on top breaks with it.

10 questions
Entropy: measuring, estimating, and testing true randomness

Randomness can't just be assumed good or bad — it's measured. This module covers min-entropy, the real NIST test suite for entropy sources, and why a hardware random number generator still needs that testing.

10 questions
Side-channel & timing attacks: when the math is fine but the implementation isn't

A cryptographic algorithm can be mathematically unbreakable and still leak its secret key through how long it takes to run.

10 questions
Cryptography inside blockchains: hashing, Merkle trees, and signatures

Bitcoin and Ethereum don't invent new cryptography — they compose the same primitives in this catalog into a specific, tamper-evident structure.

10 questions
Shamir's Secret Sharing

How do you protect a master key so no single person holds it, yet any k of a trusted group can reconstruct it together? Split it across a polynomial.

10 questions
Why quantum computers break this: Shor's algorithm

The bridge module: why everything above is called "classical" cryptography, and exactly what a future quantum computer would do to it.

10 questions
Harvest now, decrypt later: the risk that's already here

You don't need a working quantum computer today to be at risk today. Anything encrypted now with RSA or ECC can simply be recorded and decrypted later.

10 questions

Use Cases

Envelope encryption: how a KMS actually protects your data

Every cloud KMS — AWS KMS, GCP Cloud KMS, Azure Key Vault, HashiCorp Vault — uses the same pattern to encrypt data without ever moving your master key. Here's why, and how it actually works.

10 questions
Key wrapping and key exchange: moving keys without ever exposing them

Envelope encryption covers wrapping a key with your own KMS. This is about the broader problem: getting a key from one system, person, or organization to another — without it ever existing in the clear outside a trust boundary.

10 questions
PKCS#11: the standard behind every HSM and smart card

Wrapping and unwrapping keys, covered so far, all happens somewhere. PKCS#11 is the standard interface that lets an application talk to that somewhere — an HSM, a smart card, a USB token — without caring which vendor built it.

10 questions
Running a PKI: how a certificate authority actually operates

The X.509 module covers what's inside one certificate and how a chain verifies. This is the other half: how an organization actually runs the CA hierarchy that issues, automates, and eventually retires millions of them.

10 questions
Federated identity: OAuth2, OIDC, and SAML, untangled

"Just use OAuth" conflates three different standards solving three different problems. Here's what each one actually does, how they relate to the JWTs you already know, and where passkeys fit in.

10 questions
PIN blocks: encrypting a 4-digit number like it's a nuclear launch code

How a card PIN is packaged, encrypted at the point of entry, and re-encrypted hop by hop across acquirer, network, and issuer — without ever existing in the clear outside a hardware security module.

5 questions
CVV/CVC: the three digits that never survive an authorization

How the card verification value printed on the back of a card is generated, why the magstripe and card-not-present versions deliberately don't match, and why PCI DSS treats storing it as an absolute rule, not a guideline.

5 questions
EMV chip authentication: the conversation behind every chip transaction

How a chip card and an issuer's host cryptographically prove to each other that they're both genuine, transaction by transaction — using a key that exists nowhere outside that one card and a cryptogram that's never reused.

5 questions
3-D Secure and tokenization: protecting a transaction that never touches a chip

Card-not-present purchases can't rely on a physical chip proving anything — so 3-D Secure authenticates the cardholder instead, and tokenization makes sure the real card number is never the thing worth stealing in the first place.

5 questions

Standards