qfall-math 0.1.1

Mathematical foundations for rapid prototyping of 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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64

// Copyright © 2023 Marvin Beckmann
//
// This file is part of qFALL-math.
//
// qFALL-math is free software: you can redistribute it and/or modify it under
// the terms of the Mozilla Public License Version 2.0 as published by the
// Mozilla Foundation. See <https://mozilla.org/en-US/MPL/2.0/>.

//! Create benchmark for [`MatZq::solve_gaussian_elimination`] in this file.

use criterion::*;
use qfall_math::integer_mod_q::MatZq;
use std::{fs::File, io::Read};

/// Benchmark [`MatZq::solve_gaussian_elimination`]
///
/// We uniformly sampled a matrix `A` and a vector `u`.
/// Then we computed a target `v = A*u` and saved both as matrices.
/// This benchmark loads both strings and runs the solve function to determine
/// the time it takes to produce a solution.
pub fn bench_solve(c: &mut Criterion) {
    let mut matrix = String::new();
    let mut f_matrix = File::open("benches/matrix.txt").expect("Unable to open file");
    f_matrix
        .read_to_string(&mut matrix)
        .expect("Unable to read string");
    let matrix: MatZq = serde_json::from_str(&matrix).unwrap();
    let mut target = String::new();
    let mut f_target = File::open("benches/target.txt").expect("Unable to open file");
    f_target
        .read_to_string(&mut target)
        .expect("Unable to read string");

    let target: MatZq = serde_json::from_str(&target).unwrap();

    c.bench_function("Solve 100x200 mod 4096", |b| {
        b.iter(|| matrix.solve_gaussian_elimination(&target))
    });
}

/// Benchmark [`MatZq::inverse`]
///
/// We uniformly sample a matrix `A` of dimension `300x300` and invert it.
/// Only the inversion time is benchmarked.
pub fn bench_inverse(c: &mut Criterion) {
    let n = 300;
    let q = 7;

    c.bench_function("Inverse Matrix", |b| {
        b.iter_batched(
            || {
                let mut matrix = MatZq::sample_uniform(n, n, q);
                while matrix.get_representative_least_absolute_residue().rank() < n {
                    matrix = MatZq::sample_uniform(n, n, q);
                }
                matrix
            },
            |matrix| matrix.inverse(),
            BatchSize::SmallInput,
        );
    });
}

criterion_group!(benches, bench_solve, bench_inverse);