Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,626 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.
2016
2016
Generalized RSA using 2k prime numbers with secure key generation
Auqib Hamid Lone
,
Aqeel Khalique
Secur. Commun. Networks
2016
Corpus ID: 7340552
Cryptography is used for secure communication since ancient days for providing confidentiality, integrity and availability of the…
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
2013
2013
ANTS X Proceedings of the Tenth Algorithmic Number Theory Symposium msp Finding ECM-friendly curves through a study of Galois properties
R. Barbulescu
,
Joppe W. Bos
,
Cyril Bouvier
,
T. Kleinjung
,
Peter L. Montgomery
2013
Corpus ID: 264644021
We prove some divisibility properties of the cardinality of elliptic curve groups modulo primes. These proofs explain the good…
Expand
2011
2011
Curves, codes, and cryptography
C. Peters
2011
Corpus ID: 220863634
This thesis deals with two topics: elliptic-curve cryptography and code-based cryptography. In 2007 elliptic-curve cryptography…
Expand
2009
2009
EFFICIENT IMAGE ENCRYPTION USING MRF AND ECC
K. Gupta
,
S. Silakari
2009
Corpus ID: 212487310
In this era, network security has become an issue of importance, on which lot of research is going on. We have proposed a two…
Expand
2006
2006
Design and Implementation of an ECM-based Integer Factorization Tool with GMP-ECM on Windows Platforms
楊中皇
,
Bin-Hui Chou
,
Chung-Huang Yang
,
K. Sakurai
2006
Corpus ID: 55559289
Integer factorization is concerned with public-key cryptosystems, RSA. Most of the current factorization tools, which are not…
Expand
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
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
2002
2002
A New Special-Purpose Factorization Algorithm
Qi Cheng
2002
Corpus ID: 1334697
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…
Expand