poulpy/base2k/examples/rlwe_encrypt.rs
base2k/examples/rlwe_encrypt.rsRaw
1use base2k::{
2 Encoding, FFT64, Module, Sampling, Scalar, ScalarZnxDft, ScalarZnxDftOps, VecZnx, VecZnxBig, VecZnxBigOps, VecZnxDft,
3 VecZnxDftOps, VecZnxOps, ZnxInfos, alloc_aligned,
4};
5use itertools::izip;
6use sampling::source::Source;
7
8fn main() {
9 let n: usize = 16;
10 let log_base2k: usize = 18;
11 let ct_size: usize = 3;
12 let msg_size: usize = 2;
13 let log_scale: usize = msg_size * log_base2k - 5;
14 let module: Module<FFT64> = Module::<FFT64>::new(n);
15
16 let mut carry: Vec<u8> = alloc_aligned(module.vec_znx_big_normalize_tmp_bytes());
17
18 let seed: [u8; 32] = [0; 32];
19 let mut source: Source = Source::new(seed);
20
21 // s <- Z_{-1, 0, 1}[X]/(X^{N}+1)
22 let mut s: Scalar = Scalar::new(n);
23 s.fill_ternary_prob(0.5, &mut source);
24
25 // Buffer to store s in the DFT domain
26 let mut s_ppol: ScalarZnxDft<FFT64> = module.new_svp_ppol();
27
28 // s_ppol <- DFT(s)
29 module.svp_prepare(&mut s_ppol, &s);
30
31 // Allocates a VecZnx with two columns: ct=(0, 0)
32 let mut ct: VecZnx = module.new_vec_znx(
33 2, // Number of columns
34 ct_size, // Number of small poly per column
35 );
36
37 // Fill the second column with random values: ct = (0, a)
38 module.fill_uniform(log_base2k, &mut ct, 1, ct_size, &mut source);
39
40 // Scratch space for DFT values
41 let mut buf_dft: VecZnxDft<FFT64> = module.new_vec_znx_dft(
42 1, // Number of columns
43 ct.size(), // Number of polynomials per column
44 );
45
46 // Applies DFT(ct[1]) * DFT(s)
47 module.svp_apply_dft(
48 &mut buf_dft, // DFT(ct[1] * s)
49 &s_ppol, // DFT(s)
50 &ct,
51 1, // Selects the second column of ct
52 );
53
54 // Alias scratch space (VecZnxDft<B> is always at least as big as VecZnxBig<B>)
55 let mut buf_big: VecZnxBig<FFT64> = buf_dft.as_vec_znx_big();
56
57 // BIG(ct[1] * s) <- IDFT(DFT(ct[1] * s)) (not normalized)
58 module.vec_znx_idft_tmp_a(&mut buf_big, &mut buf_dft);
59
60 // Creates a plaintext: VecZnx with 1 column
61 let mut m: VecZnx = module.new_vec_znx(
62 1, // Number of columns
63 msg_size, // Number of small polynomials
64 );
65 let mut want: Vec<i64> = vec![0; n];
66 want.iter_mut()
67 .for_each(|x| *x = source.next_u64n(16, 15) as i64);
68 m.encode_vec_i64(0, log_base2k, log_scale, &want, 4);
69 m.normalize(log_base2k, &mut carry);
70
71 // m - BIG(ct[1] * s)
72 module.vec_znx_big_sub_small_a_inplace(
73 &mut buf_big,
74 0, // Selects the first column of the receiver
75 &m,
76 0, // Selects the first column of the message
77 );
78
79 // Normalizes back to VecZnx
80 // ct[0] <- m - BIG(c1 * s)
81 module.vec_znx_big_normalize(
82 log_base2k, &mut ct, 0, // Selects the first column of ct (ct[0])
83 &buf_big, 0, // Selects the first column of buf_big
84 &mut carry,
85 );
86
87 // Add noise to ct[0]
88 // ct[0] <- ct[0] + e
89 module.add_normal(
90 log_base2k,
91 &mut ct,
92 0, // Selects the first column of ct (ct[0])
93 log_base2k * ct_size, // Scaling of the noise: 2^{-log_base2k * limbs}
94 &mut source,
95 3.2, // Standard deviation
96 19.0, // Truncatation bound
97 );
98
99 // Final ciphertext: ct = (-a * s + m + e, a)
100
101 // Decryption
102
103 // DFT(ct[1] * s)
104 module.svp_apply_dft(
105 &mut buf_dft,
106 &s_ppol,
107 &ct,
108 1, // Selects the second column of ct (ct[1])
109 );
110
111 // BIG(c1 * s) = IDFT(DFT(c1 * s))
112 module.vec_znx_idft_tmp_a(&mut buf_big, &mut buf_dft);
113
114 // BIG(c1 * s) + ct[0]
115 module.vec_znx_big_add_small_inplace(&mut buf_big, 0, &ct, 0);
116
117 // m + e <- BIG(ct[1] * s + ct[0])
118 let mut res: VecZnx = module.new_vec_znx(1, ct_size);
119 module.vec_znx_big_normalize(log_base2k, &mut res, 0, &buf_big, 0, &mut carry);
120
121 // have = m * 2^{log_scale} + e
122 let mut have: Vec<i64> = vec![i64::default(); n];
123 res.decode_vec_i64(0, log_base2k, res.size() * log_base2k, &mut have);
124
125 let scale: f64 = (1 << (res.size() * log_base2k - log_scale)) as f64;
126 izip!(want.iter(), have.iter())
127 .enumerate()
128 .for_each(|(i, (a, b))| {
129 println!("{}: {} {}", i, a, (*b as f64) / scale);
130 })
131}