Skip to main content
Challenges

Did you catch the math?

Ten short puzzles drawn from the halls and the atlas. Pick one answer per challenge. Wrong picks reveal the explanation; right picks unlock the badge.

0 / 10 solved
Challenge 1

Which handshake survives?

A CRQC arrives and recovers the session keys from every handshake whose key exchange relies solely on classical math. Which of these TLS 1.3 configurations is still safe?

Challenge 2

Which certificate is PQC-signed?

You inspect four certificates' signature algorithm OIDs. Which one is post-quantum?

Challenge 3

Match algorithm to FIPS number

Which FIPS standard publishes SLH-DSA (SPHINCS+)?

Challenge 4

Spot the broken family

NIST diversified across five mathematical families. One of them was broken on a desktop in roughly an hour back in 2022. Which?

Challenge 5

Verdict by Mosca's inequality

A medical record must stay confidential for X = 30 years. Your hospital's migration plan needs Y = 5 years. Best CRQC estimate is Z = 15 years. Verdict?

Challenge 6

Conservative hash-based backup

If a future cryptanalytic result breaks the lattice family entirely, which standardized signature scheme keeps working — built only from hash primitives?

Challenge 7

X-Wing — which ML-KEM tier?

The IANA-registered X-Wing hybrid (group 0x11EC) used by Chrome and Cloudflare combines X25519 with which ML-KEM variant?

Challenge 8

CNSA 2.0 mandate

For U.S. national-security systems under CNSA 2.0, which signature algorithm and tier is mandated?

Challenge 9

Collapsing qubit estimate

In May 2025 Craig Gidney published a result that dramatically reduced the resource estimate for breaking RSA-2048. To roughly what number of noisy qubits?

Challenge 10

What lands in 2030?

Multiple regulators converge on 2030. For U.S. federal systems under NSM-10 and EO 14144, what specifically must be done by January 2030?