The Sage implementation of a simulator for Regev's factoring algorithm, and of Ekerå–Gärtner's extensions to discrete logarithm finding, order finding and factoring via order finding.
-
Updated
May 30, 2024 - Sage
The Sage implementation of a simulator for Regev's factoring algorithm, and of Ekerå–Gärtner's extensions to discrete logarithm finding, order finding and factoring via order finding.
Sage scripts for completely factoring any integer efficiently with very high probability after a single run of an order-finding algorithm.
Add a description, image, and links to the factoring-integers topic page so that developers can more easily learn about it.
To associate your repository with the factoring-integers topic, visit your repo's landing page and select "manage topics."