Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2662711> ?p ?o }
Showing triples 1 to 57 of
57
with 100 triples per page.
- Q2662711 subject Q6912449.
- Q2662711 subject Q7005305.
- Q2662711 abstract "The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, sub-exponential running time algorithm for integer factorization which employs elliptic curves. For general purpose factoring, ECM is the third-fastest known factoring method. The second fastest is the multiple polynomial quadratic sieve and the fastest is the general number field sieve. The Lenstra elliptic curve factorization is named after Hendrik Lenstra.Practically speaking, ECM is considered a special purpose factoring algorithm as it is most suitable for finding small factors. Currently, it is still the best algorithm for divisors not greatly exceeding 20 to 25 digits (64 to 83 bits or so), as its running time is dominated by the size of the smallest factor p rather than by the size of the number n to be factored. Frequently, ECM is used to remove small factors from a very large integer with many factors; if the remaining integer is still composite, then it has only large factors and is factored using general purpose techniques. The largest factor found using ECM so far has 83 digits and was discovered on 7 September 2013 by R. Propper. Increasing the number of curves tested improves the chances of finding a factor, but they are not linear with the increase in the number of digits.".
- Q2662711 wikiPageExternalLink pomerance.pdf.
- Q2662711 wikiPageExternalLink yoyo.
- Q2662711 wikiPageExternalLink ECM.HTM.
- Q2662711 wikiPageExternalLink large-integers-factorization.
- Q2662711 wikiPageExternalLink ecm.gforge.inria.fr.
- Q2662711 wikiPageExternalLink 016.
- Q2662711 wikiPageExternalLink 016,.
- Q2662711 wikiPageExternalLink ecmnet.html.
- Q2662711 wikiPageExternalLink pyecm.
- Q2662711 wikiPageWikiLink Q104752.
- Q2662711 wikiPageWikiLink Q1151850.
- Q2662711 wikiPageWikiLink Q120976.
- Q2662711 wikiPageWikiLink Q1276570.
- Q2662711 wikiPageWikiLink Q131752.
- Q2662711 wikiPageWikiLink Q1362750.
- Q2662711 wikiPageWikiLink Q140770.
- Q2662711 wikiPageWikiLink Q1529876.
- Q2662711 wikiPageWikiLink Q15401695.
- Q2662711 wikiPageWikiLink Q1551033.
- Q2662711 wikiPageWikiLink Q173783.
- Q2662711 wikiPageWikiLink Q1753188.
- Q2662711 wikiPageWikiLink Q188295.
- Q2662711 wikiPageWikiLink Q1937853.
- Q2662711 wikiPageWikiLink Q201413.
- Q2662711 wikiPageWikiLink Q2233203.
- Q2662711 wikiPageWikiLink Q230848.
- Q2662711 wikiPageWikiLink Q24158.
- Q2662711 wikiPageWikiLink Q268493.
- Q2662711 wikiPageWikiLink Q269878.
- Q2662711 wikiPageWikiLink Q2741788.
- Q2662711 wikiPageWikiLink Q3001190.
- Q2662711 wikiPageWikiLink Q319400.
- Q2662711 wikiPageWikiLink Q3502015.
- Q2662711 wikiPageWikiLink Q3777923.
- Q2662711 wikiPageWikiLink Q42332.
- Q2662711 wikiPageWikiLink Q4353796.
- Q2662711 wikiPageWikiLink Q44946.
- Q2662711 wikiPageWikiLink Q4846249.
- Q2662711 wikiPageWikiLink Q505798.
- Q2662711 wikiPageWikiLink Q50708.
- Q2662711 wikiPageWikiLink Q564426.
- Q2662711 wikiPageWikiLink Q603880.
- Q2662711 wikiPageWikiLink Q6786906.
- Q2662711 wikiPageWikiLink Q68.
- Q2662711 wikiPageWikiLink Q6905837.
- Q2662711 wikiPageWikiLink Q6912449.
- Q2662711 wikiPageWikiLink Q7005305.
- Q2662711 wikiPageWikiLink Q81365.
- Q2662711 wikiPageWikiLink Q83478.
- Q2662711 wikiPageWikiLink Q850110.
- Q2662711 wikiPageWikiLink Q877775.
- Q2662711 wikiPageWikiLink Q8805.
- Q2662711 comment "The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, sub-exponential running time algorithm for integer factorization which employs elliptic curves. For general purpose factoring, ECM is the third-fastest known factoring method. The second fastest is the multiple polynomial quadratic sieve and the fastest is the general number field sieve.".
- Q2662711 label "Lenstra elliptic curve factorization".