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

// Copyright © 2023 Sven Moog
//
// 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/>.

//! This file collects the benchmarks from other files.

use criterion::criterion_main;

pub mod basis_reductions;
pub mod cholesky_decomposition;
pub mod classic_crypto;
pub mod integer;
pub mod matrix_arith;
pub mod ntt_multiplication;
pub mod sample_z;
pub mod sampling;
pub mod solve;
pub mod uniform;

criterion_main! {
    integer::benches,
    classic_crypto::benches,
    sampling::benches,
    solve::benches,
    cholesky_decomposition::benches,
    sample_z::benches,
    basis_reductions::benches,
    matrix_arith::benches,
    uniform::benches,
    ntt_multiplication::benches
}