1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

#![deny(
    warnings,
    missing_docs,
    unsafe_code,
    unused_import_braces,
    unused_qualifications,
    trivial_casts,
    trivial_numeric_casts
)]
//! A crate for generating large prime numbers, suitable for cryptography.
//!
//! Primes are generated similarly to OpenSSL except it applies some recommendations
//! from the [Prime and Prejudice](https://eprint.iacr.org/2018/749.pdf).
//!
//! 1. Generate a random odd number of a given bit-length.
//! 2. Divide the candidate by the first 2048 prime numbers
//! 3. Test the candidate with Fermat's Theorem.
//! 4. Runs Baillie-PSW test with `log2(bits) + 5` Miller-Rabin tests

mod common;
pub mod error;
pub mod prime;
mod rand;
pub mod safe_prime;