Innumber theory, the continued fraction factorization method (CFRAC) is an integer factorization algorithm. It is a general-purpose algorithm, meaning that it is suitable for factoring any integer n, not depending on special form or properties. It was described by D. H. Lehmer and R. E. Powers in 1931,[1] and developed as a computer algorithm by Michael A. Morrison and John Brillhart in 1975.[2]
The continued fraction method is based on Dixon's factorization method. It uses convergents in the regular continued fraction expansionof
.Since this is a quadratic irrational, the continued fraction must be periodic (unless n is square, in which case the factorization is obvious).
It has a time complexity of ![{\displaystyle O\left(e^{\sqrt {2\log n\log \log n}}\right)=L_{n}\left[1/2,{\sqrt {2}}\right]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/d252c7723eefcda234a20f8c89f10bd0ed364a5d)
|
| |
|---|---|
| Primality tests |
|
| Prime-generating |
|
| Integer factorization |
|
| Multiplication |
|
| Euclidean division |
|
| Discrete logarithm |
|
| Greatest common divisor |
|
| Modular square root |
|
| Other algorithms |
|
| |
 | This number theory-related article is a stub. You can help Wikipedia by expanding it. |
