Rust program to find pseudoprimes that pass fixed Miller Rabin bases
-
Updated
Sep 12, 2022 - Rust
Rust program to find pseudoprimes that pass fixed Miller Rabin bases
A Rust implementation of the Miller-Rabin primality test algorithm. 100% working plug-and-play.
An implementation of the Miller-Rabin primality test for `num_bigint::BigUint`
Finds the next prime(s) given an initial prime.
Add a description, image, and links to the miller-rabin topic page so that developers can more easily learn about it.
To associate your repository with the miller-rabin topic, visit your repo's landing page and select "manage topics."