Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Create euclidean_algo_GCD_extended.py #62

Merged
merged 1 commit into from
Oct 2, 2018
Merged

Create euclidean_algo_GCD_extended.py #62

merged 1 commit into from
Oct 2, 2018

Commits on Oct 2, 2018

  1. Create euclidean_algo_GCD_extended.py 

    How is Extended Algorithm Useful?
The extended Euclidean algorithm is particularly useful when a and b are coprime (or gcd is 1). Since x is the modular multiplicative inverse of “a modulo b”, and y is the modular multiplicative inverse of “b modulo a”. In particular, the computation of the modular multiplicative inverse is an essential step in RSA public-key encryption method.
    @Phantsure
    Phantsure committed Oct 2, 2018
    Configuration menu
    Copy the full SHA
    5ba71b7 View commit details
    Browse the repository at this point in the history