Thank you for explaining it so well. I hate it when some other mathematicians just show off by being cryptic, its so frustrating. Your tutorial was a tiny tad slower but made it so much easier to follow and learn. Thanks.

@nahiyanalamgir7056

Жыл бұрын

The thing is that mathematicians use symbolic representations and formulas to summarize stuff in a compact way - but that's terrible for explanation. They should refrain from doing that and instead explain things in a human-friendly way!

@logisec

Жыл бұрын

@@nahiyanalamgir7056 Suffering from this right now in my Cryptography class, absolutely soul-sucking explanations in this class

This was amazing. Way better step by step explanation than my professor. THANK YOU!!

Excellent video clearly demonstrating how to calculate the inverse of a number(mod n). Very grateful for this video!

doing Bsc mathematics and computer science in pure maths section (number theory).... this tutorial has really really improved me.... i have not only understood linear congruence but also cryptology... nice and God bless you

Thank you so much! I feel confident doing these kinds of problems now!

Been searching all night for this to learn chinese remainder theorem for tomorrows network security exam. This one is a LIFESAVER

great video!!!!! You explain it in a structured way which is essential for a topic as such. Thanks!

Absolutely amazing tutorial! Preparing for my exam, I couldn't find a good explanation anywhere! You really saved my bacon!

Thanks you very much sir, wish you continues success

This makes sense now! I decrypted an affine cipher, but afterwards, I couldn’t figure out how I got -5 as the inverse of 5 or how it worked. After watching this video, I worked it out and got -5 again. Apparently, I’m just the type of person to use actual math successfully by accident.

Thank You so much! I spent an hour with my teacher today and I think now I finally got the idea:)

Thank you so much for making this understandable and easy to follow. Life saver!!

Can I just say thank you on behalf of everyone at QMUL taking the Algorithms and Complexity module. This has really come in useful with trying to understand RSA encryption!

@mathhacker4764

6 ай бұрын

Same, had to learn this topic to understand RSA encryption!

@kingkevthebest3114

Ай бұрын

man rsa encryption is 8th grade math

Thank you so much for this! I have a discrete final coming up and it's the videos on niche topics like this that are really getting me through. You teach it so well too, thank you so much for putting your effort and time into videos like these.

Thanks so much THIS IS EXACTLY WHAT WAS MISSING IN OTHER VIDEOS MUCH APPRECIATION!!!!

The best explanation for modular multiplicative inverse.. Thanks much!

This really helped a lot. Feeling much more prepared for my exam now

THANK-YOU!!! So intuitive when shown this way. My proff skipped a bunch of steps and it went right over my head. Much appreciated!

Your explanations on this topic is so on point. Thanks alot

boss tnx now I can explain it very well to my students.there are lots of video related to this bt this clearly explains the topic.nice...

If that is the case, I would guess that you simplified a little early. When doing this process, it is important to leave terms as multiples of two numbers, so that one of the numbers can be replaced by an equation above. I hope that helps. :)

Thank you so much! best guy on youtube for this tutorial!

awesome explanation! looking forward to check out the rest of the videos. :)

you had explained in very clear manner thanks sir...

I should've found this video first! It was very clear, thank you.

Great video, helped me understand how to deal with negative numbers in Bezout's theorem.

Learn Math Tutorials I like how you solved for the remainder values first in the video, then went and did the Reverse Eulcidean Algo (REA) This method is different from every other method I have seen demonstrated (where they do the REA and computer the replacement values on-the-fly). I think you way will keep me organized better, thanks for making the video.

wow thank you for making this. it helped a ton!

this is the best explanation ever. thumps up man.

Thank God! I have an exam tomorrow and I've never really understood how to use the algorithm to find aninverse. I like u.

Very nice video, my lecturer just expected us to guess how to do this! Thanks :)

The best explanation on the youtube I found so far. Thank you

after 10 years. Thank you. Was going crazy :')

Very nice video, good use of colours. Excellent explanation of the Euclidean algorithm leaving no steps out. Well done.

Great explanation! Way better than my lecture at uni

very very thanks.. i am strugling with inverse. you solved the problem very efficiently .......

Having an exam coming next week. You saved me. HUGE THANKS

thank you so much. I spend a day to find the solution for d equal to negative. Superb.

awesome video dude, love how you used the different colour schemes to segregrate some of the concepts behind what was going on!

amazing explanation! saved me a lot of time!

Very helpful. Thanks for making

I've been looking for a video like this for weeks. After another seemingly fruitless search, I prayed and just stumbled on your well explanatory video. Thank you very much.

Just what I needed, thanks a lot man

Thank you so much! While reading my book I was completely lost! You made this so simple to follow and understand. Thanks again!

