Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

skip computing the higher order of secret key in BFV decryption #237

Merged
merged 1 commit into from
Jan 15, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 5 additions & 1 deletion crates/fhe/src/bfv/keys/secret_key.rs
Original file line number Diff line number Diff line change
Expand Up @@ -175,12 +175,16 @@ impl FheDecrypter<Plaintext, Ciphertext> for SecretKey {
let mut c = Zeroizing::new(ct.c[0].clone());
c.disallow_variable_time_computations();

// Compute the phase c0 + c1*s + c2*s^2 + ... where the secret power
// s^k is computed on-the-fly
for i in 1..ct.c.len() {
let mut cis = Zeroizing::new(ct.c[i].clone());
cis.disallow_variable_time_computations();
*cis.as_mut() *= si.as_ref();
*c.as_mut() += &cis;
*si.as_mut() *= s.as_ref();
if i + 1 < ct.c.len() {
*si.as_mut() *= s.as_ref();
}
}
c.change_representation(Representation::PowerBasis);

Expand Down
Loading