Inverse Using Fermat's Little Theorem | Modulo Arithmatic | Cryptography And Network Security |

[@dylanleroy5829]

But how do you factorize the power??? He didn't even attempt to explain how he broke them up

[@sheildchannel]

Sir factorization vedeo pls

[@Luna-fu7ix]

Thanks for such useful Video sir

[@MyPets23s]

How can we solve 7814^-1 mod 17449

[@mo-ry5je]

thank you

[@thetruereality2]

Are you saying that multiplicative inverse of 8 is 15?

[@priyasalam5356]

Everything goes well untill when you write 8^15 as 8^7 and 8^8..How you get this by factorisation?

[@QuickTrixx]

If the power is large divided it into the smaller number and then individually mod with given a number to solve easily.

[@dmytrogitarov8584]

Nice job! Thanks

[@LetzzRockk]

❤❤❤

[@aciacon4199]

square and multiply method for finding modulus for exponent will be more time consuming than this??

[@QuickTrixx]

Which ever method of solving you feel comfortable you can do that Just make sure u don't keep calculating some many times

[@PankajYadav-nz4gn]

Sir,how to solve if p is not a prime number??

[@QuickTrixx]

Apply euler theorem :) i have uploaded video of it

[@QuickTrixx]

apply inverse using euler theorem -- kzbin.info/www/bejne/o4bafYxmpZp8hqc

[@rickbawer1567]

What do you do if you have (mod NOT PRIME NUMBER). Is the only way to use Euklides algorithm or can you in some way apply Eulers or Fermats theorem as well?

[@nournote]

If p is not prime the existence of the inverse is not guarateed.

[@PriyankaPlucky2810]

how u did the factorization???

[@QuickTrixx]

If power large divided it into smaller number and then individually mod with give number Example - 5^¹³ mod 7 Divide power 5^³ * 5^² * 5^² *5^² *5^² * 5^² mod 7 5^³ * (5^²)^5 mod 7 5^³ * (5^5)^² mod 7 (5^³)^4 * 5 mod 7 This are ways you can divide follow which u feel comfortable And then individually find mod Select second way 5^3 mod 7 = 6 5^2 mod 7 = 3 6 * 3^5 mod 7 6* 5 mod 7 30 mod 7 = 2

[@PriyankaPlucky2810]

that's pretty cool! thanks!

[@atheenajp8228]

How to find answer if p is not a prime number? Please explain.

[@QuickTrixx]

apply inverse using euler theorem -- kzbin.info/www/bejne/o4bafYxmpZp8hqc

[@mohammadmonish859]

i am looking for proper method for solving 8^15 mod 17 . Not the trick version

[@gourikalahal9148]

wt sir has done isn't a trick its called fermat little theorem

[@virtualbro8571]

Thank you!!!

[@keshavpagar]

15 inverse mod 2 kitna hota hai Sir ?

[@yogitanegi2456]

You missed 168 It should've been 179^10 x 168 x 132 mod 211

[@yogitanegi2456]

@7:38

[@QuickTrixx]

i multiplied with 22^4*168 mod211

[@htconexify]

I thought it was p-1 not 2

[@calvin32897]

ikr

[@DeathSmoke10000]

It is p - 2 because he skipped the step where you multiply by a^-1 a^(p-1) = 1 mod p, so for the first example you get 8^(17-1) mod 17 then you have to multiply by 8^-1 because 8^(-1) mod 17 = 8^(-1) * 8^16 mod 17 which is where the a^(p-2) comes from