Abstract
In this article, the prime motivation is to demonstrate how calculating modular multiplicative inverse can be simplified computationally with the help of Euclid’s algorithm, which is usually attributed to finding the Greatest Common Divisor.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
