tfhe 0.2.5 → 0.3.0

package/README.md

@@ -68,7 +68,7 @@ use tfhe::boolean::prelude::*;
 
 fn main() {
     // We generate a set of client/server keys, using the default parameters:
-    let (mut client_key, mut server_key) = gen_keys();
+    let (client_key, server_key) = gen_keys();
 
     // We use the client secret key to encrypt two messages:
     let ct_1 = client_key.encrypt(true);
@@ -95,7 +95,7 @@ use tfhe::shortint::prelude::*;
 fn main() {
     // Generate a set of client/server keys
     // with 2 bits of message and 2 bits of carry
-    let (client_key, server_key) = gen_keys(PARAM_MESSAGE_2_CARRY_2);
+    let (client_key, server_key) = gen_keys(PARAM_MESSAGE_2_CARRY_2_KS_PBS);
 
     let msg1 = 3;
     let msg2 = 2;
@@ -111,8 +111,8 @@ fn main() {
     // f: x -> sum of the bits of x
     let f = |x:u64| x.count_ones() as u64;
 
-    // Generate the accumulator for the function
-    let acc = server_key.generate_accumulator(f);
+    // Generate the lookup table for the function
+    let acc = server_key.generate_lookup_table(f);
 
     // Compute the function over the ciphertext using the PBS
     let ct_res = server_key.apply_lookup_table(&ct_add, &acc);
@@ -127,12 +127,12 @@ An example using integer:
 
 ```rust
 use tfhe::integer::gen_keys_radix;
-use tfhe::shortint::parameters::PARAM_MESSAGE_2_CARRY_2;
+use tfhe::shortint::parameters::PARAM_MESSAGE_2_CARRY_2_KS_PBS;
 
 fn main() {
     // We create keys to create 16 bits integers
     // using 8 blocks of 2 bits
-    let (cks, sks) = gen_keys_radix(&PARAM_MESSAGE_2_CARRY_2, 8);
+    let (cks, sks) = gen_keys_radix(PARAM_MESSAGE_2_CARRY_2_KS_PBS, 8);
 
     let clear_a = 2382u16;
     let clear_b = 29374u16;
@@ -167,6 +167,19 @@ libraries.
   <img src="https://user-images.githubusercontent.com/5758427/231115030-21195b55-2629-4c01-9809-be5059243999.png">
 </a>
 
+## Citing TFHE-rs
+
+To cite TFHE-rs in academic papers, please use the following entry:
+
+```text
+@Misc{TFHE-rs,
+  title={{TFHE-rs: A Pure Rust Implementation of the TFHE Scheme for Boolean and Integer Arithmetics Over Encrypted Data}},
+  author={Zama},
+  year={2022},
+  note={\url{https://github.com/zama-ai/tfhe-rs}},
+}
+```
+
 ## License
 
 This software is distributed under the BSD-3-Clause-Clear license. If you have any questions,

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "tfhe",
   "description": "TFHE-rs is a fully homomorphic encryption (FHE) library that implements Zama's variant of TFHE.",
-  "version": "0.2.5",
+  "version": "0.3.0",
   "license": "BSD-3-Clause-Clear",
   "repository": {
     "type": "git",