Editing Dixon's factorization method (section)

In [[number theory]], '''Dixon's factorization method''' (also '''Dixon's random squares method'''<ref name="Kleinjung10">{{cite book |first=Thorsten |last=Kleinjung |chapter=Factorization of a 768-Bit RSA Modulus |title=Advances in Cryptology – CRYPTO 2010 |series=Lecture Notes in Computer Science |year=2010 |volume=6223 |pages=333–350 |doi=10.1007/978-3-642-14623-7_18 |display-authors=etal|isbn=978-3-642-14622-0 |s2cid=11556080 }}</ref> or '''Dixon's algorithm''') is a general-purpose [[integer factorization]] [[algorithm]]; it is the prototypical [[factor base]] method. Unlike for other factor base methods, its run-time bound comes with a rigorous proof that does not rely on conjectures about the smoothness properties of the values taken by a polynomial.

The algorithm was designed by [[John D. Dixon]], a mathematician at [[Carleton University]], and was published in 1981.<ref name="Dixon81">{{cite journal |last=Dixon |first=J. D. |author-link=John D. Dixon |year=1981 |title=Asymptotically fast factorization of integers |url=https://www.ams.org/journals/mcom/1981-36-153/S0025-5718-1981-0595059-1/S0025-5718-1981-0595059-1.pdf |journal=[[Mathematics of Computation|Math. Comp.]] |volume=36 |issue=153 |pages=255–260 |doi=10.1090/S0025-5718-1981-0595059-1 |jstor=2007743 |doi-access=free}}</ref>