ECC: Do We Need to Count? (1999)

by Jean-Sebastien Coron , Helena Handschuh , David Naccache
Citations:1 - 0 self

Active Bibliography

On Positive Integers ≤x with Prime Factors ≤t log x – Andrew Granville
On Artin's Conjecture for Primitive Roots – Francesco Pappalardi - 1993
ON THE NUMBER OF LINEAR FORMS IN LOGARITHMS – Youness Lamzouri
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
SOME REMARKS ON NUMBER THEORY. II. – P. Erdős - 1967
On intervals with few prime numbers – H. Maier, C.L. Stewart
6 Towards a deterministic polynomial-time Primality Test – Neeraj Kayal, Nitin Saxena, Supervisor Dr. Manindra Agarwal - 2002
3 Arbitrarily Tight Bounds On The Distribution Of Smooth Integers – Daniel J. Bernstein - 2002
On a Problem of P. Erdős and S. Stein – P. Erdős, et al. - 1968
On the distribution of prime divisors – P. Erdős - 1969
On a Problem of . . . "Factorisatio Numerorum" – E. R. Canfield, Paul Erdős, Carl Pomerance - 1983
unknown title – Paul Pollack, Lola Thompson
unknown title – Paul Pollack, Lola Thompson
8 Integers, without large prime factors, in arithmetic progressions, II – Andrew Granville
Iterated logarithm approximations to the distribution of the largest prime divisor – Arie Leizarowitz - 2009
Communicated – D. A. Goldston, Kevin S. Mccurley, H. Halberslam - 1986
19 On the security of RSA padding – Jean-Sebastien Coron, David Naccache, Julien P. Stern - 1999
25 On the possibility of constructing meaningful hash collisions for public keys – Arjen Lenstra, Benne De Weger - 2005
14 The Complete Analysis of a Polynomial Factorization Algorithm Over Finite Fields – Philippe Flajolet, Xavier Gourdon, Daniel Panario - 2001