A module for factoring an integer N given the order r of an element g selected uniformly at random from the multiplicative group of the ring of integers modulo N.
import quaspy.factoring.general.postprocessing
-
A module for factoring N completely given the order r of an element g selected uniformly at random from the multiplicative group of the ring of integers modulo N, where g need not be explicitly specified. This by using the algorithm in [E21b].
-
A module for splitting N, given the order r of an element g selected uniformly at random from the multiplicative group of the ring of integers modulo N, where g must be explicitly specified. This by using the original algorithm in [Shor94].