Skip to content
All courses
CompleteSecurity, Fourth year

Cryptography

Classical, symmetric and asymmetric encryption, hash functions, and the exam hints solved step by step.

What the course covers

13 lectures, 3 revision sessions, 14 hours

  • Classical ciphers: substitution, transposition, Caesar, Vigenère, Playfair and Hill
  • Modular arithmetic, the extended Euclidean algorithm and modular inverses
  • Modern symmetric cipher principles: S-boxes, P-boxes and the Feistel structure
  • DES
  • AES
  • Modes of operation: ECB, CBC, CFB, OFB and CTR
  • Mathematics of asymmetric cryptography: primes, Fermat's and Euler's theorems
  • RSA, ElGamal and an introduction to elliptic curve cryptography
  • Hash functions, message integrity and MACs

What you will be able to do

  • Encrypt and decrypt messages with the classical ciphers by hand and break simple ciphers with frequency analysis.
  • Compute modular inverses and modular exponentiation using the extended Euclidean algorithm and Euler's theorem.
  • Generate RSA keys and perform encryption and decryption on small numbers, as in the exam.
  • Explain one round of DES or AES, compare the modes of operation and pick the right one for a scenario.

Free lectures from this course

Complete lectures from inside the courses, with no sign-up and no limits, so you know the style and depth before paying a single riyal.

Chapters 6 and 7, 108 min

Recorded sessions

16 sessions, 14 hours

In teaching order. All of them open to you on enrollment until the end of the semester.

  1. Chapter 372 min
  2. Chapter 3, part 226 min
  3. Chapters 4 and 5, part 152 min
  4. Chapters 4 and 5, part 273 min
  5. Chapters 4 and 5, part 333 min
  6. Chapters 6 and 7108 min
  7. Chapters 6 and 7, part 247 min
  8. Chapters 8 and 953 min
  9. Quick hints discussionRevision21 min
  10. Finding the modular inverseRevision5 min
  11. Hash functions (lectures 8 and 9)54 min
  12. Chapter 9, final65 min
  13. Chapter 10, part 154 min
  14. Chapter 10, part 238 min
  15. Chapter 11, final81 min
  16. Hints walkthrough, finalRevision50 min

Prerequisites

  • Discrete mathematics and modular arithmetic basics

About this course

Sixteen sessions covering the cryptography syllabus from chapter 3 to chapter 11, with dedicated sessions for working through the hints and the arithmetic, such as finding modular inverses.

Before you ask

Questions people ask

How do I pay?

Payment is by bank transfer for now. I send the account details in the chat; after the transfer you send the receipt and your email address.

How do I watch after paying, and for how long?

You receive an invitation by email and watch every session of the course through Loom on any device. The subscription is valid until the end of the semester you enroll in, about 5 months of access to every session, and every new session recorded during the semester is added at no extra cost.

When is access activated?

I add you to the course sessions in Loom, usually the same day.

What about courses still being recorded?

This course is being recorded session by session during the semester and will be complete by its end, once the whole syllabus is covered. The price shown is the full course price and will not rise when it is complete: you pay once, and every new session reaches you at no extra cost.

Are there refunds?

Because full trial lectures are available before you buy, there are no refunds once access is activated.

Is there a certificate?

No certificate is issued. These are recorded explanations of university courses, not accredited training programs.

Cryptography
1,200
Enroll on WhatsApp