1. L.M. Adleman, Factoring numbers using singular integers, Proc. 23rd Annual ACM Symp. on Theory of Computing (STOC), New Orleans, May 6–8, 1991, 64–71.
2. D. J. Bernstein, A. K. Lenstra, A general number field sieve implementation, this volume, pp. 103–126.
3. Contemp. Math.;J. Brillhart,1988
4. J. Buchmann, Complexity of algorithms in algebraic number theory, in: R. A. Mollin (ed.), Proceedings of the first conference of the Canadian Number Theory Association, De Gruyter, Berlin, 1990, 37–53.
5. J. Buchmann, H. W. Lenstra, Jr., Approximating rings of integers in number fields, in preparation.