arnaucube/phantom-zone
1
0
Fork 0
mirror of https://github.com/arnaucube/phantom-zone.git synced 2026-01-09 15:41:30 +01:00
Code Issues Projects Releases Wiki Activity

prolly a mistake

Browse Source
This commit is contained in:
Janmajaya Mall
2024-06-11 11:24:03 +05:30
parent a6ced5c036
commit 80ae5d7c8f
6 changed files with 133 additions and 104 deletions
Download Patch File Download Diff File Expand all files Collapse all files

86
src/bool/evaluator.rs
View File

@@ -15,7 +15,9 @@ use num_traits::{FromPrimitive, Num, One, Pow, PrimInt, ToPrimitive, WrappingSub
use rand_distr::uniform::SampleUniform; use rand_distr::uniform::SampleUniform;
use crate::{ use crate::{
backend::{ArithmeticOps, GetModulus, ModInit, ModularOpsU64, Modulus, VectorOps}, backend::{
ArithmeticOps, GetModulus, ModInit, ModularOpsU64, Modulus, ShoupMatrixFMA, VectorOps,
},
decomposer::{Decomposer, DefaultDecomposer, NumInfo, RlweDecomposer}, decomposer::{Decomposer, DefaultDecomposer, NumInfo, RlweDecomposer},
lwe::{decrypt_lwe, encrypt_lwe, lwe_key_switch, lwe_ksk_keygen, measure_noise_lwe, LweSecret}, lwe::{decrypt_lwe, encrypt_lwe, lwe_key_switch, lwe_ksk_keygen, measure_noise_lwe, LweSecret},
multi_party::public_key_share, multi_party::public_key_share,
@@ -43,6 +45,7 @@ use super::{
parameters::{BoolParameters, CiphertextModulus}, parameters::{BoolParameters, CiphertextModulus},
CommonReferenceSeededCollectivePublicKeyShare, CommonReferenceSeededMultiPartyServerKeyShare, CommonReferenceSeededCollectivePublicKeyShare, CommonReferenceSeededMultiPartyServerKeyShare,
SeededMultiPartyServerKey, SeededServerKey, ServerKeyEvaluationDomain, SeededMultiPartyServerKey, SeededServerKey, ServerKeyEvaluationDomain,
ShoupServerKeyEvaluationDomain,
}; };
pub struct MultiPartyCrs<S> { pub struct MultiPartyCrs<S> {
@@ -78,7 +81,7 @@ impl<S: Default + Copy> MultiPartyCrs<S> {
pub(crate) trait BooleanGates { pub(crate) trait BooleanGates {
type Ciphertext: RowEntity; type Ciphertext: RowEntity;
type Key; type Key: Global;
fn and_inplace(&mut self, c0: &mut Self::Ciphertext, c1: &Self::Ciphertext, key: &Self::Key); fn and_inplace(&mut self, c0: &mut Self::Ciphertext, c1: &Self::Ciphertext, key: &Self::Key);
fn nand_inplace(&mut self, c0: &mut Self::Ciphertext, c1: &Self::Ciphertext, key: &Self::Key); fn nand_inplace(&mut self, c0: &mut Self::Ciphertext, c1: &Self::Ciphertext, key: &Self::Key);
@@ -231,12 +234,12 @@ pub(super) struct BoolPbsInfo<M: Matrix, Ntt, RlweModOp, LweModOp> {
impl<M: Matrix, NttOp, RlweModOp, LweModOp> PbsInfo for BoolPbsInfo<M, NttOp, RlweModOp, LweModOp> impl<M: Matrix, NttOp, RlweModOp, LweModOp> PbsInfo for BoolPbsInfo<M, NttOp, RlweModOp, LweModOp>
where where
M::MatElement: PrimInt + WrappingSub + NumInfo + FromPrimitive + From<bool> + Display, M::MatElement: PrimInt + WrappingSub + NumInfo + FromPrimitive + From<bool> + Display,
RlweModOp: ArithmeticOps<Element = M::MatElement> + VectorOps<Element = M::MatElement>, RlweModOp: ArithmeticOps<Element = M::MatElement> + ShoupMatrixFMA<M::R>,
LweModOp: ArithmeticOps<Element = M::MatElement> + VectorOps<Element = M::MatElement>, LweModOp: ArithmeticOps<Element = M::MatElement> + VectorOps<Element = M::MatElement>,
NttOp: Ntt<Element = M::MatElement>, NttOp: Ntt<Element = M::MatElement>,
{ {
type M = M;
type Modulus = CiphertextModulus<M::MatElement>; type Modulus = CiphertextModulus<M::MatElement>;
type Element = M::MatElement;
type D = DefaultDecomposer<M::MatElement>; type D = DefaultDecomposer<M::MatElement>;
type RlweModOp = RlweModOp; type RlweModOp = RlweModOp;
type LweModOp = LweModOp; type LweModOp = LweModOp;
@@ -291,7 +294,7 @@ where
} }
} }
pub(crate) struct BoolEvaluator<M, Ntt, RlweModOp, LweModOp> pub(crate) struct BoolEvaluator<Info, SKey>
where where
M: Matrix, M: Matrix,
{ {
@@ -316,7 +319,7 @@ impl<M: Matrix, NttOp, RlweModOp, LweModOp> BoolEvaluator<M, NttOp, RlweModOp, L
} }
} }
impl<M: Matrix, NttOp, RlweModOp, LweModOp> BoolEvaluator<M, NttOp, RlweModOp, LweModOp> impl<M: Matrix, NttOp, RlweModOp, LweModOp, SKey> BoolEvaluator<M, NttOp, RlweModOp, LweModOp, SKey>
where where
M: MatrixEntity + MatrixMut, M: MatrixEntity + MatrixMut,
M::MatElement: PrimInt M::MatElement: PrimInt
@@ -330,7 +333,8 @@ where
NttOp: Ntt<Element = M::MatElement>, NttOp: Ntt<Element = M::MatElement>,
RlweModOp: ArithmeticOps<Element = M::MatElement> RlweModOp: ArithmeticOps<Element = M::MatElement>
+ VectorOps<Element = M::MatElement> + VectorOps<Element = M::MatElement>
+ GetModulus<Element = M::MatElement, M = CiphertextModulus<M::MatElement>>, + GetModulus<Element = M::MatElement, M = CiphertextModulus<M::MatElement>>
+ ShoupMatrixFMA<M::R>,
LweModOp: ArithmeticOps<Element = M::MatElement> LweModOp: ArithmeticOps<Element = M::MatElement>
+ VectorOps<Element = M::MatElement> + VectorOps<Element = M::MatElement>
+ GetModulus<Element = M::MatElement, M = CiphertextModulus<M::MatElement>>, + GetModulus<Element = M::MatElement, M = CiphertextModulus<M::MatElement>>,
@@ -1083,12 +1087,8 @@ where
M: MatrixMut + MatrixEntity, M: MatrixMut + MatrixEntity,
M::R: RowMut + RowEntity, M::R: RowMut + RowEntity,
M::MatElement: PrimInt + FromPrimitive + One + Copy + Zero + Display + WrappingSub + NumInfo, M::MatElement: PrimInt + FromPrimitive + One + Copy + Zero + Display + WrappingSub + NumInfo,
RlweModOp: VectorOps<Element = M::MatElement> RlweModOp: VectorOps<Element = M::MatElement> + ArithmeticOps<Element = M::MatElement>,
+ ArithmeticOps<Element = M::MatElement> LweModOp: VectorOps<Element = M::MatElement> + ArithmeticOps<Element = M::MatElement>,
+ GetModulus<Element = M::MatElement, M = CiphertextModulus<M::MatElement>>,
LweModOp: VectorOps<Element = M::MatElement>
+ ArithmeticOps<Element = M::MatElement>
+ GetModulus<Element = M::MatElement, M = CiphertextModulus<M::MatElement>>,
NttOp: Ntt<Element = M::MatElement>, NttOp: Ntt<Element = M::MatElement>,
{ {
/// Returns c0 + c1 + Q/4 /// Returns c0 + c1 + Q/4
@@ -1118,14 +1118,12 @@ where
PrimInt + FromPrimitive + One + Copy + Zero + Display + WrappingSub + NumInfo + From<bool>, PrimInt + FromPrimitive + One + Copy + Zero + Display + WrappingSub + NumInfo + From<bool>,
RlweModOp: VectorOps<Element = M::MatElement> RlweModOp: VectorOps<Element = M::MatElement>
+ ArithmeticOps<Element = M::MatElement> + ArithmeticOps<Element = M::MatElement>
+ GetModulus<Element = M::MatElement, M = CiphertextModulus<M::MatElement>>, + ShoupMatrixFMA<M::R>,
LweModOp: VectorOps<Element = M::MatElement> LweModOp: VectorOps<Element = M::MatElement> + ArithmeticOps<Element = M::MatElement>,
+ ArithmeticOps<Element = M::MatElement>
+ GetModulus<Element = M::MatElement, M = CiphertextModulus<M::MatElement>>,
NttOp: Ntt<Element = M::MatElement>, NttOp: Ntt<Element = M::MatElement>,
{ {
type Ciphertext = M::R; type Ciphertext = M::R;
type Key = ServerKeyEvaluationDomain<M, BoolParameters<u64>, DefaultSecureRng, NttOp>; type Key = Key;
fn nand_inplace(&mut self, c0: &mut M::R, c1: &M::R, server_key: &Self::Key) { fn nand_inplace(&mut self, c0: &mut M::R, c1: &M::R, server_key: &Self::Key) {
self._add_and_shift_lwe_cts(c0, c1); self._add_and_shift_lwe_cts(c0, c1);
@@ -1307,7 +1305,7 @@ where
// self, measure_noise, public_key_encrypt_rlwe, // self, measure_noise, public_key_encrypt_rlwe,
// secret_key_encrypt_rlwe, tests::{_measure_noise_rgsw, // secret_key_encrypt_rlwe, tests::{_measure_noise_rgsw,
// _sk_encrypt_rlwe}, RgswCiphertext, // _sk_encrypt_rlwe}, RgswCiphertext,
// RgswCiphertextEvaluationDomain, SeededRgswCiphertext, // RgswCiphertextEvaluationDomain, SeededRgswCiphertext,
// SeededRlweCiphertext, }, // SeededRlweCiphertext, },
// utils::{negacyclic_mul, Stats}, // utils::{negacyclic_mul, Stats},
// }; // };
@@ -1439,7 +1437,7 @@ where
// let public_key_share = parties // let public_key_share = parties
// .iter() // .iter()
// .map(|k| // .map(|k|
// bool_evaluator.multi_party_public_key_share(pk_cr_seed, k)) // bool_evaluator.multi_party_public_key_share(pk_cr_seed, k))
// .collect_vec(); // .collect_vec();
// let collective_pk = PublicKey::< // let collective_pk = PublicKey::<
@@ -1559,7 +1557,7 @@ where
// &collective_pk.key(), k) }) // &collective_pk.key(), k) })
// .collect_vec(); // .collect_vec();
// let seeded_server_key = // let seeded_server_key =
// //
// bool_evaluator.aggregate_multi_party_server_key_shares(&server_key_shares); // bool_evaluator.aggregate_multi_party_server_key_shares(&server_key_shares);
// let server_key_eval = ServerKeyEvaluationDomain::<_, // let server_key_eval = ServerKeyEvaluationDomain::<_,
// DefaultSecureRng, NttBackendU64>::from( &seeded_server_key, // DefaultSecureRng, NttBackendU64>::from( &seeded_server_key,
@@ -1570,7 +1568,7 @@ where
// let mut ideal_rlwe_sk = vec![0i32; // let mut ideal_rlwe_sk = vec![0i32;
// bool_evaluator.pbs_info.rlwe_n()]; parties.iter().for_each(|k| { // bool_evaluator.pbs_info.rlwe_n()]; parties.iter().for_each(|k| {
// izip!(ideal_rlwe_sk.iter_mut(), // izip!(ideal_rlwe_sk.iter_mut(),
// k.sk_rlwe().values()).for_each(|(ideal_i, s_i)| { // k.sk_rlwe().values()).for_each(|(ideal_i, s_i)| {
// *ideal_i = *ideal_i + s_i; }); // *ideal_i = *ideal_i + s_i; });
// }); // });
// let mut ideal_lwe_sk = vec![0i32; // let mut ideal_lwe_sk = vec![0i32;
@@ -1628,7 +1626,7 @@ where
// let decryption_shares = parties // let decryption_shares = parties
// .iter() // .iter()
// .map(|k| // .map(|k|
// bool_evaluator.multi_party_decryption_share(&lwe_out, k)) // bool_evaluator.multi_party_decryption_share(&lwe_out, k))
// .collect_vec(); let m_back = // .collect_vec(); let m_back =
// bool_evaluator.multi_party_decrypt(&decryption_shares, &lwe_out); // bool_evaluator.multi_party_decrypt(&decryption_shares, &lwe_out);
@@ -1687,7 +1685,7 @@ where
// let mut ideal_rlwe_sk = vec![0i32; // let mut ideal_rlwe_sk = vec![0i32;
// bool_evaluator.pbs_info.rlwe_n()]; parties.iter().for_each(|k| { // bool_evaluator.pbs_info.rlwe_n()]; parties.iter().for_each(|k| {
// izip!(ideal_rlwe_sk.iter_mut(), // izip!(ideal_rlwe_sk.iter_mut(),
// k.sk_rlwe().values()).for_each(|(ideal_i, s_i)| { // k.sk_rlwe().values()).for_each(|(ideal_i, s_i)| {
// *ideal_i = *ideal_i + s_i; }); // *ideal_i = *ideal_i + s_i; });
// }); // });
// let mut ideal_lwe_sk = vec![0i32; // let mut ideal_lwe_sk = vec![0i32;
@@ -1718,7 +1716,7 @@ where
// let public_key_share = parties // let public_key_share = parties
// .iter() // .iter()
// .map(|k| // .map(|k|
// bool_evaluator.multi_party_public_key_share(pk_cr_seed, k)) // bool_evaluator.multi_party_public_key_share(pk_cr_seed, k))
// .collect_vec(); let collective_pk = PublicKey::< // .collect_vec(); let collective_pk = PublicKey::<
// Vec<Vec<u64>>, // Vec<Vec<u64>>,
// DefaultSecureRng, // DefaultSecureRng,
@@ -1763,7 +1761,7 @@ where
// let public_key_share = parties // let public_key_share = parties
// .iter() // .iter()
// .map(|k| // .map(|k|
// bool_evaluator.multi_party_public_key_share(pk_cr_seed, k)) // bool_evaluator.multi_party_public_key_share(pk_cr_seed, k))
// .collect_vec(); let collective_pk = PublicKey::< // .collect_vec(); let collective_pk = PublicKey::<
// Vec<Vec<u64>>, // Vec<Vec<u64>>,
// DefaultSecureRng, // DefaultSecureRng,
@@ -1780,7 +1778,7 @@ where
// .collect_vec(); // .collect_vec();
// let seeded_server_key = // let seeded_server_key =
// //
// bool_evaluator.aggregate_multi_party_server_key_shares(&server_key_shares); // bool_evaluator.aggregate_multi_party_server_key_shares(&server_key_shares);
// // Check noise in RGSW ciphertexts of ideal LWE secret elements // // Check noise in RGSW ciphertexts of ideal LWE secret elements
@@ -1802,21 +1800,21 @@ where
// // RLWE'(-sm) // // RLWE'(-sm)
// let mut neg_s_eval = // let mut neg_s_eval =
// //
// Vec::<u64>::try_convert_from(ideal_client_key.sk_rlwe().values(), rlwe_q); // Vec::<u64>::try_convert_from(ideal_client_key.sk_rlwe().values(), rlwe_q);
// rlwe_modop.elwise_neg_mut(&mut neg_s_eval); // rlwe_modop.elwise_neg_mut(&mut neg_s_eval);
// rlwe_nttop.forward(&mut neg_s_eval); // rlwe_nttop.forward(&mut neg_s_eval);
// for j in // for j in
// 0..rlwe_rgsw_decomposer.a().decomposition_count() { // 0..rlwe_rgsw_decomposer.a().decomposition_count() {
// // RLWE(B^{j} * -s[X]*X^{s_lwe[i]}) // // RLWE(B^{j} * -s[X]*X^{s_lwe[i]})
// // -s[X]*X^{s_lwe[i]}*B_j // // -s[X]*X^{s_lwe[i]}*B_j
// let mut m_ideal = m_si.clone(); // let mut m_ideal = m_si.clone();
// rlwe_nttop.forward(m_ideal.as_mut_slice()); // rlwe_nttop.forward(m_ideal.as_mut_slice());
// rlwe_modop.elwise_mul_mut(m_ideal.as_mut_slice(), // rlwe_modop.elwise_mul_mut(m_ideal.as_mut_slice(),
// neg_s_eval.as_slice()); // neg_s_eval.as_slice());
// rlwe_nttop.backward(m_ideal.as_mut_slice()); // rlwe_nttop.backward(m_ideal.as_mut_slice());
// rlwe_modop // rlwe_modop
// .elwise_scalar_mul_mut(m_ideal.as_mut_slice(), &rlwe_rgsw_gadget_a[j]); // .elwise_scalar_mul_mut(m_ideal.as_mut_slice(), &rlwe_rgsw_gadget_a[j]);
// // RLWE(-s*X^{s_lwe[i]}*B_j) // // RLWE(-s*X^{s_lwe[i]}*B_j)
@@ -1842,7 +1840,7 @@ where
// // RLWE'(m) // // RLWE'(m)
// for j in // for j in
// 0..rlwe_rgsw_decomposer.b().decomposition_count() { // 0..rlwe_rgsw_decomposer.b().decomposition_count() {
// // RLWE(B^{j} * X^{s_lwe[i]}) // // RLWE(B^{j} * X^{s_lwe[i]})
// // X^{s_lwe[i]}*B_j // // X^{s_lwe[i]}*B_j
@@ -1959,7 +1957,7 @@ where
// ); // );
// rlwe_nttop.forward(m_plus_e_times_m1.as_mut_slice()); // rlwe_nttop.forward(m_plus_e_times_m1.as_mut_slice());
// rlwe_nttop.forward(m1.as_mut_slice()); // rlwe_nttop.forward(m1.as_mut_slice());
// //
// rlwe_modop.elwise_mul_mut(m_plus_e_times_m1.as_mut_slice(), m1.as_slice()); // rlwe_modop.elwise_mul_mut(m_plus_e_times_m1.as_mut_slice(), m1.as_slice());
// rlwe_nttop.backward(m_plus_e_times_m1.as_mut_slice()); // rlwe_nttop.backward(m_plus_e_times_m1.as_mut_slice());
@@ -2010,7 +2008,7 @@ where
// let mut check = Stats { samples: vec![] }; // let mut check = Stats { samples: vec![] };
// let mut neg_s_poly = // let mut neg_s_poly =
// //
// Vec::<u64>::try_convert_from(ideal_client_key.sk_rlwe().values(), rlwe_q); // Vec::<u64>::try_convert_from(ideal_client_key.sk_rlwe().values(), rlwe_q);
// rlwe_modop.elwise_neg_mut(neg_s_poly.as_mut_slice()); // rlwe_modop.elwise_neg_mut(neg_s_poly.as_mut_slice());
@@ -2045,7 +2043,7 @@ where
// auto_gadget.iter().enumerate().for_each(|(i, b_i)| { // auto_gadget.iter().enumerate().for_each(|(i, b_i)| {
// // B^i * -s[X^k] // // B^i * -s[X^k]
// let mut m_ideal = neg_s_poly_auto_i.clone(); // let mut m_ideal = neg_s_poly_auto_i.clone();
// //
// rlwe_modop.elwise_scalar_mul_mut(m_ideal.as_mut_slice(), b_i); // rlwe_modop.elwise_scalar_mul_mut(m_ideal.as_mut_slice(), b_i);
// let mut m_out = vec![0u64; rlwe_n]; // let mut m_out = vec![0u64; rlwe_n];
@@ -2053,14 +2051,8 @@ where
// rlwe_ct[0].copy_from_slice(&auto_key_i[i]); // rlwe_ct[0].copy_from_slice(&auto_key_i[i]);
// rlwe_ct[1].copy_from_slice( // rlwe_ct[1].copy_from_slice(
// &auto_key_i[auto_decomposer.decomposition_count() // &auto_key_i[auto_decomposer.decomposition_count()
// + i], ); // + i], ); decrypt_rlwe( &rlwe_ct,
// decrypt_rlwe( // ideal_client_key.sk_rlwe().values(), &mut m_out, rlwe_nttop, rlwe_modop, );
// &rlwe_ct,
// ideal_client_key.sk_rlwe().values(),
// &mut m_out,
// rlwe_nttop,
// rlwe_modop,
// );
// // diff // // diff
// rlwe_modop.elwise_sub_mut(m_out.as_mut_slice(), // rlwe_modop.elwise_sub_mut(m_out.as_mut_slice(),
@@ -2111,10 +2103,10 @@ where
// let auto_key = // let auto_key =
// server_key_eval_domain.galois_key_for_auto(i); let // server_key_eval_domain.galois_key_for_auto(i); let
// (auto_map_index, auto_map_sign) = // (auto_map_index, auto_map_sign) =
// bool_evaluator.pbs_info.rlwe_auto_map(i); let mut // bool_evaluator.pbs_info.rlwe_auto_map(i); let mut
// scratch = vec![vec![0u64; rlwe_n]; // scratch = vec![vec![0u64; rlwe_n];
// auto_decomposer.decomposition_count() + 2]; // auto_decomposer.decomposition_count() + 2];
// galois_auto( &mut rlwe_ct, // galois_auto( &mut rlwe_ct,
// auto_key, // auto_key,
// &mut scratch, // &mut scratch,
@@ -2149,7 +2141,7 @@ where
// rlwe_modop.elwise_sub_mut(m_out.as_mut_slice(), // rlwe_modop.elwise_sub_mut(m_out.as_mut_slice(),
// m_plus_e_auto.as_slice()); // m_plus_e_auto.as_slice());
// //
// check.add_more(&Vec::<i64>::try_convert_from(m_out.as_slice(), rlwe_q)); // check.add_more(&Vec::<i64>::try_convert_from(m_out.as_slice(), rlwe_q));
// } // }
// } // }

14
src/bool/keys.rs
View File

@@ -3,6 +3,7 @@ use std::{collections::HashMap, hash::Hash, marker::PhantomData};
use crate::{ use crate::{
backend::{ModInit, VectorOps}, backend::{ModInit, VectorOps},
lwe::LweSecret, lwe::LweSecret,
pbs::WithShoupRepr,
random::{NewWithSeed, RandomFillUniformInModulus}, random::{NewWithSeed, RandomFillUniformInModulus},
rgsw::RlweSecret, rgsw::RlweSecret,
utils::WithLocal, utils::WithLocal,
@@ -682,6 +683,19 @@ pub(crate) struct ShoupServerKeyEvaluationDomain<M, P, R, N> {
pub(crate) struct NormalAndShoup<M>(M, M); pub(crate) struct NormalAndShoup<M>(M, M);
impl<M> AsRef<M> for NormalAndShoup<M> {
fn as_ref(&self) -> &M {
&self.0
}
}
impl<M> WithShoupRepr for NormalAndShoup<M> {
type M = M;
fn shoup_repr(&self) -> &Self::M {
&self.1
}
}
mod shoup_server_key_eval_domain { mod shoup_server_key_eval_domain {
use crate::pbs::PbsKey; use crate::pbs::PbsKey;

11
src/bool/mod.rs
View File

@@ -23,7 +23,12 @@ thread_local! {
} }
static BOOL_SERVER_KEY: OnceLock< static BOOL_SERVER_KEY: OnceLock<
ServerKeyEvaluationDomain<Vec<Vec<u64>>, BoolParameters<u64>, DefaultSecureRng, NttBackendU64>, ShoupServerKeyEvaluationDomain<
Vec<Vec<u64>>,
BoolParameters<u64>,
DefaultSecureRng,
NttBackendU64,
>,
> = OnceLock::new(); > = OnceLock::new();
static MULTI_PARTY_CRS: OnceLock<MultiPartyCrs<[u8; 32]>> = OnceLock::new(); static MULTI_PARTY_CRS: OnceLock<MultiPartyCrs<[u8; 32]>> = OnceLock::new();
@@ -40,7 +45,7 @@ pub fn set_mp_seed(seed: [u8; 32]) {
} }
fn set_server_key( fn set_server_key(
key: ServerKeyEvaluationDomain< key: ShoupServerKeyEvaluationDomain<
Vec<Vec<u64>>, Vec<Vec<u64>>,
BoolParameters<u64>, BoolParameters<u64>,
DefaultSecureRng, DefaultSecureRng,
@@ -140,7 +145,7 @@ impl
} }
impl Global impl Global
for ServerKeyEvaluationDomain< for ShoupServerKeyEvaluationDomain<
Vec<Vec<u64>>, Vec<Vec<u64>>,
BoolParameters<u64>, BoolParameters<u64>,
DefaultSecureRng, DefaultSecureRng,

110
src/pbs.rs
View File

@@ -3,12 +3,14 @@ use std::{fmt::Display, marker::PhantomData};
use num_traits::{FromPrimitive, One, PrimInt, ToPrimitive, Zero}; use num_traits::{FromPrimitive, One, PrimInt, ToPrimitive, Zero};
use crate::{ use crate::{
backend::{ArithmeticOps, Modulus, VectorOps}, backend::{ArithmeticOps, Modulus, ShoupMatrixFMA, VectorOps},
decomposer::Decomposer, decomposer::Decomposer,
lwe::lwe_key_switch, lwe::lwe_key_switch,
ntt::Ntt, ntt::Ntt,
random::DefaultSecureRng, random::DefaultSecureRng,
rgsw::{galois_auto, rlwe_by_rgsw, rlwe_by_rgsw_shoup, IsTrivial, RlweCiphertext}, rgsw::{
galois_auto, galois_auto_shoup, rlwe_by_rgsw, rlwe_by_rgsw_shoup, IsTrivial, RlweCiphertext,
},
Matrix, MatrixEntity, MatrixMut, RowMut, Matrix, MatrixEntity, MatrixMut, RowMut,
}; };
pub(crate) trait PbsKey { pub(crate) trait PbsKey {
@@ -24,22 +26,24 @@ pub(crate) trait PbsKey {
fn lwe_ksk(&self) -> &Self::LweKskKey; fn lwe_ksk(&self) -> &Self::LweKskKey;
} }
trait WithShoupRepr: AsRef<Self::M> { pub(crate) trait WithShoupRepr: AsRef<Self::M> {
type M; type M;
fn shoup_repr(&self) -> Self::M; fn shoup_repr(&self) -> &Self::M;
} }
pub(crate) trait PbsInfo { pub(crate) trait PbsInfo {
type Element; type M: Matrix;
type Modulus: Modulus<Element = Self::Element>; type Modulus: Modulus<Element = <Self::M as Matrix>::MatElement>;
type NttOp: Ntt<Element = Self::Element>; type NttOp: Ntt<Element = <Self::M as Matrix>::MatElement>;
type D: Decomposer<Element = Self::Element>; type D: Decomposer<Element = <Self::M as Matrix>::MatElement>;
// Although both types have same bounds, they can be different types. For ex, // Although both types have same bounds, they can be different types. For ex,
// type RlweModOp may only support native modulus, where LweModOp may only // type RlweModOp may only support native modulus, where LweModOp may only
// support prime modulus, etc. // support prime modulus, etc.
type RlweModOp: VectorOps<Element = Self::Element> + ArithmeticOps<Element = Self::Element>; type RlweModOp: ArithmeticOps<Element = <Self::M as Matrix>::MatElement>
type LweModOp: VectorOps<Element = Self::Element> + ArithmeticOps<Element = Self::Element>; + ShoupMatrixFMA<<Self::M as Matrix>::R>;
type LweModOp: VectorOps<Element = <Self::M as Matrix>::MatElement>
+ ArithmeticOps<Element = <Self::M as Matrix>::MatElement>;
fn rlwe_q(&self) -> &Self::Modulus; fn rlwe_q(&self) -> &Self::Modulus;
fn lwe_q(&self) -> &Self::Modulus; fn lwe_q(&self) -> &Self::Modulus;
@@ -79,8 +83,9 @@ pub(crate) trait PbsInfo {
/// - blind rotate /// - blind rotate
pub(crate) fn pbs< pub(crate) fn pbs<
M: MatrixMut + MatrixEntity, M: MatrixMut + MatrixEntity,
P: PbsInfo<Element = M::MatElement>, MShoup: WithShoupRepr<M = M>,
K: PbsKey<RgswCt = M, AutoKey = M, LweKskKey = M>, P: PbsInfo<M = M>,
K: PbsKey<RgswCt = MShoup, AutoKey = MShoup, LweKskKey = M>,
>( >(
pbs_info: &P, pbs_info: &P,
test_vec: &M::R, test_vec: &M::R,
@@ -217,10 +222,10 @@ fn blind_rotation<
Mmut: MatrixMut<MatElement = MT::MatElement>, Mmut: MatrixMut<MatElement = MT::MatElement>,
D: Decomposer<Element = MT::MatElement>, D: Decomposer<Element = MT::MatElement>,
NttOp: Ntt<Element = MT::MatElement>, NttOp: Ntt<Element = MT::MatElement>,
ModOp: ArithmeticOps<Element = MT::MatElement> + VectorOps<Element = MT::MatElement>, ModOp: ArithmeticOps<Element = MT::MatElement> + ShoupMatrixFMA<Mmut::R>,
MShoup: WithShoupRepr<M = Mmut>, MShoup: WithShoupRepr<M = Mmut>,
K: PbsKey<RgswCt = MShoup, AutoKey = MShoup>, K: PbsKey<RgswCt = MShoup, AutoKey = MShoup>,
P: PbsInfo<Element = MT::MatElement>, P: PbsInfo<M = Mmut>,
>( >(
trivial_rlwe_test_poly: &mut MT, trivial_rlwe_test_poly: &mut MT,
scratch_matrix: &mut Mmut, scratch_matrix: &mut Mmut,
@@ -249,19 +254,11 @@ fn blind_rotation<
s_indices.iter().for_each(|s_index| { s_indices.iter().for_each(|s_index| {
// let new = std::time::Instant::now(); // let new = std::time::Instant::now();
// rlwe_by_rgsw(
// trivial_rlwe_test_poly,
// pbs_key.rgsw_ct_lwe_si(*s_index),
// scratch_matrix,
// rlwe_rgsw_decomposer,
// ntt_op,
// mod_op,
// );
let ct = pbs_key.rgsw_ct_lwe_si(*s_index); let ct = pbs_key.rgsw_ct_lwe_si(*s_index);
rlwe_by_rgsw_shoup( rlwe_by_rgsw_shoup(
trivial_rlwe_test_poly, trivial_rlwe_test_poly,
ct.as_ref(), ct.as_ref(),
&ct.shoup_repr(), ct.shoup_repr(),
scratch_matrix, scratch_matrix,
rlwe_rgsw_decomposer, rlwe_rgsw_decomposer,
ntt_op, ntt_op,
@@ -275,9 +272,11 @@ fn blind_rotation<
let (auto_map_index, auto_map_sign) = parameters.rlwe_auto_map(v); let (auto_map_index, auto_map_sign) = parameters.rlwe_auto_map(v);
// let now = std::time::Instant::now(); // let now = std::time::Instant::now();
galois_auto( let auto_key = pbs_key.galois_key_for_auto(v);
galois_auto_shoup(
trivial_rlwe_test_poly, trivial_rlwe_test_poly,
pbs_key.galois_key_for_auto(v), auto_key.as_ref(),
auto_key.shoup_repr(),
scratch_matrix, scratch_matrix,
&auto_map_index, &auto_map_index,
&auto_map_sign, &auto_map_sign,
@@ -293,37 +292,46 @@ fn blind_rotation<
} }
// -(g^0) // -(g^0)
gk_to_si[q_by_4].iter().for_each(|s_index| { {
rlwe_by_rgsw( gk_to_si[q_by_4].iter().for_each(|s_index| {
let ct = pbs_key.rgsw_ct_lwe_si(*s_index);
rlwe_by_rgsw_shoup(
trivial_rlwe_test_poly,
ct.as_ref(),
ct.shoup_repr(),
scratch_matrix,
rlwe_rgsw_decomposer,
ntt_op,
mod_op,
);
});
let (auto_map_index, auto_map_sign) = parameters.rlwe_auto_map(0);
let auto_key = pbs_key.galois_key_for_auto(0);
galois_auto_shoup(
trivial_rlwe_test_poly, trivial_rlwe_test_poly,
pbs_key.rgsw_ct_lwe_si(*s_index), auto_key.as_ref(),
auto_key.shoup_repr(),
scratch_matrix, scratch_matrix,
rlwe_rgsw_decomposer, &auto_map_index,
ntt_op, &auto_map_sign,
mod_op, mod_op,
ntt_op,
auto_decomposer,
); );
}); count += 1;
let (auto_map_index, auto_map_sign) = parameters.rlwe_auto_map(0); }
galois_auto(
trivial_rlwe_test_poly,
pbs_key.galois_key_for_auto(0),
scratch_matrix,
&auto_map_index,
&auto_map_sign,
mod_op,
ntt_op,
auto_decomposer,
);
count += 1;
// +(g^k) // +(g^k)
let mut v = 0; let mut v = 0;
for i in (1..q_by_4).rev() { for i in (1..q_by_4).rev() {
let s_indices = &gk_to_si[i]; let s_indices = &gk_to_si[i];
s_indices.iter().for_each(|s_index| { s_indices.iter().for_each(|s_index| {
rlwe_by_rgsw( let ct = pbs_key.rgsw_ct_lwe_si(*s_index);
rlwe_by_rgsw_shoup(
trivial_rlwe_test_poly, trivial_rlwe_test_poly,
pbs_key.rgsw_ct_lwe_si(*s_index), ct.as_ref(),
ct.shoup_repr(),
scratch_matrix, scratch_matrix,
rlwe_rgsw_decomposer, rlwe_rgsw_decomposer,
ntt_op, ntt_op,
@@ -334,9 +342,11 @@ fn blind_rotation<
if gk_to_si[i - 1].len() != 0 || v == w || i == 1 { if gk_to_si[i - 1].len() != 0 || v == w || i == 1 {
let (auto_map_index, auto_map_sign) = parameters.rlwe_auto_map(v); let (auto_map_index, auto_map_sign) = parameters.rlwe_auto_map(v);
galois_auto( let auto_key = pbs_key.galois_key_for_auto(v);
galois_auto_shoup(
trivial_rlwe_test_poly, trivial_rlwe_test_poly,
pbs_key.galois_key_for_auto(v), auto_key.as_ref(),
auto_key.shoup_repr(),
scratch_matrix, scratch_matrix,
&auto_map_index, &auto_map_index,
&auto_map_sign, &auto_map_sign,
@@ -351,9 +361,11 @@ fn blind_rotation<
// +(g^0) // +(g^0)
gk_to_si[0].iter().for_each(|s_index| { gk_to_si[0].iter().for_each(|s_index| {
rlwe_by_rgsw( let ct = pbs_key.rgsw_ct_lwe_si(*s_index);
rlwe_by_rgsw_shoup(
trivial_rlwe_test_poly, trivial_rlwe_test_poly,
pbs_key.rgsw_ct_lwe_si(*s_index), ct.as_ref(),
ct.shoup_repr(),
scratch_matrix, scratch_matrix,
rlwe_rgsw_decomposer, rlwe_rgsw_decomposer,
ntt_op, ntt_op,

4
src/rgsw/runtime.rs
View File

@@ -185,7 +185,7 @@ pub(crate) fn galois_auto_shoup<
MT: Matrix + IsTrivial + MatrixMut, MT: Matrix + IsTrivial + MatrixMut,
Mmut: MatrixMut<MatElement = MT::MatElement>, Mmut: MatrixMut<MatElement = MT::MatElement>,
ModOp: ArithmeticOps<Element = MT::MatElement> ModOp: ArithmeticOps<Element = MT::MatElement>
+ VectorOps<Element = MT::MatElement> // + VectorOps<Element = MT::MatElement>
+ ShoupMatrixFMA<Mmut::R>, + ShoupMatrixFMA<Mmut::R>,
NttOp: Ntt<Element = MT::MatElement>, NttOp: Ntt<Element = MT::MatElement>,
D: Decomposer<Element = MT::MatElement>, D: Decomposer<Element = MT::MatElement>,
@@ -422,7 +422,7 @@ pub(crate) fn rlwe_by_rgsw_shoup<
Mmut: MatrixMut, Mmut: MatrixMut,
MT: Matrix<MatElement = Mmut::MatElement> + MatrixMut<MatElement = Mmut::MatElement> + IsTrivial, MT: Matrix<MatElement = Mmut::MatElement> + MatrixMut<MatElement = Mmut::MatElement> + IsTrivial,
D: RlweDecomposer<Element = Mmut::MatElement>, D: RlweDecomposer<Element = Mmut::MatElement>,
ModOp: VectorOps<Element = Mmut::MatElement> + ShoupMatrixFMA<Mmut::R>, ModOp: ShoupMatrixFMA<Mmut::R>,
NttOp: Ntt<Element = Mmut::MatElement>, NttOp: Ntt<Element = Mmut::MatElement>,
>( >(
rlwe_in: &mut MT, rlwe_in: &mut MT,

12
src/shortint/mod.rs
View File

@@ -97,12 +97,18 @@ mod frontend {
eight_bit_mul, eight_bit_mul,
}; };
use crate::{ use crate::{
bool::{evaluator::BoolEvaluator, keys::ServerKeyEvaluationDomain}, bool::{
evaluator::{self, BoolEvaluator, BooleanGates},
keys::{ServerKeyEvaluationDomain, ShoupServerKeyEvaluationDomain},
},
utils::{Global, WithLocal}, utils::{Global, WithLocal},
}; };
use super::FheUint8; use super::FheUint8;
type ShortIntBoolEvaluator<M, Ntt, RlweModOp, LweModOp> =
BoolEvaluator<M, Ntt, RlweModOp, LweModOp>;
mod arithetic { mod arithetic {
use crate::bool::{evaluator::BooleanGates, FheBool}; use crate::bool::{evaluator::BooleanGates, FheBool};
@@ -111,8 +117,8 @@ mod frontend {
impl AddAssign<&FheUint8> for FheUint8 { impl AddAssign<&FheUint8> for FheUint8 {
fn add_assign(&mut self, rhs: &FheUint8) { fn add_assign(&mut self, rhs: &FheUint8) {
BoolEvaluator::with_local_mut_mut(&mut |e| { ShortIntBoolEvaluator::with_local_mut_mut(&mut |e| {
let key = ServerKeyEvaluationDomain::global(); let key = <ShortIntBoolEvaluator<_, _, _, _> as BooleanGates>::Key::global();
arbitrary_bit_adder(e, self.data_mut(), rhs.data(), false, key); arbitrary_bit_adder(e, self.data_mut(), rhs.data(), false, key);
}); });
} }