Jump to content

What's the technique used by this teacher to solve ax+by=GCD(a,b) in RSA Algorithm-Cryptography?


shivajikobardan

Recommended Posts

https://www.youtube.com/watch?v=di3OXhHMZmI

 

It starts at 6:16

vXyHA4zg8R-jOWdHVkm7Q8IPcevrsZZSGiKMx08gNnBoCRtY_ElYpeUHKoSKYjpEn7-Y7H_3UkKsqeaHx58g7-RiRdsbNA79KXY6XTbO_9XvqKKZSAidxFT5FhXIqcLz02P8DtBbZJSRxixIFEj0ESs

It's the part where he's pointing his hand in this picture. I didn't get it although it's pretty mechanical, so I'd like to learn that technique as this is really useful in RSA algorithm(rather than having to memorize some values). I've been searching for a method like that since I saw this problem(been months) but could not find a technique like that. And it was always about just do it rather having any mechanical method like this one. So, I want to learn this.

 

Or, if you have any other simple methods to solve this equation, please tell me

 

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.