Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,296 papers from all fields of science
Search
Sign In
Create Free Account
Lenstra elliptic curve factorization
Known as:
Elliptic curve factorisation
, ECM
, Elliptic Curve Factorization Method
Expand
The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, sub-exponential running time algorithm for…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Elliptic curve cryptography
Elliptic curve primality
Euclidean algorithm
Extended Euclidean algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Parameterization of Edwards curves on the rational field Q with given torsion subgroups
L. Vo
IACR Cryptology ePrint Archive
2018
Corpus ID: 4060393
This paper presents the basic concepts of the Edwards curves, twisted Edwards curves and the point addition laws on these curves…
Expand
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…
Expand
2012
2012
The Elliptic Curve Method and Other Integer
John Wright
2012
Corpus ID: 123920199
2010
2010
Smooth numbers in short intervals
K. Soundararajan
2010
Corpus ID: 118073421
Assuming the Riemann hypothesis we demonstrate the existence of smooth numbers in certain short intervals.
2007
2007
Secure mediated certificateless signature scheme
Chen Yang
,
Wenping Ma
,
Xinmei Wang
2007
Corpus ID: 121894748
2005
2005
An Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method
J. Franke
,
T. Kleinjung
,
+4 authors
C. Stahlke
2005
Corpus ID: 15197145
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best…
Expand
2005
2005
FPGA IMPLEMENTATION OF ELLIPTIC CURVE METHOD FOR FACTORIZATION
V. Fischer
2005
Corpus ID: 10464933
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best…
Expand
2005
2005
Hardware factorization based on elliptic curve method
M. Simka
,
J. Pelzl
,
+5 authors
V. Fischer
IEEE Symposium on Field-Programmable Custom…
2005
Corpus ID: 14597126
The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best…
Expand
2004
2004
APPLICATIONS OF CAYLEY GRAPHS , BILINEARITY , AND HIGHER-ORDER RESIDUES TO CRYPTOLOGY
R. Venkatesan
2004
Corpus ID: 394523
All Rights Reserved ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and…
Expand
1999
1999
Subtleties in the Distribution of the Numbers of Points on Elliptic Curves Over a Finite Prime Field
J. McKee
1999
Corpus ID: 18028843
Three questions concerning the distribution of the numbers of points on elliptic curves over a finite prime field are considered…
Expand
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)
ACCEPT & CONTINUE