1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
use ;
use Plaintext;
use Poly;
use ;
/// A BFV12 Ciphertext
///
/// * `c_0` = `[p_0 * u + e_1 + delta * m]_q`
/// * `c_1` = `[p_1 * u + e_2]_q`
/// * `q` = the ciphertext modulus
/// * `t` = the plaintext modulus
/// Add two ciphertexts. They can be of different degrees.
///
/// ```rust
/// # use rand::SeedableRng;
/// #
/// # use bfv12::{SecretKey, Plaintext};
/// #
/// # let t = 12; // Plaintext modulus
/// # let q = 65536; // Ciphertext modulus
/// # let std_dev = 3.2; // Standard deviation for generating the error
/// # let degree = 4; // Degree of polynomials used for encoding and encrypting messages
/// #
/// # // Generate a seeded RNG. Any Rng that implements RngCore + CryptoRng can be used.
/// # let mut rng = rand::rngs::StdRng::seed_from_u64(18);
/// #
/// let secret_key = SecretKey::generate(degree, &mut rng);
/// let public_key = secret_key.public_key_gen(q, std_dev, &mut rng);
///
/// let pt_1 = Plaintext::rand(degree, t, &mut rng);
/// let pt_2 = Plaintext::rand(degree, t, &mut rng);
/// let ct_1 = pt_1.encrypt(&public_key, std_dev, &mut rng);
/// let ct_2 = pt_2.encrypt(&public_key, std_dev, &mut rng);
///
/// // Add the ciphertexts: ct_1 + ct_2
/// let add_ct = ct_1 + ct_2;
///
/// // Decrypt the result of the addition
/// let add_pt = add_ct.decrypt(&secret_key);
///
/// // Compare the expected output to the decrypted output
/// let expected_pt = (pt_1.poly() + pt_2.poly()) % (t, degree);
/// assert_eq!(add_pt.poly(), expected_pt)
/// ```
/// Subtract one ciphertext from another. They can be of different degrees.
///
/// ```rust
/// # use rand::SeedableRng;
/// #
/// # use bfv12::{SecretKey, Plaintext};
/// #
/// # let t = 12; // Plaintext modulus
/// # let q = 65536; // Ciphertext modulus
/// # let std_dev = 3.2; // Standard deviation for generating the error
/// # let degree = 4; // Degree of polynomials used for encoding and encrypting messages
/// #
/// # // Generate a seeded RNG. Any Rng that implements RngCore + CryptoRng can be used.
/// # let mut rng = rand::rngs::StdRng::seed_from_u64(18);
/// #
/// let secret_key = SecretKey::generate(degree, &mut rng);
/// let public_key = secret_key.public_key_gen(q, std_dev, &mut rng);
///
/// let pt_1 = Plaintext::rand(degree, t, &mut rng);
/// let pt_2 = Plaintext::rand(degree, t, &mut rng);
/// let ct_1 = pt_1.encrypt(&public_key, std_dev, &mut rng);
/// let ct_2 = pt_2.encrypt(&public_key, std_dev, &mut rng);
///
/// // Subtract: ct_1 - ct_2
/// let sub_ct = ct_1 - ct_2;
///
/// // Decrypt the result of the subtraction
/// let sub_pt = sub_ct.decrypt(&secret_key);
///
/// // Compare the expected output to the decrypted output
/// let expected_pt = (pt_1.poly() - pt_2.poly()) % (t, degree);
/// assert_eq!(sub_pt.poly(), expected_pt)
/// ```
/// Take the negation of a ciphertext.
///
/// ```rust
/// # use rand::SeedableRng;
/// #
/// # use bfv12::{SecretKey, Plaintext};
/// #
/// # let t = 12; // Plaintext modulus
/// # let q = 65536; // Ciphertext modulus
/// # let std_dev = 3.2; // Standard deviation for generating the error
/// # let degree = 4; // Degree of polynomials used for encoding and encrypting messages
/// #
/// # // Generate a seeded RNG. Any Rng that implements RngCore + CryptoRng can be used.
/// # let mut rng = rand::rngs::StdRng::seed_from_u64(18);
/// #
/// let secret_key = SecretKey::generate(degree, &mut rng);
/// let public_key = secret_key.public_key_gen(q, std_dev, &mut rng);
///
/// let pt = Plaintext::rand(degree, t, &mut rng);
/// let ct = pt.encrypt(&public_key, std_dev, &mut rng);
///
/// // Negate: -ct
/// let neg_ct = -ct;
///
/// // Decrypt the result of the negation
/// let neg_pt = neg_ct.decrypt(&secret_key);
///
/// // Compare the expected output to the decrypted output
/// let expected_pt = -pt.poly() % (t, degree);
/// assert_eq!(neg_pt.poly(), expected_pt)
/// ```
/// Multiply two ciphertexts, using Relinearization Version 1.
/// Since multiplication requires a relinearization key, you must multiply a ciphertext
/// with a tuple of (Ciphertext, &RelinearizationKey1). The type of the relinearization
/// key determines whether the multiplication uses Relinearization Version 1 or 2.
///
/// ```rust
/// # use rand::SeedableRng;
/// #
/// # use bfv12::{SecretKey, Plaintext};
/// #
/// # let t = 12; // Plaintext modulus
/// # let q = 65536; // Ciphertext modulus
/// # let std_dev = 3.2; // Standard deviation for generating the error
/// # let degree = 4; // Degree of polynomials used for encoding and encrypting messages
/// # let rlk_base = (q as f64).log2() as i64; // The base for decomposition during relinearization
/// #
/// # // Generate a seeded RNG. Any Rng that implements RngCore + CryptoRng can be used.
/// # let mut rng = rand::rngs::StdRng::seed_from_u64(18);
/// #
/// let secret_key = SecretKey::generate(degree, &mut rng);
/// let public_key = secret_key.public_key_gen(q, std_dev, &mut rng);
/// let rlk_1 = secret_key.relin_key_gen_1(q, std_dev, &mut rng, rlk_base);
///
/// let pt_1 = Plaintext::rand(degree, t, &mut rng);
/// let pt_2 = Plaintext::rand(degree, t, &mut rng);
/// let ct_1 = pt_1.encrypt(&public_key, std_dev, &mut rng);
/// let ct_2 = pt_2.encrypt(&public_key, std_dev, &mut rng);
///
/// // Multiply the ciphertexts: ct_1 * ct_2
/// let mul_ct = ct_1 * (ct_2, &rlk_1);
///
/// // Decrypt the result of the multiplication
/// let mul_pt = mul_ct.decrypt(&secret_key);
///
/// // Compare the expected output to the decrypted output
/// let expected_pt = (pt_1.poly() * pt_2.poly()) % (t, degree);
/// assert_eq!(mul_pt.poly(), expected_pt)
/// ```
/// Multiply two ciphertexts, using Relinearization Version 2.
/// Since multiplication requires a relinearization key, you must multiply a ciphertext
/// with a tuple of (Ciphertext, &RelinearizationKey2). The type of the relinearization
/// key determines whether the multiplication uses Relinearization Version 1 or 2.
///
/// ```rust
/// # use rand::SeedableRng;
/// #
/// # use bfv12::{SecretKey, Plaintext};
/// #
/// # let t = 12; // Plaintext modulus
/// # let q = 65536; // Ciphertext modulus
/// # let std_dev = 3.2; // Standard deviation for generating the error
/// # let degree = 4; // Degree of polynomials used for encoding and encrypting messages
/// #
/// # // Generate a seeded RNG. Any Rng that implements RngCore + CryptoRng can be used.
/// # let mut rng = rand::rngs::StdRng::seed_from_u64(18);
/// #
/// let secret_key = SecretKey::generate(degree, &mut rng);
/// let public_key = secret_key.public_key_gen(q, std_dev, &mut rng);
///
/// // p = the amount to scale the modulus, during modulus switching
/// // Technically p should be >= q^3 for security (see paper discussion on Relinearization Version 2),
/// // but setting p = q^3 results in an overflow when taking p * q so we will test with a smaller p.
/// let p = 2_i64.pow(13) * q;
/// let rlk_2 = secret_key.relin_key_gen_2(q, std_dev, &mut rng, p);
///
/// let pt_1 = Plaintext::rand(degree, t, &mut rng);
/// let pt_2 = Plaintext::rand(degree, t, &mut rng);
/// let ct_1 = pt_1.encrypt(&public_key, std_dev, &mut rng);
/// let ct_2 = pt_2.encrypt(&public_key, std_dev, &mut rng);
///
/// // Multiply the ciphertexts: ct_1 * ct_2
/// let mul_ct = ct_1 * (ct_2, &rlk_2);
///
/// // Decrypt the result of the multiplication
/// let mul_pt = mul_ct.decrypt(&secret_key);
///
/// // Compare the expected output to the decrypted output
/// let expected_pt = (pt_1.poly() * pt_2.poly()) % (t, degree);
/// assert_eq!(mul_pt.poly(), expected_pt)
/// ```