Thanks man! Came in handy with Abstract Algebra

Excellent explanation which is useful in understanding RSA algorithm.

this was very good, exactly what i was looking for

Thanks a lot , it was very helpful. Could you please make more videos on modular arithmetic algorithms . It would really help me a lot. Thanks once again :)

Well explain, good example, thank you very much that helps so much

Excellent, thanks for the video.

very clear explanation, thanks!

Thank you so much this is so useful great job!

hey any chance you can make a playlist of these so we know which order to go it? just watched the positive mod change vid and im pretty sure next should be the negative mod but its this? which i dont think should be next?

Studying for my final and couldn't figure this out for the life of me. Your explanation was great. Thank you

Thank you for a great explanation!

Thank you. Not every number in a mod field will necessarily have an inverse. For example 2 (mod 4) does not have and inverse since 2*0 = 0 (mod 4) .... 2*1 = 2 (mod 4) ... 2*2 = 0 (mod 4) ...2*3 = 2 (mod 4) ... none of these results produce 1 (mod 4) and you have checked 2*0 , 2*1 ,..., 2*(n-2) , 2*(n-1) where n is the mod.

Thanks you!! it is really helpful for me to understand.

5 Star rating for this video!

@shubhamchaudhari790

10 жыл бұрын

r u mad ..... :P :P

Thank you for the explanation, you say me a lot of theory

This is a great instructional video ... I still need to clean up some details in my understanding ... but this question: Is there a check you can do to verify the answer ? I’m trying to do 27^-1 (mod 292) compared to 363 ( mod 392) ... or, am I thinking about this wrong ?

Wonderful tutorial!!

Thank you! This was the best explanation of EA and EEA I've been through. I still have no idea why tf this thing exists though

Great explanation!

You rock. Thanks a lot

Thank you so much, mate.

Thanks this is awesome!

thank you sooo much .. u r the best

thank you, well explained video

very helpful video, are the equal signs at the end supposed to be congruence signs?

Thanks. You helped me alot

Great tutorial! :)

great thanks for the explanation!

This is very helpful

very good expatiation thank you

Hello I was wondering what kind of program do you use for all of your videos to write on the computer? Thanks

So easy to understand ty

Thanks sooooo much.

so nice explanation .

Thanks a lot. Searching the answer for asymmetric key cryptography

Clear cut explanation.

best explanation

great! great!! great!!! explanation

Bro I love you!

Dude you have helped alot😇😇😇😇😇😇😇

Thanks a Lot Sir

Just wonderful

Pretty nice tutorial, even after all these years. Sir am wondering, if we had had a positive number instead of a negative one at + 27(-29)...., would we have still subtracted it from 392 or added it instead?

@alial-musawi9898

6 жыл бұрын

Feysal Imraan 27 (mod n > 27) = 27 So you leave the 27 as is.

Great tutorial! All this can be avoided by using matrix multiplication which is a faster and easier route to get the multiplicative inverse of 27 mod 392. It is always good to know both ways of course, but like I said, great tutorial! Maybe I should do a tutorial on how to do it using matrices...

@jackbinding5587

8 жыл бұрын

+Gabriel Sotolongo Im curious to how you do it with matrices! haha

@gabrielsotolongo8407

8 жыл бұрын

+Jack Binding it is really easy, I could make a video an upload it if you like, anyways there is none here in KZread of that type.

@jackbinding5587

8 жыл бұрын

+Gabriel Sotolongo if you do decide to make one defo tell me! Haha

@gabrielsotolongo8407

8 жыл бұрын

+Jack Binding I will try to make the video today (no promises) ;)

@jackbinding5587

8 жыл бұрын

haha, im grateful if you upload it any time man! I've just not seen anything modulo been solved with matrices so im just curious!

Thank you!

In the step where you calculated 363 by subtracting 29 from 392 (392-29=363) does the negative come from the -29? So if 29 were positive would you add 29 to 392?

@waltvanamstel6807

9 жыл бұрын

Logan Koester He found the answer to be -29. That is a valid answer, but you will often be asked to find the positive inverse. -29 and 363 are essentially the same number under mod 392.

Very helpful

Thanks!

Thank you.

Great! thx a lot

better than my indian lecturer will ever explain it with her annoying accent, thank you good sir, and this definitely warrants a subscribe

It did help to explain what the textbook had in written words and figures...but it is still difficult because you still have to go through all the numbers on the Euclidean algorithm to get to the bottom of this. So imagine if you have a gcd(80, 98) it would be endless!!

謝謝你!!!

RESPEK! Every other KZread tutorial should do future students of this a favor and take off their videos. Most clear and concise. Respek once again

question, and a really big one. by the equal sign, you mean the congruence, correct?

thanks lad