composite_modulus_proofs 0.1.0

Proofs about several propoerties of a composite modulus - square-free, product of 2 primes, a blum integer
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

#[cfg(feature = "parallel")]
#[macro_export]
macro_rules! join {
    ($a: expr, $b: expr) => {
        rayon::join(|| $a, || $b)
    };
}

#[cfg(not(feature = "parallel"))]
#[macro_export]
macro_rules! join {
    ($a: expr, $b: expr) => {
        ($a, $b)
    };
}

#[macro_export]
macro_rules! report_error_if_any {
    ( $res:ident ) => {{
        #[cfg(feature = "parallel")]
        if let Some(e) = $res.find_any(|r| r.is_err()) {
            e
        } else {
            Ok(())
        }

        #[cfg(not(feature = "parallel"))]
        if let Some(e) = $res.find(|r| r.is_err()) {
            e
        } else {
            Ok(())
        }
    }};
}

// Taken from safegcd.rs in crypto-bigint. Used to find out the limbs needed to perform modular
// inversion using SafeGcdInverter
#[cfg(test)]
#[macro_export]
macro_rules! safegcd_nlimbs {
    ($bits:expr) => {
        ($bits + 64).div_ceil(62)
    };
}