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
Oct 2, 2024 - Sage
#
shors-algorithm
Here are 2 public repositories matching this topic...
Sage scripts for completely factoring any integer efficiently with very high probability after a single run of an order-finding algorithm.
-
Updated
Aug 28, 2024 - Sage
Improve this page
Add a description, image, and links to the shors-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the shors-algorithm topic, visit your repo's landing page and select "manage topics."