bgv-rs

An efficient FHE library

Quickstart

[dependencies]
bgv = "0.1.0"

Example

use rand::Rng;
use bgv::{math, BGV};

const T: u64 = 65537; // plaintext modulus
const N: usize = 1024; // polynomial degree
const L: usize = 15; // levels
const NBITS: u8 = 50; // small prime bit length
const MU: f64 = 0.0; // sampling mean
const SIGMA: f64 = 3.19; // sampling std. dev

let mut rng = rand::thread_rng();
let b = BGV::new(N, L, NBITS, MU, SIGMA, T);
let k = b.key_gen(); // generate keys

let m1: Vec<u64> = (0..N).map(|_| rng.gen_range(0..T) as u64).collect();
let m2: Vec<u64> = (0..N).map(|_| rng.gen_range(0..T) as u64).collect();
let sum: Vec<u64> = (0..N).map(|i| math::modadd(m1[i], m2[i], T)).collect();

let (a0, a1) = b.encrypt(&m1, &k.pk);
let (b0, b1) = b.encrypt(&m2, &k.pk);
let (c0, c1) = b.add(&a0, &a1, &b0, &b1); // homomorphic addition

let m3 = b.decrypt(&c0, &c1, &k.s);
assert_eq!(m3, sum);