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
use super::shift::BarrelShifterOperation;
use crate::integer::ciphertext::{IntegerRadixCiphertext, RadixCiphertext};
use crate::integer::ServerKey;
impl ServerKey {
//======================================================================
// Rotate Right
//======================================================================
pub fn unchecked_rotate_right_parallelized<T>(&self, ct: &T, n: &RadixCiphertext) -> T
where
T: IntegerRadixCiphertext,
{
let mut result = ct.clone();
self.unchecked_rotate_right_assign_parallelized(&mut result, n);
result
}
pub fn unchecked_rotate_right_assign_parallelized<T>(&self, ct: &mut T, n: &RadixCiphertext)
where
T: IntegerRadixCiphertext,
{
self.unchecked_shift_rotate_bits_assign(ct, n, BarrelShifterOperation::RightRotate);
}
pub fn smart_rotate_right_assign_parallelized<T>(&self, ct: &mut T, n: &mut RadixCiphertext)
where
T: IntegerRadixCiphertext,
{
rayon::join(
|| {
if !ct.block_carries_are_empty() {
self.full_propagate_parallelized(ct);
}
},
|| {
if !n.block_carries_are_empty() {
self.full_propagate_parallelized(n);
}
},
);
self.unchecked_rotate_right_assign_parallelized(ct, n);
}
pub fn smart_rotate_right_parallelized<T>(&self, ct: &mut T, rotate: &mut RadixCiphertext) -> T
where
T: IntegerRadixCiphertext,
{
rayon::join(
|| {
if !ct.block_carries_are_empty() {
self.full_propagate_parallelized(ct);
}
},
|| {
if !rotate.block_carries_are_empty() {
self.full_propagate_parallelized(rotate);
}
},
);
self.unchecked_rotate_right_parallelized(ct, rotate)
}
/// Computes homomorphically a rotation of bits.
///
/// Shifts the bits to the right by a specified amount,
/// `n`, wrapping the truncated bits to the beginning of the resulting integer.
///
/// The result is returned as a new ciphertext.
///
/// # Example
///
/// ```rust
/// use tfhe::integer::gen_keys_radix;
/// use tfhe::shortint::parameters::PARAM_MESSAGE_2_CARRY_2_KS_PBS_GAUSSIAN_2M128;
///
/// // We have 4 * 2 = 8 bits of message
/// let size = 4;
/// let (cks, sks) = gen_keys_radix(PARAM_MESSAGE_2_CARRY_2_KS_PBS_GAUSSIAN_2M128, size);
///
/// let msg = 128u8;
/// let n = 2;
///
/// let ct = cks.encrypt(msg as u64);
/// let n_ct = cks.encrypt(n as u64);
///
/// let ct_res = sks.rotate_right_parallelized(&ct, &n_ct);
///
/// // Decrypt:
/// let dec: u64 = cks.decrypt(&ct_res);
/// assert_eq!(msg.rotate_right(n as u32) as u64, dec);
/// ```
pub fn rotate_right_assign_parallelized<T>(&self, ct: &mut T, rotate: &RadixCiphertext)
where
T: IntegerRadixCiphertext,
{
let mut tmp_rhs;
let (lhs, rhs) = match (
ct.block_carries_are_empty(),
rotate.block_carries_are_empty(),
) {
(true, true) => (ct, rotate),
(true, false) => {
tmp_rhs = rotate.clone();
self.full_propagate_parallelized(&mut tmp_rhs);
(ct, &tmp_rhs)
}
(false, true) => {
self.full_propagate_parallelized(ct);
(ct, rotate)
}
(false, false) => {
tmp_rhs = rotate.clone();
rayon::join(
|| self.full_propagate_parallelized(ct),
|| self.full_propagate_parallelized(&mut tmp_rhs),
);
(ct, &tmp_rhs)
}
};
self.unchecked_rotate_right_assign_parallelized(lhs, rhs);
}
pub fn rotate_right_parallelized<T>(&self, ct: &T, rotate: &RadixCiphertext) -> T
where
T: IntegerRadixCiphertext,
{
let mut ct_res = ct.clone();
self.rotate_right_assign_parallelized(&mut ct_res, rotate);
ct_res
}
//======================================================================
// Rotate Left
//======================================================================
pub fn unchecked_rotate_left_parallelized<T>(&self, ct_left: &T, n: &RadixCiphertext) -> T
where
T: IntegerRadixCiphertext,
{
let mut result = ct_left.clone();
self.unchecked_rotate_left_assign_parallelized(&mut result, n);
result
}
pub fn unchecked_rotate_left_assign_parallelized<T>(&self, ct: &mut T, n: &RadixCiphertext)
where
T: IntegerRadixCiphertext,
{
self.unchecked_shift_rotate_bits_assign(ct, n, BarrelShifterOperation::LeftRotate);
}
pub fn smart_rotate_left_assign_parallelized<T>(&self, ct: &mut T, n: &mut RadixCiphertext)
where
T: IntegerRadixCiphertext,
{
rayon::join(
|| {
if !ct.block_carries_are_empty() {
self.full_propagate_parallelized(ct);
}
},
|| {
if !n.block_carries_are_empty() {
self.full_propagate_parallelized(n);
}
},
);
self.unchecked_rotate_left_assign_parallelized(ct, n);
}
pub fn smart_rotate_left_parallelized<T>(&self, ct: &mut T, rotate: &mut RadixCiphertext) -> T
where
T: IntegerRadixCiphertext,
{
rayon::join(
|| {
if !ct.block_carries_are_empty() {
self.full_propagate_parallelized(ct);
}
},
|| {
if !rotate.block_carries_are_empty() {
self.full_propagate_parallelized(rotate);
}
},
);
self.unchecked_rotate_left_parallelized(ct, rotate)
}
pub fn rotate_left_assign_parallelized<T>(&self, ct: &mut T, rotate: &RadixCiphertext)
where
T: IntegerRadixCiphertext,
{
let mut tmp_rhs;
let (lhs, rhs) = match (
ct.block_carries_are_empty(),
rotate.block_carries_are_empty(),
) {
(true, true) => (ct, rotate),
(true, false) => {
tmp_rhs = rotate.clone();
self.full_propagate_parallelized(&mut tmp_rhs);
(ct, &tmp_rhs)
}
(false, true) => {
self.full_propagate_parallelized(ct);
(ct, rotate)
}
(false, false) => {
tmp_rhs = rotate.clone();
rayon::join(
|| self.full_propagate_parallelized(ct),
|| self.full_propagate_parallelized(&mut tmp_rhs),
);
(ct, &tmp_rhs)
}
};
self.unchecked_rotate_left_assign_parallelized(lhs, rhs);
}
/// Computes homomorphically a rotation of bits.
///
/// Shifts the bits to the left by a specified amount,
/// `n`, wrapping the truncated bits to the end of the resulting integer.
///
/// The result is returned as a new ciphertext.
///
/// # Example
///
/// ```rust
/// use tfhe::integer::gen_keys_radix;
/// use tfhe::shortint::parameters::PARAM_MESSAGE_2_CARRY_2_KS_PBS_GAUSSIAN_2M128;
///
/// // We have 4 * 2 = 8 bits of message
/// let size = 4;
/// let (cks, sks) = gen_keys_radix(PARAM_MESSAGE_2_CARRY_2_KS_PBS_GAUSSIAN_2M128, size);
///
/// let msg = 128u8;
/// let n = 2;
///
/// let ct = cks.encrypt(msg as u64);
/// let n_ct = cks.encrypt(n as u64);
///
/// let ct_res = sks.rotate_left_parallelized(&ct, &n_ct);
///
/// // Decrypt:
/// let dec: u64 = cks.decrypt(&ct_res);
/// assert_eq!(msg.rotate_left(n as u32) as u64, dec);
/// ```
pub fn rotate_left_parallelized<T>(&self, ct: &T, rotate: &RadixCiphertext) -> T
where
T: IntegerRadixCiphertext,
{
let mut ct_res = ct.clone();
self.rotate_left_assign_parallelized(&mut ct_res, rotate);
ct_res
}
}