Prime Numbers

562 REFERENCES
[Lenstra 1981] H. Lenstra, Jr. Primality testing algorithms (after Adleman,
Rumely and Williams). In Seminar Bourbaki 33 (1980/81), volume 901
of Lecture Notes in Mathematics, exp. 576. Springer—Verlag, 1981.
[Lenstra 1984] H. Lenstra, Jr. Divisors in residue classes. Math. Comp.,
42:331–340, 1984.
[Lenstra 1985] H. Lenstra, Jr. Galois theory and primality testing. In Orders and
their applications (Oberwolfach, 1984), volume 1142 of Lecture Notes in
Mathematics, pages 169–189. Springer–Verlag, 1985.
[Lenstra 1987] H. Lenstra, Jr. Factoring integers with elliptic curves. Ann. of
Math., 2:649–673, 1987.
[Lenstra 1991] H. Lenstra, Jr., 1991. Private communication.
[Lenstra et al. 1993b] H. Lenstra, Jr., J. Pila, and C. Pomerance. A hyperelliptic
smoothness test. I. Philos. Trans. Roy. Soc. London Ser. A, 345:397–408,
1993. Special issue compiled and edited by R. Vaughan: Theory and
applications of numbers without large prime factors.
[Lenstra and Pomerance 1992] H. Lenstra, Jr. and C. Pomerance. A rigorous time
bound for factoring integers. J. Amer. Math. Soc., 5:483–516, 1992.
[Lenstra and Pomerance 2005] H. Lenstra, Jr. and C. Pomerance. Primality
testing with Gaussian periods. Preprint, 2005.
[Li 1997] X. Li. The positivity of a sequence of numbers and the Riemann
hypothesis. J. Number Theory, 65:325–333, 1997.
[Lindqvist and Peetre 1997] P. Lindqvist and J. Peetre, On the remainder in a
series of Mertens, Exposition. Math., 15:467–478, 1997.
[Lim and Lee 1997] C. Lim and P. Lee. A key recovery attack on discrete
log-based schemes using a prime order subgroup. In Advances in
Cryptology, Proc. Crypto ’97, volume 1294 of Lecture Notes in Computer
Science, pages 249–265. Springer–Verlag, 1997.
[Long 1981] D. Long. Random equivalence of factorization and computation of
orders, 1981. Princeton U. Dept. Elec. Eng. and Comp. Sci. Technical
Report 284.
[Lovorn 1992] R. Lovorn. Rigorous, subexponential algorithms for discrete
logarithms over finite fields. PhD thesis, U. Georgia, 1992.
[Lovorn Bender and Pomerance 1998] R. Lovorn Bender and C. Pomerance.
Rigorous discrete logarithm computations in finite fields via smooth
polynomials. In J. Teitelbaum, editor, Computational Perspectives on
Number Theory (Chicago, IL, 1995), volume 7, pages 221–232. Atkin
Conference, Amer. Math. Soc., 1998.
[Madisetti and Williams 1997] V. Madisetti and D. Williams, editors. The Digital
Signal Processing Handbook. CRC Press, 1997.
[Marcus 1977] D. Marcus. Number Fields. Springer–Verlag, 1977.
[Marsaglia 1991] G. Marsaglia. The mathematics of random number generators.
In S. Burr, editor, The Unreasonable Effectiveness of Number Theory,