加入
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.
| 1 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "algorithms-complexity", |
| 5 | "number-theory" |
| 6 | ], |
| 7 | "type": "algorithm", |
| 8 | "source": { |
| 9 | "key": "frontiermath-open", |
| 10 | "name": "FrontierMath: Open Problems", |
| 11 | "url": "https://epoch.ai/frontiermath/open-problems/prime-factorization", |
| 12 | "id": "prime-factorization", |
| 13 | "curator": "Epoch AI", |
| 14 | "status": "unsolved", |
| 15 | "as_of": "2026-10-20", |
| 16 | "catalog": "0521c19bbd38" |
| 17 | }, |
| 18 | "review": true, |
| 19 | "approval": "first-time" |
| 20 | } |