chore(tfhe): update README

This commit is contained in:
Arthur Meyre
2023-01-12 14:35:13 +01:00
parent 5945a52eba
commit 0ae2722729

View File

@@ -95,24 +95,32 @@ Another example of how the library can be used with shortints:
use tfhe::shortint::prelude::*; use tfhe::shortint::prelude::*;
fn main() { fn main() {
// We generate a set of client/server keys, using the default parameters: // Generate a set of client/server keys, using the default parameters:
let (client_key, server_key) = gen_keys(Parameters::default()); let (client_key, server_key) = gen_keys(Parameters::default());
let msg1 = 1; let msg1 = 3;
let msg2 = 0; let msg2 = 2;
let modulus = client_key.parameters.message_modulus.0; // Encrypt two messages using the (private) client key:
// We use the client key to encrypt two messages:
let ct_1 = client_key.encrypt(msg1); let ct_1 = client_key.encrypt(msg1);
let ct_2 = client_key.encrypt(msg2); let ct_2 = client_key.encrypt(msg2);
// We use the server public key to execute an integer circuit: // Homomorphically compute an addition
let ct_3 = server_key.unchecked_add(&ct_1, &ct_2); let ct_add = server_key.unchecked_add(&ct_1, &ct_2);
// We use the client key to decrypt the output of the circuit: // Define the Hamming weight function
let output = client_key.decrypt(&ct_3); // f: x -> sum of the bits of x
assert_eq!(output, (msg1 + msg2) % modulus as u64); let f = |x:u64| x.count_ones() as u64;
// Generate the accumulator for the function
let acc = server_key.generate_accumulator(f);
// Compute the function over the ciphertext using the PBS
let ct_res = server_key.keyswitch_programmable_bootstrap(&ct_add, &acc);
// Decrypt the ciphertext using the (private) client key
let output = client_key.decrypt(&ct_res);
assert_eq!(output, f(msg1 + msg2));
} }
``` ```