crypto-primes 0.7.1

Random prime number generation and primality checking library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12

use crypto_bigint::{Unsigned, Word};

pub(crate) fn first_limb<T: Unsigned>(num: &T) -> Word {
    num.as_limbs().first().expect("a big integer has at least one limb").0
}

pub(crate) fn equals_primitive<T>(num: &T, primitive: Word) -> bool
where
    T: Unsigned,
{
    num.bits_vartime() <= Word::BITS && first_limb(num) == primitive
}