Multiplicative Inverse
ฝัง
- เผยแพร่เมื่อ 24 ก.ค. 2024
- Network Security: Multiplicative Inverse
Topics discussed:
1) Explanation on the basics of Multiplicative Inverse for a given number.
2) Explanation on the basics of Multiplicative Inverse for a given number under modulus.
3) Finding the Multiplicative Inverse for smaller numbers manually.
4) Difference between the Multiplicative Inverse of normal numbers and numbers with modulus.
5) Explanation on how to determine whether there exists a Multiplicative Inverse or not.
6) Introduction to Extended Euclidean Algorithm to find the Multiplicative Inverse.
Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
Contribute: www.nesoacademy.org/donate
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy.org/recommend...
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#NetworkSecurityByNeso #Cryptography #NetworkSecurity #MultiplicativeInverse
Everytime i search for math related lecture in English i always have a thought my English must be poor that's why i am not understanding but when i see your lecture my all doubts gets cleared.
❤
Great explanation! Thanks!
This really helped out
Wonderful Explanation 🔥🔥
Chill explanation
Thanks 🙏🏻
Thank you!!! I couldn't wrap my brain around this concept and you explain it so well!!!
Thank you so much!
You are the best!!! ❤️
man you are the BEST EVER!
Thanks for your efforts ♥
Great, Explanation
Great video, thanks!! I was sitting here scratching my head on why my crypto book kept telling me the multiplicative inverse of 3 is 9 and not 1/3 until i found your video. Mod, gotta remember that mod
I can not wait for the next lesson.
Thank you! Finally I understood how calculate multip.inverse
Thank you sir! You slayed this.
thank you sir best explaining
thanks! But could you tell please, why do we use it?
Great video
Thank you
thanks man
Sir I have an assignment ,can you help me?
Nice one!
Thanks for the subtitles.
ty, this is EXACTLY what I didn't understand about these things. So from what you said, a relative prime will never be two even numbers, but will always be either even/odd or odd/odd. Clearly, sometimes even those won't work, but we will never have two even numbers which are relatively prime.
Your videos have been very helpful, much appreciated! 1 issue though, I believe [ a mod b ] where a is less than b is equal to a. (ex. 2 mod 5 = 2, because 2 is less than 5 and therefore the remainder). You mentioned 2 mod 5 = -3, so you then perform 2 x 3 = 6 then 6 mod 5 = 1 which is different from 2 mod 5 being equal to 2.
if you subtract 5 from 2 you get remainder as -3 as 2-5*1 is -3 it's on the other side of positive modulus...
simple explanation
you are the best
Can there be more than 1 multiplicative inverse?
Like for 3(mod 5) you said multi inverse is 2.
Even 7 can be it's inverse right, because 7*3=21 and 21 mod 5 = 1.
for small numbers we can find it out easily what about for large numbers how to find can you give me some tips for that
When you say 2 into 4 it means division. When referring to multiplication you should use the word 'times' instead. I was confused through certain parts of the video. Great video though; I now understand.
Thank you so much sir . I watched many videos about modular inverse, but didnt understand. I understood very easily from your video. Thank you so much
You mentioned in a few parts about -1 as remainder. Would you mind explaining how come there can be negative remainders? Shouldn’t remainders only always be positive?
when you have x=-1 mod n that is same as x=n-1 mod n
even if we get -ve remainder it is simply = to the inverse of it.
but how do we calculate it when we have large numbers?
he said that at the end of the video. by extended euclidean algorithm
when can we expect a video of DES Algorithm?
hapo safi nimeelewa sana mkuu
4 * 4 = 16 here incase if we divided 16/5 thn the reminder would be 3.2 not the 1
and since the mod is 5 we can do this by 4*1 = 4 by this we get reminder as 1
see properly reminder is 1 ur being mistaken b/w reminder and quotient
For large numbers, use :
a^-1 mod p = a^(p-2) mod p, where p is prime.
Is this a theorem or just a simple formula?
@@sayharshu this is Fermat's Little Theorem
@@Mehraj_IITKGP thankyou brotha :)
Oh, I get it now. For any of you struggling, its just the notation that is "unintuitive". if you see 1 mod 5, its not literally 1 mod 5, its 1 (mod 5). So 1 "when you mod by 5".
Instead of
3*n = 1 (mod 5)
i think the simplest way of understanding it is putitng it in "normal" notation.
(3*n) mod 5 = 1
6 mod 5 = 1, so n=2
thanks sir i did not uderstand anything
I know two ways for finding inverse
Euler's theorem
extended Euclidean algorithm
❤️❤️❤️
Bro what is 24 x ? = 1 mod 26
Gcd (24,26)=\=1 inverse will not exist in this case
next time write it out. i got it when I went back
😮
4 is not prime 🙄, how is it relatively prime of 5?
Relatively prime and prime are different. Two numbers are relatively prime if they don't have a common factor. 4 and 5 don't have a common factor other than 1 so they r called relatively prime
Thakns lot
Common factor?
@@sakthi_chesz GCD
i can barely understand you.
Not best better explain matalb tatti
begairat !!!
Pajeets, man
based
You are just brute forcing to find inverse. That is not how we do mathematics
Then how is it done correctly
whos here for cs70🤣🤣