Updated the title

ekera · web-flow · commit eba612c4e876 · 2024-08-28T14:58:21.000+02:00
diff --git a/README.md b/README.md
@@ -1,4 +1,4 @@
-# On completely factoring any integer efficiently in a single run of an order-finding algorithm
+# The Factoritall collection of Sage scripts
 From the abstract of [[E21b]](https://doi.org/10.1007/s11128-021-03069-1): "We show that given the order of a single element selected uniformly at random from $\mathbb Z_N^*$, we can with very high probability, and for any integer $N$, efficiently find the complete factorization of $N$ in polynomial time.
 This implies that a single run of the quantum part of Shor's factoring algorithm is usually sufficient.
 All prime factors of $N$ can then be recovered with negligible computational cost in a classical post-processing step.

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# On completely factoring any integer efficiently in a single run of an order-finding algorithm`
	`1`	`+# The Factoritall collection of Sage scripts`
`2`	`2`	`From the abstract of [[E21b]](https://doi.org/10.1007/s11128-021-03069-1): "We show that given the order of a single element selected uniformly at random from $\mathbb Z_N^*$, we can with very high probability, and for any integer $N$, efficiently find the complete factorization of $N$ in polynomial time.`
`3`	`3`	`This implies that a single run of the quantum part of Shor's factoring algorithm is usually sufficient.`
`4`	`4`	`All prime factors of $N$ can then be recovered with negligible computational cost in a classical post-processing step.`