Integer Factoring: Revision history

28 April 2023

• curprev 09:0709:07, 28 April 2023‎ Admin talk contribs‎ 5,101 bytes −163‎ No edit summary

10 April 2023

• curprev 07:5207:52, 10 April 2023‎ Admin talk contribs‎ 5,264 bytes −82‎ No edit summary

15 February 2023

• curprev 14:4214:42, 15 February 2023‎ Admin talk contribs‎ 5,346 bytes −13‎ No edit summary
• curprev 14:3514:35, 15 February 2023‎ Admin talk contribs‎ 5,359 bytes −2‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 5,361 bytes +4,590‎ No edit summary
• curprev 12:0212:02, 15 February 2023‎ Admin talk contribs‎ 771 bytes −10‎ No edit summary

• curprev 10:2010:20, 15 February 2023‎ Admin talk contribs‎ 781 bytes +781‎ Created page with "{{DISPLAYTITLE:Integer Factoring (Integer Factoring)}} == Description == Given an $n$-bit integer $N$, find a non-trivial factorization $N=pq$ (where $p, q>1$ are integers) or return that $N$ is prime. For "first category" algorithms, the running time depends on the size of smallest prime factor. == Related Problems == Related: Smallest Factor == Parameters == <pre>n: number of bits in the integer B: bound parameter (if needed)</pre> == Table of Algorithms =..."