Lenstra elliptic-curve factorization
id:
lenstra-elliptic-curve-factorization-304-12063849
title:
Lenstra elliptic-curve factorization
text:
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 consi
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for integer factorization
original url:
https://en.wikipedia.org/wiki/Lenstra_elliptic-curve_factorization
date created:
date modified:
2024-04-16T23:04:01Z
main entity:
{"identifier":"Q2662711","url":"https://www.wikidata.org/entity/Q2662711"}
image:
fields total:
13
integrity:
14