Skip to search formSkip to main contentSkip to account menu

Lenstra elliptic curve factorization

Known as: Elliptic curve factorisation, ECM, Elliptic Curve Factorization Method 
The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, sub-exponential running time algorithm for… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
This paper presents the basic concepts of the Edwards curves, twisted Edwards curves and the point addition laws on these curves… 
Review
2015
Review
2015
  • 2015
  • Corpus ID: 30013720
In this paper we study an important algorithm for integer factorization: Lenstra’s Elliptic Curve Method. We first discuss how… 
2010
2010
Assuming the Riemann hypothesis we demonstrate the existence of smooth numbers in certain short intervals. 
2005
2005
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best… 
2005
2005
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best… 
2005
2005
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best… 
2004
2004
All Rights Reserved ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and… 
1999
1999
Three questions concerning the distribution of the numbers of points on elliptic curves over a finite prime field are considered…