1use base2k::{
  2    Encoding, FFT64, Module, Sampling, Scalar, ScalarOps, ScalarZnxDft, ScalarZnxDftOps, VecZnx, VecZnxBig, VecZnxBigOps,
  3    VecZnxDft, 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 = module.new_scalar(1);
 23    s.fill_ternary_prob(0, 0.5, &mut source);
 24
 25    // Buffer to store s in the DFT domain
 26    let mut s_dft: ScalarZnxDft<FFT64> = module.new_scalar_znx_dft(s.cols());
 27
 28    // s_dft <- DFT(s)
 29    module.svp_prepare(&mut s_dft, 0, &s, 0);
 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        0,            // Selects the first column of res
 50        &s_dft,       // DFT(s)
 51        0,            // Selects the first column of s_dft
 52        &ct,
 53        1, // Selects the second column of ct
 54    );
 55
 56    // Alias scratch space (VecZnxDft<B> is always at least as big as VecZnxBig<B>)
 57    let mut buf_big: VecZnxBig<FFT64> = buf_dft.alias_as_vec_znx_big();
 58
 59    // BIG(ct[1] * s) <- IDFT(DFT(ct[1] * s)) (not normalized)
 60    module.vec_znx_idft_tmp_a(&mut buf_big, 0, &mut buf_dft, 0);
 61
 62    // Creates a plaintext: VecZnx with 1 column
 63    let mut m: VecZnx = module.new_vec_znx(
 64        1,        // Number of columns
 65        msg_size, // Number of small polynomials
 66    );
 67    let mut want: Vec<i64> = vec![0; n];
 68    want.iter_mut()
 69        .for_each(|x| *x = source.next_u64n(16, 15) as i64);
 70    m.encode_vec_i64(0, log_base2k, log_scale, &want, 4);
 71    m.normalize(log_base2k, &mut carry);
 72
 73    // m - BIG(ct[1] * s)
 74    module.vec_znx_big_sub_small_a_inplace(
 75        &mut buf_big,
 76        0, // Selects the first column of the receiver
 77        &m,
 78        0, // Selects the first column of the message
 79    );
 80
 81    // Normalizes back to VecZnx
 82    // ct[0] <- m - BIG(c1 * s)
 83    module.vec_znx_big_normalize(
 84        log_base2k, &mut ct, 0, // Selects the first column of ct (ct[0])
 85        &buf_big, 0, // Selects the first column of buf_big
 86        &mut carry,
 87    );
 88
 89    // Add noise to ct[0]
 90    // ct[0] <- ct[0] + e
 91    module.add_normal(
 92        log_base2k,
 93        &mut ct,
 94        0,                    // Selects the first column of ct (ct[0])
 95        log_base2k * ct_size, // Scaling of the noise: 2^{-log_base2k * limbs}
 96        &mut source,
 97        3.2,  // Standard deviation
 98        19.0, // Truncatation bound
 99    );
100
101    // Final ciphertext: ct = (-a * s + m + e, a)
102
103    // Decryption
104
105    // DFT(ct[1] * s)
106    module.svp_apply_dft(
107        &mut buf_dft,
108        0, // Selects the first column of res.
109        &s_dft,
110        0,
111        &ct,
112        1, // Selects the second column of ct (ct[1])
113    );
114
115    // BIG(c1 * s) = IDFT(DFT(c1 * s))
116    module.vec_znx_idft_tmp_a(&mut buf_big, 0, &mut buf_dft, 0);
117
118    // BIG(c1 * s) + ct[0]
119    module.vec_znx_big_add_small_inplace(&mut buf_big, 0, &ct, 0);
120
121    // m + e <- BIG(ct[1] * s + ct[0])
122    let mut res: VecZnx = module.new_vec_znx(1, ct_size);
123    module.vec_znx_big_normalize(log_base2k, &mut res, 0, &buf_big, 0, &mut carry);
124
125    // have = m * 2^{log_scale} + e
126    let mut have: Vec<i64> = vec![i64::default(); n];
127    res.decode_vec_i64(0, log_base2k, res.size() * log_base2k, &mut have);
128
129    let scale: f64 = (1 << (res.size() * log_base2k - log_scale)) as f64;
130    izip!(want.iter(), have.iter())
131        .enumerate()
132        .for_each(|(i, (a, b))| {
133            println!("{}: {} {}", i, a, (*b as f64) / scale);
134        })
135}