Struct MillerRabin

pub struct MillerRabin<T: Integer> { /* private fields */ }

Precomputed data used to perform Miller-Rabin primality test¹.

The numbers that pass it are commonly called “strong probable primes” (or “strong pseudoprimes” if they are, in fact, composite).

C. Pomerance, J. L. Selfridge, S. S. Wagstaff “The Pseudoprimes to 25*10^9”, Math. Comp. 35 1003-1026 (1980), DOI: 10.2307/2006210

---

1.  ↩

Implementations

impl<T: Integer + RandomMod> MillerRabin<T>

pub fn new(candidate: Odd<T>) -> Self

Initializes a Miller-Rabin test for candidate.

pub fn test(&self, base: &T) -> Primality

Perform a Miller-Rabin check with a given base.

pub fn test_base_two(&self) -> Primality

Perform a Miller-Rabin check with base 2.

pub fn test_random_base( &self, rng: &mut (impl CryptoRngCore + ?Sized), ) -> Primality

Perform a Miller-Rabin check with a random base (in the range [3, candidate-2]) drawn using the provided RNG.

Note: panics if candidate == 3 (so the range above is empty).

Trait Implementations

impl<T: Clone + Integer> Clone for MillerRabin<T>

fn clone(&self) -> MillerRabin<T>

Returns a duplicate of the value.

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Integer> Debug for MillerRabin<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: PartialEq + Integer> PartialEq for MillerRabin<T>

fn eq(&self, other: &MillerRabin<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

const fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq + Integer> Eq for MillerRabin<T>

impl<T: Integer> StructuralPartialEq for MillerRabin<T>