Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1504/IJICS.2010.031855 | IJICS |
Keywords | Field | DocType |
computation iteration step,traditional modular arithmetic algorithm,execution time,new fast euclidean gcd,greatest common divisor,proposed modular algorithm,time consuming,gcd algorithm,conventional modular algorithm,magnitude comparison,fast modular arithmetic algorithm,modular arithmetic,division,security,gcd,cryptography | Tonelli–Shanks algorithm,Multiplicative function,Modular arithmetic,Computer science,Euclidean algorithm,Algorithm,Greatest common divisor,Binary GCD algorithm,Lehmer's GCD algorithm,Computation | Journal |
Volume | Issue | Citations |
4 | 1 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Che Wun Chiou | 1 | 272 | 21.81 |
| Fu-hua Chou | 2 | 6 | 1.72 |
| Yun-Chi Yeh | 3 | 99 | 8.44 |