Abstract

I have been afforded the rare opportunity of working as a student of Richard Brent. Over the last three years, Richard has provided encouragement, guidance and suggestions from which I have learnt a great deal and for which I am extremely grateful. Richard was also considerate enough to take up a chair in Computing Science at Oxford University in 1998. That gave me an excuse to visit him there, about which I will say more later. I also owe a great deal to Peter Montgomery (CWI, Amsterdam and Microsoft Research, USA). Peter's influence on current research in this field is far more extensive than most people realise. I have had the benefit of many long discussions with Peter, and a great deal of patient instruction from him. Several key sections of this thesis are developed from ideas originating from discussions with Peter. My research experience has been enriched and broadened through close collaboration with the Computational Number Theory and Data Security group at CWI in Amsterdam. I thank Herman te Riele, the head of the group, for fostering that collaboration and supporting two visits by me to CWI.

Citations

69	The multiple polynomial quadratic sieve - Silverman - 1987
65	A modification of the RSA public-key encryption procedure - Williams - 1980
19	Algebraic number theory - Stewart, Tall - 1987
19	T.F.: The Solution of McCurley’s Discrete Log Challenge - Weber, Denny - 1998
9	Computing Discrete Logarithms with the Number Field Sieve”, Algorithmic Number Theory - Weber - 1996
9	Faktorisieren mit dem Number Field Sieve - Zayer - 1995
6	Computing Discrete Logarithms with Quadratic Number Rings - Weber - 1998
5	On the Computation of Discrete Logarithms in Finite Prime Fields - Weber - 1997
2	E#ciency vs. Security in Public-Key Cryptography - Walsh - 1999
1	M de Weger, "How to Explicitly Solve a Thue-Mahler Equation - Tzanakis, M - 1992
1	de Lune and E Wattel, "On the Numerical Solution of a Di#erentialDi #erence Equation Arising in Analytic Number Theory - van - 1969