Cryptography

سلسلة من الدروس عن طرق التشفير والرياضيات الخاصة بها

Symmetric Cipher Asymmetric Cipher Public Key Cryptography Stream Cipher

[1] Mathematics for Cryptography

01) Arithmetic Operations Precedence
02) Numbers Theory Introduction
03) Fermat Primality Test
04) Rabin-Miller Primality Test
05) GCD For Simple Numbers
06) Euclidean Algorithm to find GCD
07) Modular Arithmetic
08) Extended Euclidean Algorithm (Finding the Multiplicative Inverse)
09) Modular Arithmetic Equivelance Classes
10) Modular Arithmetic Fast Powering Algorithm

Back to Lectures