Asymptotically Fast GCD Computation in ℤ[i]-Reference-Cited by-同舟云学术

Asymptotically Fast GCD Computation in ℤ[i]

Published:2000 Issue: Volume: Page:595-613
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Weilert André

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10722028_40

Reference38 articles.

1. Brent, R.P.: Analysis of the binary Euclidean algorithm. In: Traub, J.F. (ed.) Algorithms and Complexity: New Directions and Recent Results, pp. 321–355. Academic Press, New York (1976)

2. Efficient Algorithms, Foundations of Computing;E. Bach,1996

3. Caviness, B.F.: A Lehmer-Type Greatest Common Divisor Algorithm for Gaussian Integers. SIAM Review 15(2), 414 (1973)

4. Caviness, B.F., Collins, G.E.: Algorithms for Gaussian Integer Arithmetic. In: Proceedings of the ACM Symposium on Symbolic and Algebraic Computation, Yorktown Heights, pp. 36–45 (1976)

5. Heath, T.L.: The Thirteen Books of Euclid’s Elements, 2nd edn., vol. 2. Cambridge University Press, New York (1956); Books III–IX

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New GCD Algorithm for Quadratic Number Rings with Unique Factorization;LATIN 2006: Theoretical Informatics;2006

2. Robust HGCD with No Backup Steps;Lecture Notes in Computer Science;2006

3. Two efficient algorithms for the computation of ideal sums in quadratic orders;Mathematics of Computation;2005-12-08

4. On the l-Ary GCD-Algorithm in Rings of Integers;Automata, Languages and Programming;2005

5. Optimization of the MOVA Undeniable Signature Scheme;Progress in Cryptology – Mycrypt 2005;2005