Extended Euclidean Algorithm in Cryptography and network security to Find GCD of 2 numbers examples

Показать описание

Extended euclidean algorithm is explained here with a detailed example of finding GCD of 2 numbers using extended euclidean theorem in cryptography. In this video of CSE concepts with Parinita Hajra, we will see about how to find out GCD of 2 numbers using Extended Euclidean Algorithm #gcd #greatestcommondivisor #extendedEuclidean #cseconceptwithparinita

For the people asking me for the equipments I use.... you can buy them from the below links:

If you like my video contents, please LIKE, COMMENT, SUBSCRIBE and SHARE with your friends.
You can always connect with me at:

Compiler design tutorials:

Theory of computation (TOC) tutorials:

Cryptography techniques tutorials:

Artificial Intelligence tutorials:

GATE previous year important questions:

Data Compression tutorials:

Computer networks tutorials:

Technical job updates:

Data structures and Algorithms tutorials:

Programming questions:

Digital image processing:

Digital electronics:

Motivational videos:

Keep learning, keep supporting 🤝✨💯