Number Theory for Cryptography
Number Theory for Cryptography
Checking for Primeness
Euler’s Phi-Function
Euler’s phi-function, 𝜑(𝑛), which is sometimes called the Euler’s totient function plays a very important role in cryptography.
general formula to compute 𝜑(𝑛)
Fermat’s theorem
Euler’s theorem generalizes Fermat’s theorem to the case where the modulus is not prime.
if 𝑛 is a positive integer and 𝑎, 𝑛 are coprime, then 𝑎^(𝜑(𝑛)) ≡ 1 mod 𝑛 where 𝜑(𝑛) is the Euler's totient function.
Multiplicative Inverses
Prime Numbers
Deterministic Algorithms
Probabilistic Algorithms
Recommended Primality Test
If you like IQPOP please SHARE, LIKE COMMENT, AND SUBSCRIBE to this CHANNEL.
The lecture is recorded to help you. For new video Kindly recommend topics in the comment box.