Factoring integers much faster than the number field sieve
Factor large semiprimes about 160,000 times faster than the elliptic curve method or the number field sieve would on the same machine.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.