= Hendrik W. Lenstra
{c}
<Hendrik W. Lenstra> is a <mathematician> working in computational <number theory>. He introduced the <elliptic-curve factorization method>, replacing the multiplicative groups in an earlier factorization approach by groups of points on variable <elliptic curves>.<Factoring integers with elliptic curves by Hendrik W. Lenstra, Jr.>[Abstract, algorithm and dependence on the smallest prime divisor]{ref}
The method computes modulo a composite <integer> $N$ without first knowing its prime divisors. If an elliptic-curve operation requires inverting a denominator $d$ with $1<\gcd(d,N)<N$, the failed inversion reveals a proper divisor. Varying the <elliptic curve> varies the group orders modulo the unknown primes, offering repeated chances for a favourable order. He also coauthored the <LLL algorithm> with <Arjen K. Lenstra> and <László Lovász>.<Factoring Polynomials with Rational Coefficients by Arjen K. Lenstra and others>[section 1]{ref}
\Image[https://www.claymath.org/wp-content/uploads/2022/05/image-38.jpeg]
{title=Hendrik W. Lenstra, Clay Mathematics Institute portrait}
{height=240}
Back to article page
