# Factoring integers with elliptic curves

```@article{Lenstra1986FactoringIW,
title={Factoring integers with elliptic curves},
author={Hendrik W. Lenstra},
journal={Annals of Mathematics},
year={1986},
volume={126},
pages={649-673}
}```
• H. Lenstra
• Published 1 November 1987
• Mathematics
• Annals of Mathematics
This paper is devoted to the description and analysis of a new algorithm to factor positive integers. It depends on the use of elliptic curves. The new method is obtained from Pollard's (p - 1)-method (Proc. Cambridge Philos. Soc. 76 (1974), 521-528) by replacing the multiplicative group by the group of points on a random elliptic curve. It is conjectured that the algorithm determines a non-trivial divisor of a composite number n in expected time at most K( p)(log n)2, where p is the least…
1,066 Citations
Integer Factorization of Semi-Primes Based on Analysis of a Sequence of Modular Elliptic Equations
A non-deterministic algorithm that computes a factor of a semi-prime integer n=pq, where prime factors p and q are unknown is provided.
On the number of elliptic pseudoprimes
For an elliptic curve E with complex multiplication by an order in K = Q(V\/d), a point P of infinite order on E, and any prime p with (-d I p) = -1, we have that (p + 1) * P = O(mod p), where 0 is
Factoring integers with the number field sieve
• Mathematics
• 1993
In 1990, the ninth Fermat number was factored into primes by means of a new algorithm, the “number field sieve”, which was proposed by John Pollard. The present paper is devoted to the description
Estimates related to the arithmetic of elliptic curves
This dissertation presents results related to two problems in the arithmetic of elliptic curves. Let En : y 2 = x − nx denote the family of congruent number elliptic curves. In , Feng and Xiong
Fe b 20 09 The distribution of the number of points modulo an integer on elliptic curves over finite fields
• Mathematics
• 2009
Let Fq be a finite field and let b and N be integers. We study the probability that the number of points on a randomly chosen elliptic curve E over Fq equals b modulo N . We prove explicit formulas
Discrete logarithms and local units
• Oliver Schirokauer
• Mathematics
Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences
• 1993
Let K be a number field and (9K its ring of integers. Let l be a prime number and e a positive integer. We give a method to construct leth powers in (9K using smooth algebraic integers. This method
A rigorous time bound for factoring integers
• Mathematics
• 1992
In this paper a probabilistic algorithm is exhibited that factors any positive integer n into prime factors in expected time at most Ln[2, 1 + o()] for n oo, where L,[a, b] = exp(b(logx)a(loglogx)l
Constructing elliptic curves of prime order
• Mathematics, Computer Science
• 2007
A very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N, so fast that it may be used to tackle the related problem of finding elliptic curves with point groups of prime order of prescribed size.
HOW TO FIND SMOOTH PARTS OF INTEGERS
Let P be a finite set of primes, and let S be a finite sequence of positive integers. This paper presents an algorithm to find the largest P smooth divisor of each integer in S. The algorithm takes