ntrulp 0.2.5

Pure implementation of high-security prime-degree large-Galois-group inert-modulus ideal-lattice-based cryptography.
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

use ntrulp::key::priv_key::PrivKey;
use ntrulp::key::pub_key::PubKey;
use ntrulp::poly::r3::R3;
use ntrulp::poly::rq::Rq;
use ntrulp::rng::{random_small, short_random};

fn main() {
    let mut rng = rand::rng();
    let f: Rq = Rq::from(short_random(&mut rng).unwrap());
    let mut g: R3;
    let sk = loop {
        // use a loop because there are no guarantees that
        // the random number generator will produce the correct
        // combination that can enter and combine with f.
        g = R3::from(random_small(&mut rng));

        match PrivKey::compute(&f, &g) {
            Ok(s) => break s,
            Err(_) => continue,
        };
    };

    // if you have f, and g use compute, because it is faster!
    let pk = PubKey::compute(&f, &g).unwrap();

    // create PubKey from secret key.
    let imported_pk = PubKey::from_sk(&sk).unwrap();

    // convert to bytes
    let pk_bytes = imported_pk.to_bytes();

    // restore from bytes.
    let from_bytes: PubKey = pk_bytes.into();

    assert_eq!(from_bytes.coeffs, pk.coeffs);
}