A binary recursive gcd algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3076, Issue , 2004, Pages 411-425

  Stehlé, Damien ^a   Zimmermann, Paul ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; NUMBER THEORY;

BINARY ALGORITHMS; EUCLIDEAN ALGORITHMS; GCD ALGORITHM; GREATEST COMMON DIVISORS; PROOF OF CORRECTNESS; QUASI-LINEAR TIME; RECURSIVE ALGORITHMS; RUNNING TIME;

ALGORITHMS;

EID: 35048822848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24847-7_31     Document Type: Article

References (12)

1. R. P. Brent. Twenty years' analysis of the binary Euclidean algorithm. In A. W. Roscoe J. Davies and J. Woodcock, editors, Millenial Perspectives in Computer Science: Proceedings of the 1999 Oxford-Microsoft Symposium in honour of Professor Sir Antony Hoare, pages 41-53, Palgrave, New York, 2000.
2. R. P. Brent and H. T. Kung. A systolic VLSI array for integer GCD computation. In K. Hwang, editor, Proceedings of the 7th Symposium on Computer Arithmetic (ARITH-7). IEEE CS Press, 1985.
3. T. Granlund. GNU MP: The GNU Multiple Precision Arithmetic Library, 4.1.2 edition, 2002. http://www.swox.se/gmp/\#DOC.
4. D. Knuth. The analysis of algorithms. In Actes du Congrès International des Mathématiciens de 1970, volume 3, pages 269-274, Paris, 1971. Gauthiers-Villars.
5. P. L. Montgomery. Modular multiplication without trial division. Math. Comp., 44(170):519-521, 1985.
6. A. Schönhage. Schnelle Berechnung von Kettenbruchentwicklungen. Acta Informatica, 1:139-144, 1971.
7. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing, 7:281-292, 1971.
8. M. Shand and J. E. Vuillemin. Fast implementations of RSA cryptography. In E. E. Swartzlander, M. J. Irwin, and J. Jullien, editors, Proceedings of the 11th IEEE Symposium on Computer Arithmetic (ARITH-11), pages 252-259. IEEE Computer Society Press, Los Alamitos, CA, 1993.
9. B. Vallée. Gauss' algorithm revisited. Journal of Algorithms, 12:556-572, 1991.
10. B. Vallée. Dynamical analysis of a class of Euclidean algorithms. Th. Computer Science, 297(1-3):447-486, 2003.
11. J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 2nd edition, 2003.
12. C. K. Yap. Fundamental Problems in Algorithmic Algebra. Oxford University Press, 2000.