Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers
We present simple and efficient algorithms for computing gcd and cubic residuosity in the ring of Eisenstein integers, Z[ζ], i.e. the integers extended with ζ, 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 Euclidean 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.
KeywordsPrimary Number Euclidean Algorithm Modular Exponentiation Loop Invariant Binary Algorithm
Unable to display preview. Download preview PDF.
- 2.Damgård, I.B., Frandsen, G.S.: 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, Extended abstract in these proceedings (February 2003)Google Scholar
- 5.Lemmermeyer, F.: Reciprocity laws. Springer Monographs in Mathematics. Springer, Berlin (2000); From Euler to EisensteinGoogle Scholar
- 16.Williams, H.C.: An M3 public-key encryption scheme. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 358–368. Springer, Heidelberg (1986)Google Scholar