Speeding up Euclid's GCD algorithm with no magnitude comparisons

Authors:
Che Wun Chiou;Fu Hua Chou;Yun-Chi Yeh
Affiliations:
Department of Computer Science and Information Engineering, Ching Yun University, 229, Chien-Hsin Rd., Chung-Li 320, Taiwan.;Department of Electronic Engineering, Ching Yun University, 229, Chien-Hsin Rd., Chung-Li 320, Taiwan.;Department of Electronic Engineering, Ching Yun University, 229, Chien-Hsin Rd., Chung-Li 320, Taiwan
Venue:
International Journal of Information and Computer Security
Year:
2010

Citing 6
Cited 0

Introduction to finite fields and their applications

Introduction to finite fields and their applications
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in GF (2m)

IEEE Transactions on Computers
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
On Computing Multiplicative Inverses in GF(2/sup m/)

IEEE Transactions on Computers
Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2m)

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.00

Visualization

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.