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.[ref]
Factoring integers with elliptic curves by Hendrik W. Lenstra, Jr.. Abstract, algorithm and dependence on the smallest prime divisor
The method computes modulo a composite integer without first knowing its prime divisors. If an elliptic-curve operation requires inverting a denominator with , 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.[ref]
Hendrik W. Lenstra, Clay Mathematics Institute portrait
. New to topics? Read the docs here!