Abstract
Euclid's Greatest Common Divisor (GCD) algorithm is an efficient approach for calculating multiplicative inversions. It relies mainly on a fast modular arithmetic algorithm to run quickly. A traditional modular arithmetic algorithm based on nonrestoring division needs a magnitude comparison for each iteration of shift-and-subtract operation. This process is time consuming, since it requires magnitude comparisons for every computation iteration step. To eradicate this problem, this study develops a new fast Euclidean GCD algorithm without magnitude comparisons. The proposed modular algorithm has an execution time that is about 33% shorter than the conventional modular algorithm.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Information and Computer Security
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
