Kevin McCurley (cryptographer)

Known as: Kevin McCurley, McCurley 
Kevin Snow McCurley is a mathematician, computer scientist, and cryptographer, currently a research scientist at Google. He received his Ph.D. in… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2014
012319842014

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
This paper concerns the function S(t), the argument of the Riemann zeta-function along the critical line. Improving on the method… (More)
  • table 1
Is this relevant?
2009
2009
Let C( -d) denote the Gauss Class Group of quadratic forms of<lb>a negative discriminant -d (or equivalently, the class group of… (More)
Is this relevant?
2009
2009
Most existing cryptosystem designs incorporate just one cryptographic assumption, such as factoring or discrete logarithms. These… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Geographical information is recorded in a wide variety of media and document types. There are innumerable paper-based books… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We present minimally supervised methods for training and testing geographic name disambiguation (GND) systems. We train data… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
1998
1998
We provide the secret Diffie-Hellman-Key which is requested by Kevin McCurley’s challenge of 1989. The DH-protocol in question… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1996
1996
This paper presents a new algorithm for computing the Hermite normal form H of an A c Z “m of rank m together with a unimodular… (More)
Is this relevant?
1996
1996
Strengthening work of Rosser, Schoenfeld, and McCurley, we establish explicit Chebyshev-type estimates in the prime number… (More)
  • table 1
  • table 2
Is this relevant?
1995
1995
We present two new probabilistic algorithms for computing the Smith normal form of an A 2 Z mn. The rst requires an expected… (More)
Is this relevant?
1993
1993
Schnorr’s identification and signature schemes [10], [11] are efficient, discrete log-based protocols. Moreover, preprocessing… (More)
Is this relevant?