Free Course Image Modern Cryptography for Beginners: Encryption, Hashing, Signatures and Secure Computation

Free online courseModern Cryptography for Beginners: Encryption, Hashing, Signatures and Secure Computation

Duration of the online course: 24 hours and 7 minutes

New

Build real cryptography skills with a free online course on encryption, hashing, signatures, TLS and secure computation—learn how modern security is proven.

In this free course, learn about

  • Cryptography goals, threat models, and why adversaries are central to security definitions
  • TLS secure channels: authenticated key exchange to establish shared keys and authenticate peers
  • Idealized protocols (coin flipping, commitments) and properties like hiding vs binding/fairness
  • Block ciphers (DES/AES), permutations, and key-recovery security games incl. TKR/KR/EKS
  • 2DES meet-in-the-middle weakness; motivation for 3DES and modern ciphers like AES
  • PRFs and distinguishing experiments; birthday attacks and limits of block ciphers as PRFs
  • Symmetric encryption modes and IND-CPA: why ECB/determinism fails; CTR/CBC security nuances
  • Hash functions and collision resistance games; what the adversary learns and must output
  • MACs and UFCMA security; authenticated encryption and correct generic composition (EtM)
  • Number theory basics for DH/RSA; shared DH key computation and common RSA exponent choices
  • Public-key encryption notions incl. IND-CCA and random oracle model query consistency
  • Digital signatures (incl. Schnorr) and why prime-order groups matter in key-extraction proofs
  • PKI/certificates purpose; session key exchange needs authentication vs active attackers
  • Advanced primitives: IBE, homomorphic limits, secret sharing, and secure MPC (2PC/MPC)

Course Description

Modern systems rely on cryptography every time you log in, send a message, pay online, or establish a secure connection. This course gives beginners a clear path into modern cryptography by focusing on the ideas that actually drive security in practice: rigorous threat models, precise definitions, and the reasoning that links an algorithm to the protection it promises. Instead of treating crypto as magic, you learn how to think like a security engineer and how to measure what an attacker can and cannot do.

You start with the purpose of cryptography and why the notion of an adversary sits at the center of everything. With that mindset, the course connects real-world secure channels like TLS to their essential building blocks, explaining why key exchange must be authenticated and what can go wrong when it is not. Through simple motivating stories, you develop intuition for protocol design, including fairness and bias prevention, before moving into the core primitives that power modern security.

From there, you build a practical foundation in symmetric cryptography: block ciphers, why standards like DES led to AES, and how security is defined through games such as key recovery and pseudorandomness. You see why shortcuts like Double DES fail against classic attacks, and how birthday-style effects shape real security limits. With that groundwork, you learn encryption modes and what it really means to be secure against chosen-plaintext attacks, understanding why deterministic encryption leaks patterns and how modern modes prevent it.

The course then expands your toolbox with hash functions, message authentication, and authenticated encryption, emphasizing how privacy and integrity must work together. You move into the number theory behind public-key cryptography, then study RSA and Diffie–Hellman through the lens of formal security goals, including why chosen-ciphertext security requires carefully restricting decryption access. Digital signatures and Schnorr-style reasoning add authenticity and non-repudiation concepts, and the course ties them to real deployments with public-key infrastructure and certificates.

Finally, you explore advanced but increasingly relevant ideas: identity-based encryption, commitment schemes, homomorphic encryption limits, and secure computation from two-party to multi-party settings using secret sharing. By the end, you will be able to read crypto discussions with confidence, understand why protocols are constructed the way they are, and make better security decisions in engineering and cybersecurity contexts.

