Revision as of 13:11, 30 September 2024 edit Paul2520 (talk \| contribs) Autopatrolled, Extended confirmed users, IP block exemptions, New page reviewers, Pending changes reviewers, Rollbackers 53,773 edits added notes list ← Previous edit		Revision as of 08:04, 23 December 2024 edit undo Citation bot (talk \| contribs) Bots 5,863,261 edits Altered title. \| Use this bot. Report bugs. \| Suggested by Dominic3203 \| Category:Integer factorization algorithms \| #UCB_Category 7/26 Next edit →
Line 136: == Further reading == * {{cite conference \|first1=Shi \|last1=Bai \|first2=Richard P. \|last2=Brent \|authorlink2=Richard P. Brent \|title=On the Efficiency of ~~Pollard’s~~Pollard's Rho Method for Discrete Logarithms \|conference=The Australasian Theory Symposium (CATS2008) \|___location=Wollongong \|date=January 2008 \|book-title=Conferences in Research and Practice in Information Technology, Vol. 77 \|pages=125–131 \|url=https://maths-people.anu.edu.au/~brent/pub/pub231.html}} Describes the improvements available from different iteration functions and cycle-finding algorithms. * {{cite book \|last1=Katz \|first1=Jonathan \|last2=Lindell \|first2=Yehuda \|chapter=Chapter 8 \|title=Introduction to Modern Cryptography \| year=2007 \|publisher=CRC Press}} * {{cite book \| author =Samuel S. Wagstaff, Jr. \| title=The Joy of Factoring \| publisher=American Mathematical Society \| ___location=Providence, RI \| year=2013 \| isbn=978-1-4704-1048-3 \|url=https://www.ams.org/bookpages/stml-68 \|author-link=Samuel S. Wagstaff, Jr. \|pages= 135–138 }}

Pollard's rho algorithm: Difference between revisions