Revision as of 20:38, 19 October 2022 edit PrimeHunter (talk \| contribs) Administrators 80,590 edits Undid revision 1117059137 by Mgnbar (talk). I think the point is that gcd(v,n) could both be 1 and n, and neither gives a non-trivial factor of n Tag: Undo ← Previous edit		Revision as of 22:38, 28 January 2023 edit undo OAbot (talk \| contribs) Bots 646,409 edits m Open access bot: doi added to citation with #oabot. Next edit →
Line 131: ==References== {{reflist}} {{cite journal \|last1=Bernstein \|first1=Daniel J. \|last2=Birkner \|first2=Peter \|last3=Lange \|first3=Tanja \|last4=Peters \|first4=Christiane \|title=ECM using Edwards curves \|journal=Mathematics of Computation \|year=2013 \| volume=82 \| number=282 \|doi=10.1090/S0025-5718-2012-02633-0 \| mr=3008853 \| pages=1139–1179 \|doi-access=free }} {{cite book \|last1=Bosma \|first1=W. \|last2=Hulst \|first2=M. P. M. van der \|title=Primality proving with cyclotomy \|publisher=Ph.D. Thesis, Universiteit van Amsterdam \|year=1990 \|oclc=256778332 }} *{{cite journal \|last=Brent \|first=Richard P. \|title=Factorization of the tenth Fermat number \|journal=Mathematics of Computation \|volume=68 \|issue=225 \|year=1999 \|pages=429–451 \|doi=10.1090/S0025-5718-99-00992-8 \|bibcode=1999MaCom..68..429B \| mr=1489968\|doi-access=free }}

Lenstra elliptic-curve factorization: Difference between revisions