pumpkin 2.0.1

A cryptographically secure prime number generator
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

//! Generates cryptographically secure prime numbers.

use rand::OsRng;

pub use common::gen_prime as from_rng;
use error::{Error, Result};

/// Constructs a new prime number with a size of `bit_length` bits.
///
/// This will initialize an `OsRng` instance and call the
/// `from_rng()` function.
///
/// Note: the `bit_length` MUST be at least 512-bits.
pub fn new(bit_length: usize) -> Result {
    if bit_length < 512 {
        Err(Error::BitLength(bit_length))
    } else {
        let mut rngesus = try!(OsRng::new());
        Ok(try!(from_rng(bit_length, &mut rngesus)))
    }
}

#[cfg(test)]
mod tests {
    use super::new;

    #[test]
    fn test_prime_bit_length_too_small() {
        let p = new(511);
        assert_eq!(false, match p {
            Ok(_) => true,
            Err(_) => false,
        });
    }

    #[test]
    fn test_prime() {
        let p = new(512);
        assert_eq!(true, match p {
            Ok(_) => true,
            Err(_) => false
        });
    }
}