Discrete Mathematics

Learn Cryptography

From Caesar ciphers to lattices: Kerckhoffs's principle, the one-time pad and perfect secrecy, symmetric ciphers, Diffie-Hellman key exchange, RSA, elliptic-curve cryptography, hash functions, digital signatures, zero-knowledge proofs, and the post-quantum threat from Shor's algorithm.

Free to start · adaptive placement finds your level · reviews timed to your own forgetting.

What you'll learn

30 lessons in Cryptography

Classical ciphers & Kerckhoffs's principleThe one-time pad & perfect secrecySymmetric-key cryptographyDiffie–Hellman key exchangeThe RSA cryptosystemElliptic-curve cryptographyCryptographic hash functionsDigital signaturesZero-knowledge proofsPost-quantum cryptographyMessage authentication & AEADKey management & forward secrecyRandomness & entropySecret sharingCommitment schemesSide channels & constant-time codeHomomorphic encryptionPassword hashing & key derivationProvable security & reductionsSecurity levels & the bit budgetModes of operation & the padding oracleGeneric discrete-log attacksIndex calculus & smoothnessCurve order, cofactor & validationLattices, LWE & decryption failureMerkle trees & transparency logsOblivious transfer & garbled circuitsThreshold signaturesAuthenticated key exchange & ratchetingFault attacks & RSA-CRT
How Erudia teaches

Built to be understood — and remembered.

Every idea is taught with motivation and a worked example before the drills, and an FSRS spaced-repetition engine schedules each review for the day its model predicts you would forget it. A short placement check finds what you already know, so you start Cryptography exactly where it's useful.

Related Discrete Mathematics subjects