[CompNetSec] - 02 - Introduction to Number Theory (Part 1)

* Intro (time: 0:00)
* Divisibility (slide(s): 3-7, time: 0:38)
- Division Algorithm (slide(s): 5, time: 7:39)
- Quotient Note (slide(s): 6, time: 9:02)
* The Euclidean algorithm (slide(s): 8-11, time: 11:27)
- Greatest Common Divisor (slide(s): 9, time: 12:36)
- Relative Prime (slide(s): 10, time: 17:37)
- Example (slide(s): 11, time: 18:49)
* Modular arithmetic (slide(s): 12-20, time: 22:23)
- The modulus (slide(s): 12, time: 23:00)
- Properties of congruences (slide(s): 14-15, time: 27:40)
- Modular arithmetic operations (slide(s): 12, 13, 15-19, time: 31:48)
- Additive and Multiplicative Inverse (slide(s): 19, time: 41:24)
- Properties of Modular Arithmetic for Integers (slide(s): 20, time: 42:02)
- Euclidean algorithm revisited (slide(s): 11, time: 44:18)
- The extended Euclidean algorithm (slide(s): 21-22, time: 44:56)
- Example (slide(s): 22, time: 46:34)
- Why egcd? (slide(s): 18, 22, time: 52:14)
ANNOTATION BY: an SSP CCE 2021 alumnus who prefered to be anonymous!
--Computer and Network Security