Mastering Fermat's Little Theorem for Modular Exponentiation 🔐

Network Security : LEARN HOW TO SOLVE NUMERICALS ON MODULAR EXPONENTIATION USING FERMATS LITTLE THEOREM.

#NetworkSecurity #Cryptography #NetworkSecurity #FermatsLittleTheorem # FermatsTheorem #ModularExponentiation

This video provides a step to step method to solve the following numerical on modular exponentiation using Fermat's Little Theorem.
1) 3^4 MOD 5
2) 3^5 MOD 5
3) 7^18 MOD 19
4) 7^19 MOD19
5) 10^4 MOD 5
6) 10^5 MOD 5
7) 3^10 MOD 11
8) 3^11 MOD 11
9) 2^7 MOD 7
----------------------------------------------------------------------------------------
Timeline
00:00 - Introduction
01:23 - To compute 3^4 mod 5 using traditional method of squaring
03: 40 - To compute 3^4 mod 5 using Fermat's Theorem
05:54 - To compute 3^5 mod 5 using alternate Fermat's Theorem
06:48 - To compute 7^18 mod 19 using Fermat's Theorem
09:45 - To compute 7^19 mod 19 using Alternate Fermat's Theorem
12:37 - To compute 3^10 mod 11 using Fermat's Theorem
14:10 - To compute 3^11 mod 11 using alternate Fermat's Theorem
14:21 - To compute 2^7 mod 7 using alternate Fermat's Theorem