Course content

  • Video class: Introduction: What is Cryptography? 30m
  • Exercise: In modern cryptography, why is an "adversary" considered a central concept?
  • Video class: Introduction: Secure channels and TLS 29m
  • Exercise: In a typical TLS secure channel, what is the main role of the authenticated key exchange phase?
  • Video class: Introduction: The divorce 21m
  • Exercise: In the safe-based fair coin-flipping protocol, which pair of properties must the safe satisfy to prevent either party from biasing the outcome?
  • Video class: Introduction: Cryptographic Lego 39m
  • Video class: Block Ciphers and KR Security: What is a block cipher, and DES 47m
  • Exercise: Which condition is required for a function family E to be a block cipher?
  • Video class: Block Ciphers and KR Security: TKR and KR Security, EKS, Security of DES 1h06m
  • Exercise: In the consistent key recovery (KR) game for a family of functions, when does the adversary win at finalize?
  • Video class: Block Ciphers and KR Security: 2DES, Meet-in-Middle-Attack, 3DES, AES 47m
  • Exercise: Why is Double DES (2DES) not effectively much more secure than DES against key-recovery attacks?
  • Video class: Pseudorandom Functions: Definition and example 35m
  • Exercise: In the PRF distinguishing experiment, what does a distinguisher try to do by querying the oracle?
  • Video class: Pseudo random functions: Birthday attacks, PRF implies KR 55m
  • Exercise: Why does the birthday attack give a generic distinguisher against viewing a block cipher as a PRF?
  • Video class: Symmetric Encryption: Modes of Operation and IND-CPA 57m
  • Exercise: Why is deterministic encryption (like ECB with a fixed key) insecure under IND-CPA?
  • Video class: Symmetric Encryption: IND-CPA security of CTR$ and CBC$ 1h18m
  • Exercise: In counter mode, what key factor enables a birthday-style IND-CPA attack that can reveal whether two plaintext blocks are equal?
  • Video class: Hash Functions 1h30m
  • Exercise: In the collision-resistance game for a hash function family, what information is the adversary given at initialization?
  • Video class: Message Authentication 1h31m
  • Exercise: In the UFCMA security game for a message authentication code (MAC), what must be true for the adversary to win?
  • Video class: Authenticated Encryption 1h04m
  • Exercise: Which generic composition method correctly achieves authenticated encryption by preserving privacy (IND-CPA) and integrity of ciphertext (INT-CTXT)?
  • Video class: Computational Number Theory: Part 1 1h32m
  • Exercise: In the classic Diffie–Hellman key exchange, what value do both parties end up computing as the shared key?
  • Video class: Computational Number Theory: Part 2 56m
  • Exercise: Why are RSA encryption exponents like 3, 17, or 65537 commonly used in practice?
  • Video class: Public-key Encryption: Part 1 1h31m
  • Exercise: In IND-CCA security for public-key encryption, why must the decryption oracle refuse to decrypt certain ciphertexts?
  • Video class: Public-Key Encryption: Part 2 41m
  • Exercise: In the random oracle model, how is a hash query H(x) answered to ensure consistency across repeated queries?
  • Video class: Digital Signatures: Part 1 1h06m
  • Video class: Digital Signatures: Part 2 24m
  • Exercise: In Schnorr signatures, why is it important that the group order m is prime in the security reduction that extracts the signing key from two forgeries?
  • Video class: Public-Key Infrastructure and Certificates 28m
  • Exercise: What is the main purpose of a certificate in a public key infrastructure (PKI)?
  • Video class: Session Key Exchange 59m
  • Exercise: Why is basic Diffie–Hellman key exchange alone insufficient for session key exchange against active attackers?
  • Video class: Identity-based Encryption 31m
  • Exercise: In identity-based encryption (IBE), what enables a sender to encrypt to a recipient without obtaining a certificate or public key for that recipient?
  • Video class: Commitment schemes 36m
  • Exercise: In a commitment scheme, what does the binding property guarantee?
  • Video class: Homomorphic encryption 39m
  • Exercise: Why can’t homomorphic encryption schemes generally achieve IND-CCA security when the function class is non-trivial?
  • Video class: Two-party secure computation 39m
  • Exercise: In the semi-honest (honest-but-curious) setting for secure two-party computation, what is the adversary allowed to do?
  • Video class: Secret sharing 26m
  • Video class: Multi-party secure computation 56m
  • Exercise: In the private-sum MPC protocol using additive secret sharing, what does each party broadcast after receiving shares from all others?

This free course includes:

24 hours and 7 minutes of online video course

Digital certificate of course completion (Free)

Exercises to train your knowledge

100% free, from content to certificate

Ready to get started?Download the app and get started today.

Install the app now

to access the course
Icon representing technology and business courses

Over 5,000 free courses

Programming, English, Digital Marketing and much more! Learn whatever you want, for free.

Calendar icon with target representing study planning

Study plan with AI

Our app's Artificial Intelligence can create a study schedule for the course you choose.

Professional icon representing career and business

From zero to professional success

Improve your resume with our free Certificate and then use our Artificial Intelligence to find your dream job.

You can also use the QR Code or the links below.

QR Code - Download Cursa - Online Courses

More free courses at Cyber Security

Free Ebook + Audiobooks! Learn by listening or reading!

Download the App now to have access to + 5000 free courses, exercises, certificates and lots of content without paying anything!

  • 100% free online courses from start to finish

    Thousands of online courses in video, ebooks and audiobooks.

  • More than 60 thousand free exercises

    To test your knowledge during online courses

  • Valid free Digital Certificate with QR Code

    Generated directly from your cell phone's photo gallery and sent to your email

Cursa app on the ebook screen, the video course screen and the course exercises screen, plus the course completion certificate