John M. Pollard

According to our database, John M. Pollard authored at least 4 papers between 1987 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

Computing discrete logarithms in an interval.

Steven D. Galbraith, John M. Pollard, Raminder S. Ruprai

Math. Comput., 2013

2000

Kangaroos, Monopoly and Discrete Logarithms.

John M. Pollard

J. Cryptol., 2000

1990

The Number Field Sieve

Arjen K. Lenstra, Hendrik W. Lenstra Jr., Mark S. Manasse, John M. Pollard

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1987

An efficient solution of the congruence x²+ky²=mpmod{n}.

John M. Pollard, Claus-Peter Schnorr

IEEE Trans. Inf. Theory, 1987