Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers

Authors

  • Ivan B. Damgård
  • Gudmund Skovbjerg Frandsen

DOI:

https://doi.org/10.7146/brics.v10i8.21779

Abstract

We present simple and efficient algorithms for computing gcd and cubic residuosity in the ring of Eisenstein integers, Z[zeta] , i.e. the integers extended with zeta , a complex primitive third root of unity. The algorithms are similar and may be seen as generalisations of the binary integer gcd and derived Jacobi symbol algorithms. Our algorithms take time O(n^2) for n bit input. This is an improvement from the known results based on the Euclidian algorithm, and taking time O(n· M(n)), where M(n) denotes the complexity of multiplying n bit integers. The new algorithms have applications in practical primality tests and the implementation of cryptographic protocols. The technique underlying our algorithms can be used to obtain equally fast algorithms for gcd and quartic residuosity in the ring of Gaussian integers, Z[i].

Downloads

Published

2003-02-06

How to Cite

Damgård, I. B., & Frandsen, G. S. (2003). Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers. BRICS Report Series, 10(8). https://doi.org/10.7146/brics.v10i8.21779