1. Binary GCD like algorithms for some complex quadratic rings;Agarwal,2004
2. On the optimality of the binary algorithm for the Jacobi symbol;Busch;Fundamenta Informaticae,2007
3. Busch, J., 2008. Lower bounds in arithmetic complexity via asymmetric embeddings. Ph.D. Thesis, University of California, Los Angeles
4. Discrete logarithms in GF(p);Coppersmith;Algorithmica,1986
5. Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers;Damgård;Journal of Symbolic Computation,2005