Erudex sealErudex
Software & AI Engineering
All levels

Modern Cryptography

Academic (University) preparation with worked examples, written practice and independent learning assessments.

Independent university-level study of Modern Cryptography. This original curriculum draws on public academic subject descriptions; it is not an official faculty syllabus, university credit, accreditation or an Ivy League qualification. Topics covered: Security definitions; Adversary models; Computational hardness; Negligible probability. Pseudorandom generators; Pseudorandom functions; Hybrid arguments; Semantic security. Block-cipher modes; Chosen-plaintext security; Authenticated encryption; Nonce discipline. One-way functions; Collision resistance; Message authentication; Hash constructions. Public-key encryption; Diffie-Hellman; RSA assumptions; Chosen-ciphertext security. Digital signatures; Unforgeability; Certificates; Key exchange. Zero-knowledge proofs; Commitments; Secure computation; Simulation arguments. Post-quantum assumptions; Lattice constructions; Protocol composition; Security proof project. Projects use safe simulations, public datasets or textual analysis; specialist subject review is required. Includes lessons, supplementary YouTube tutorials, practical exercises, quizzes and free/paid practice tests. Erudex is independent, not affiliated with the source institution or awarding body. Its 80% learning checks are not official grades or university credit. Content requires qualified subject review before use as a complete teaching programme.

32h Certificate available
InternationalAcademic (University)Independent preparation

Curriculum

One complete track with its own final exam and certificate.

Independent university-level study of Modern Cryptography. This original curriculum draws on public academic subject descriptions; it is not an official faculty syllabus, university credit, accreditation or an Ivy League qualification. Topics covered: Security definitions; Adversary models; Computational hardness; Negligible probability. Pseudorandom generators; Pseudorandom functions; Hybrid arguments; Semantic security. Block-cipher modes; Chosen-plaintext security; Authenticated encryption; Nonce discipline. One-way functions; Collision resistance; Message authentication; Hash constructions. Public-key encryption; Diffie-Hellman; RSA assumptions; Chosen-ciphertext security. Digital signatures; Unforgeability; Certificates; Key exchange. Zero-knowledge proofs; Commitments; Secure computation; Simulation arguments. Post-quantum assumptions; Lattice constructions; Protocol composition; Security proof project. Projects use safe simulations, public datasets or textual analysis; specialist subject review is required.

Security definitions; Adversary models; Computational hardness; Negligible probability

  • Foundations of Provable Security and Formal Security Definitions Lab60 min
  • Adversary Models, Oracle Access, and Security Paradigms Lab60 min
  • Computational Hardness Assumptions and Reductionist Proofs Lab60 min
  • Asymptotic Security, Negligible Probability, and Concrete Bounds Lab60 min

Careers this prepares you for

    How you study

    Every lesson pairs an in-depth video with written notes, key takeaways, a hands-on lab, exercises and a quiz. Work at your own pace, then sit the final examination for your Erudex certificate.