S Goldwasser
J Kilian
- APR.Adleman, Pomerance, Rumely, "On Distinguishing prime numbers from composite numbers",to appear. Ext. Abstract 21st FOCS (1980), 387-406.Google Scholar
- BLS.Brillhart, Lehmer, Selfridge, "New Primality7 Criteria and Factorization of 2sup m+i", vol 29, no. 1930 (1975).Google Scholar
- Ba2.Bach Eric, "Lenstra's Algorithm for Factoring with Elliptic Curves (Expose)", notes, February 27th, 1985.Google Scholar
- CL.Choen, Lenstra, "Primality Testing and Jacobi Sums", to appear.Google Scholar
- D.Dickson, " History of the Theory of Numbers", Chelsea Publishing Company, 1952.Google Scholar
- F.Furer, "Deterministic and Las Vegas Primality Testing Algorithms", Proc. of ICALP 1985. Google ScholarDigital Library
- lIB.Heath- Brown D. R., "The Differences between Consecutive Primes", J. London Math. Soc. (2), 18 (1978), 7-13.Google ScholarCross Ref
- L.Lenstra, "Factoring Integers using Elliptic Curves over Finite Fields", to appear.Google Scholar
- M.Miller, "Riemann Hypothesis and test for primality", JCSS 13 (1976), 300-317.Google ScholarDigital Library
- MP.Maier H., Pomerance C., Personnal Communication.Google Scholar
- P.Plaisted, "Generating Large Prime Numbers".Google Scholar
- P.Pratt, "Every Prime has a Succinct Certificate", SIAM J. of Comp. (1975), 214-220.Google ScholarCross Ref
- R.Rabin, "Probabilistic Algorithms for Testing Primality", J. of Num. Th. 12, 128-138 (1980).Google ScholarCross Ref
- Sch.School, "Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p", Math. Computation, Vol. 44, Num 170, April 1985, pp.Google Scholar
- Sh.Shallit, "Lenstra's Elliptic Curve Factoring Algorithm", notes, March 15, 1985.Google Scholar
- Se.Selberg, "On the Normal Density of Primes in Small Intervals, and the Difference between Consecutive Primes", Archly for Mathematik of Naturvidensakb B. XLVII. Nr. 6. 483-494.Google Scholar
- Sha.Shanks, "On Maximal Gaps between Successive Primes", Math. Computation, Vol. 18, pp. 646-651, 1964.Google ScholarCross Ref
- SS.Solovay and Strassen, "A fast Monte-Carlo test for Primality", SIAM. J. of Comp. 6 (1977), 84-85.Google ScholarCross Ref
- T.Tate, "The Arithmetic of Elliptic Curves", Inventiones Math. 23, (1974), 179-206.Google ScholarCross Ref
Index Terms
- Almost all primes can be quickly certified
Comments