Revision as of 04:07, 20 June 2018 edit Bibcode Bot (talk \| contribs) Bots 42,789 edits m Adding 0 arxiv eprint(s), 1 bibcode(s) and 0 doi(s). Did it miss something? Report bugs, errors, and suggestions at User talk:Bibcode Bot ← Previous edit		Revision as of 19:27, 31 July 2018 edit undo Fgrieu (talk \| contribs) 276 edits →Lenstra's elliptic-curve factorization: Fix parenthesis and brackets in the formula Next edit →
Line 15: #*If we encountered a {{math\|1=gcd(''v'', ''n'')}} at some stage that was neither 1 nor ''n'', then we are done: it is a non-trivial factor {{math\|1=of ''n''}}. The time complexity depends on the size of the factor and can be represented by {{math\|1=exp[({{sqrt\|2}} + [[Big O notation#Little-o notation\|o]](1)]) {{sqrt\|ln ''p'' ln ln ''p'')}}]}}, where ''p'' is the smallest factor of ''n'', or <math>L_p\left[\frac{1}{2},\sqrt{2}\right]</math>, in [[L-notation]]. ==Why does the algorithm work?==

Lenstra elliptic-curve factorization: Difference between revisions