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)

Related topics

Related topics

16 relations
Elliptic curve cryptographyElliptic curve primalityEuclidean algorithmExtended Euclidean algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Improving Lenstra ’ s Elliptic Curve Method
  • 2015
  • Corpus ID: 30013720
In this paper we study an important algorithm for integer factorization: Lenstra’s Elliptic Curve Method. We first discuss how… 
2011
2011
Curves, codes, and cryptography
This thesis deals with two topics: elliptic-curve cryptography and code-based cryptography. In 2007 elliptic-curve cryptography… 
2010
2010
Smooth numbers in short intervals
Assuming the Riemann hypothesis we demonstrate the existence of smooth numbers in certain short intervals. 
2010
2010
Area-Time Efficient Implementation of the Elliptic Curve Method of Factoring in Reconfigurable Hardware for Application in the Number Field Sieve
A novel portable hardware architecture of the Elliptic Curve Method of factoring, designed and optimized for application in the… 
2009
2009
EFFICIENT IMAGE ENCRYPTION USING MRF AND ECC
In this era, network security has become an issue of importance, on which lot of research is going on. We have proposed a two… 
2007
2007
Secure mediated certificateless signature scheme
2005
2005
An Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best… 
2005
2005
FPGA IMPLEMENTATION OF ELLIPTIC CURVE METHOD FOR FACTORIZATION
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best… 
2004
2004
APPLICATIONS OF CAYLEY GRAPHS , BILINEARITY , AND HIGHER-ORDER RESIDUES TO CRYPTOLOGY
All Rights Reserved ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and… 
2002
2002
A New Special-Purpose Factorization Algorithm
In this paper, a new factorization algorithm is presented, which finds a prime factor p of an integer n in time (D log n)O(1), if… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)