Function discrete_logarithm::n_order
source · pub fn n_order(a: &Integer, n: &Integer) -> Result<Integer, Error>Expand description
Returns the order of a modulo n.
The order of a modulo n is the smallest integer k such that a**k leaves a remainder of 1 with n.