Lenstra's factoring method with elliptic curves
Suppose that we want to factorize an integer N. We can use Lenstra's method, which is based on elliptic curves over finite fields, to find the smallest non-trivial prime factor p of N. The success of Lenstra's algorithm depends on the probability to find an elliptic curve over the finite f...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2005
|
| Online Access: | http://spectrum.library.concordia.ca/8466/1/MR10213.pdf He, Xun <http://spectrum.library.concordia.ca/view/creators/He=3AXun=3A=3A.html> (2005) Lenstra's factoring method with elliptic curves. Masters thesis, Concordia University. |