Efficient algorithms for GCD and cubic residuosity in the ring of Eisenstein integers

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

Volumn 2751, Issue , 2003, Pages 109-117

  Damgård, Ivan Bjerre ^a   Frandsen, Gudmund Skovbjerg ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BINARY INTEGERS; BIT INTEGERS; CRYPTOGRAPHIC PROTOCOLS; EUCLIDEAN ALGORITHMS; JACOBI SYMBOLS; PRIMALITY TESTS; SIMPLE AND EFFICIENT ALGORITHMS;

ALGORITHMS;

EID: 35248883911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_11     Document Type: Article

References (17)

1. Eric Bach and Jeffrey Shallit. Algorithmic number theory. Vol. 1. Foundations of Computing Series. MIT Press, Cambridge, MA, 1996. Efficient algorithms.
2. Ivan B. Damgård and Gudmund Skovbjerg Frandsen. An extended quadratic Frobenius primality test with average and worst case error estimates. Research Series RS-03-9, BRICS, Department of Computer Science, University of Aarhus, February 2003. Extended abstract in these proceedings.
3. Kenneth Ireland and Michael Rosen. A classical introduction to modern number theory, Vol. 84 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition, 1990.
4. Franz Lemmermeyer. The Euclidean algorithm in algebraic number fields. Exposition. Math. 13(5) (1995), 385-416.
5. Franz Lemmermeyer. Reciprocity laws. Springer Monographs in Mathematics. Springer-Verlag, Berlin, 2000. From Euler to Eisenstein.
6. Hendrik W. Lenstra, Jr. Euclidean number fields. I. Math. Intelligencer 2(1) (1979/80), 6-15.
7. Shawna Meyer Eikenberry and Jonathan P. Sorenson. Efficient algorithms for computing the Jacobi symbol. J. Symbolic Comput. 26(4) (1998), 509-523.
8. Renate Scheidler and Hugh C. Williams. A public-key cryptosystem utilizing cyclotomic fields. Des. Codes Cryptogr. 6(2) (1995), 117-131.
9. A. Schönhage. Schnelle Berechnung von Kettenbruchentwicklungen. Acta Informat. 1 (1971), 139-144.
10. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen) 7 (1971), 281-292.
11. Jeffrey Shallit and Jonathan Sorenson. A binary algorithm for the jacobi symbol. ACM SIGSAM Bull. 27(1) (1993), 4-11.
12. J. Stein. Computationals problems associated with Racah algebra. J. Comput. Phys. 1 (1967), 397-405.
13. André Weilert. (1 + i)-ary GCD computation in Z[i] is an analogue to the binary GCD algorithm. J. Symbolic Comput. 30(5) (2000), 605-617.
14. André Weilert. Asymptotically fast GCD computation in Z[i]. In Algorithmic number theory (Leiden, 2000), Vol. 1838 of Lecture Notes in Comput. Sci., pp. 595-613. Springer, Berlin, 2000.
15. André Weilert. Fast computation of the biquadratic residue symbol. J. Number Theory 96(1) (2002), 133-151.
16. 3 public-key encryption scheme. In Advances in cryptology - CRYPTO '85 (Santa Barbara, Calif., 1985), Vol. 218 of Lecture Notes in Comput. Sci., pp. 358-368. Springer, Berlin, 1986.
17. 3 = 1. Math. Comp. 31(139) (1977), 778-785.