rustpq 0.3.0

Pure Rust post-quantum cryptography suite - ML-KEM, ML-DSA, and more
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
65
66

use super::ntt;
use super::params::N;
use super::poly::Poly;
use super::reduce::barrett_reduce;
use zeroize::Zeroize;

#[derive(Clone, Zeroize)]
pub struct PolyVec<const K: usize> {
    pub vec: [Poly; K],
}

impl<const K: usize> Default for PolyVec<K> {
    fn default() -> Self {
        Self::new()
    }
}

impl<const K: usize> PolyVec<K> {
    pub fn new() -> Self {
        Self {
            vec: core::array::from_fn(|_| Poly::new()),
        }
    }

    pub fn ntt(&mut self) {
        for i in 0..K {
            ntt::ntt(&mut self.vec[i]);
        }
    }

    pub fn inv_ntt(&mut self) {
        for i in 0..K {
            ntt::inv_ntt(&mut self.vec[i]);
        }
    }

    pub fn reduce(&mut self) {
        for i in 0..K {
            self.vec[i].reduce();
        }
    }

    pub fn add(&mut self, b: &PolyVec<K>) {
        for i in 0..K {
            self.vec[i].add(&b.vec[i]);
        }
    }

    pub fn cond_sub_q(&mut self) {
        for i in 0..K {
            self.vec[i].cond_sub_q();
        }
    }

    pub fn pointwise_acc_montgomery(&self, b: &PolyVec<K>) -> Poly {
        let mut r = ntt::basemul(&self.vec[0], &b.vec[0]);
        for i in 1..K {
            let t = ntt::basemul(&self.vec[i], &b.vec[i]);
            r.add(&t);
        }
        for i in 0..N {
            r.coeffs[i] = barrett_reduce(r.coeffs[i]);
        }
        r
    }
}