tfhe 1.7.0

TFHE-rs is a fully homomorphic encryption (FHE) library that implements Zama's variant of TFHE.
Documentation
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
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
use crate::high_level_api::global_state;
use crate::high_level_api::integers::FheIntegerType;
use crate::high_level_api::keys::InternalServerKey;
use crate::high_level_api::re_randomization::{
    PrfReRandomizationContext, ReRandomizationMetadata, ReRandomizationMode,
};
pub use crate::integer::server_key::radix_parallel::bitonic_shuffle::BitonicShuffleKeySize;
use crate::OprfSeed;

/// Shuffles `data` into a uniformly random permutation using a bitonic
/// sorting network with OPRF-generated random keys.
///
/// `key_size` controls the bit-width of the random sort keys used internally,
/// either by specifying a target collision probability or by passing a raw
/// bit count. Larger keys reduce collision probability (improving shuffle
/// uniformity) at the cost of more computation per comparison.
///
/// The re-randomization metadata of the input elements is not preserved
/// through the shuffle.
///
/// # Errors
///
/// Returns an error if the resolved key block count is 0
pub fn bitonic_shuffle<T, S>(
    data: Vec<T>,
    key_size: BitonicShuffleKeySize,
    seed: S,
) -> Result<Vec<T>, crate::Error>
where
    T: FheIntegerType,
    S: OprfSeed,
{
    global_state::with_internal_keys(|key| match key {
        InternalServerKey::Cpu(cpu_key) => {
            let inner = data.into_iter().map(|v| v.into_cpu()).collect();
            let result =
                cpu_key
                    .pbs_key()
                    .bitonic_shuffle(&cpu_key.oprf_key(), inner, key_size, seed)?;
            Ok(result
                .into_iter()
                .map(|ct| T::from_cpu(ct, cpu_key.tag.clone(), ReRandomizationMetadata::default()))
                .collect())
        }
        #[cfg(feature = "gpu")]
        InternalServerKey::Cuda(cuda_key) => {
            let streams = &cuda_key.streams;
            let inner = data.into_iter().map(|v| v.into_gpu(streams)).collect();
            let result = cuda_key.pbs_key().bitonic_shuffle(
                &cuda_key.oprf_key(),
                inner,
                key_size,
                seed,
                streams,
            )?;
            Ok(result
                .into_iter()
                .map(|ct| T::from_gpu(ct, cuda_key.tag.clone(), ReRandomizationMetadata::default()))
                .collect())
        }
        #[cfg(feature = "hpu")]
        InternalServerKey::Hpu(_) => Err(crate::Error::new(
            "bitonic_shuffle is not supported on Hpu".to_string(),
        )),
    })
}

pub fn re_randomized_keys_bitonic_shuffle<T, S>(
    data: Vec<T>,
    key_size: BitonicShuffleKeySize,
    seed: S,
    re_randomization_mode: ReRandomizationMode,
    prf_re_randomization_context: &PrfReRandomizationContext,
) -> Result<Vec<T>, crate::Error>
where
    T: FheIntegerType,
    S: OprfSeed,
{
    global_state::with_internal_keys(|key| match key {
        InternalServerKey::Cpu(cpu_key) => {
            let re_randomization_key =
                cpu_key.integer_re_randomization_key_from_mode(re_randomization_mode)?;
            let inner = data.into_iter().map(|v| v.into_cpu()).collect();
            let result = cpu_key.pbs_key().re_randomized_keys_bitonic_shuffle(
                &cpu_key.oprf_key(),
                inner,
                key_size,
                seed,
                &re_randomization_key,
                prf_re_randomization_context.inner(),
            )?;
            Ok(result
                .into_iter()
                .map(|ct| T::from_cpu(ct, cpu_key.tag.clone(), ReRandomizationMetadata::default()))
                .collect())
        }
        #[cfg(feature = "gpu")]
        InternalServerKey::Cuda(cuda_key) => {
            let re_randomization_key =
                cuda_key.integer_re_randomization_key_from_mode(re_randomization_mode)?;
            let streams = &cuda_key.streams;
            let inner = data.into_iter().map(|v| v.into_gpu(streams)).collect();
            let result = cuda_key.pbs_key().bitonic_shuffle_and_re_randomize(
                &cuda_key.oprf_key(),
                inner,
                key_size,
                seed,
                &re_randomization_key,
                prf_re_randomization_context.inner(),
                streams,
            )?;
            Ok(result
                .into_iter()
                .map(|ct| T::from_gpu(ct, cuda_key.tag.clone(), ReRandomizationMetadata::default()))
                .collect())
        }
        #[cfg(feature = "hpu")]
        InternalServerKey::Hpu(_) => Err(crate::Error::new(
            "bitonic_shuffle is not supported on Hpu".to_string(),
        )),
    })
}

#[cfg(test)]
mod test {
    use super::*;
    use crate::core_crypto::prelude::new_seeder;
    #[cfg(feature = "gpu")]
    use crate::high_level_api::integers::unsigned::tests::gpu::GPU_SETUP_FN;
    use crate::high_level_api::prelude::*;
    use crate::high_level_api::tests::setup_default_cpu;
    use crate::high_level_api::{set_server_key, ClientKey, ConfigBuilder, ServerKey};
    use crate::shortint::ciphertext::{ReRandomizationHashAlgo, ReRandomizationSeedHasher};
    use crate::shortint::parameters::ReRandomizationParameters;
    #[cfg(feature = "gpu")]
    use crate::CompressedServerKey;
    #[cfg(feature = "gpu")]
    use crate::{FheInt16, FheUint32};
    use crate::{FheInt8, FheUint8};
    #[cfg(feature = "gpu")]
    use rand::distributions::Standard;
    use rand::Rng;
    #[cfg(feature = "gpu")]
    use std::fmt::Debug;

    #[cfg(feature = "gpu")]
    fn is_sanitizer_run() -> bool {
        std::env::var("TFHE_RS_COMPUTE_SANITIZER").is_ok_and(|v| v == "1")
    }

    #[test]
    fn test_bitonic_shuffle_fheuint() {
        let cks = {
            let config = ConfigBuilder::default()
                .use_dedicated_oprf_key(true)
                .enable_ciphertext_re_randomization(
                    ReRandomizationParameters::DerivedCPKWithoutKeySwitch,
                )
                .build();

            let cks = ClientKey::generate(config);
            let sks = ServerKey::new(&cks);

            set_server_key(sks);

            cks
        };
        let mut rng = rand::thread_rng();
        let mut clear_values: Vec<u8> = (0..15).map(|_| rng.gen()).collect();

        let encrypted: Vec<FheUint8> = clear_values
            .iter()
            .map(|&v| FheUint8::try_encrypt(v, &cks).unwrap())
            .collect();

        let seed = new_seeder().seed();
        println!("seed: {seed:?}");
        let key_size = BitonicShuffleKeySize::num_bits(32);
        let shuffled = bitonic_shuffle(encrypted.clone(), key_size, seed).unwrap();
        let shuffled_rerand = {
            let mut shuffled_rerand = vec![];

            for rerand_hash_algo in [
                ReRandomizationHashAlgo::Blake3,
                ReRandomizationHashAlgo::Shake256,
            ] {
                let seed_hasher = ReRandomizationSeedHasher::new(
                    rerand_hash_algo,
                    crate::shortint::oprf::TFHE_PRF_RERAND_DOMAIN_SEPARATOR,
                );
                let prf_rerand_context = PrfReRandomizationContext::new_with_hasher(
                    crate::shortint::public_key::compact::TFHE_PKE_DOMAIN_SEPARATOR,
                    seed_hasher,
                );

                shuffled_rerand.push(
                    re_randomized_keys_bitonic_shuffle(
                        encrypted.clone(),
                        key_size,
                        seed,
                        ReRandomizationMode::UseAvailableMode,
                        &prf_rerand_context,
                    )
                    .unwrap(),
                );
            }

            shuffled_rerand
        };

        let decrypted_ref: Vec<u8> = shuffled.iter().map(|ct| ct.decrypt(&cks)).collect();

        clear_values.sort_unstable();
        let decrypted_sorted = {
            let mut tmp = decrypted_ref.clone();
            tmp.sort_unstable();
            tmp
        };

        assert_eq!(decrypted_sorted, clear_values);

        for (idx, rerand_result) in shuffled_rerand.into_iter().enumerate() {
            let decrypted_rerand: Vec<u8> =
                rerand_result.iter().map(|ct| ct.decrypt(&cks)).collect();

            assert_eq!(
                decrypted_ref, decrypted_rerand,
                "failed at index {idx} of decrypted_rerand"
            );
        }
    }

    #[test]
    fn test_bitonic_shuffle_fheint() {
        let cks = {
            let config = ConfigBuilder::default()
                .use_dedicated_oprf_key(true)
                .enable_ciphertext_re_randomization(
                    ReRandomizationParameters::DerivedCPKWithoutKeySwitch,
                )
                .build();

            let cks = ClientKey::generate(config);
            let sks = ServerKey::new(&cks);

            set_server_key(sks);

            cks
        };

        let mut rng = rand::thread_rng();
        let mut clear_values: Vec<i8> = (0..15).map(|_| rng.gen()).collect();

        let encrypted: Vec<FheInt8> = clear_values
            .iter()
            .map(|&v| FheInt8::try_encrypt(v, &cks).unwrap())
            .collect();

        let seed = new_seeder().seed();
        println!("seed: {seed:?}");
        let key_size = BitonicShuffleKeySize::num_bits(32);
        let shuffled = bitonic_shuffle(encrypted.clone(), key_size, seed).unwrap();
        let shuffled_rerand = {
            let mut shuffled_rerand = vec![];

            for rerand_hash_algo in [
                ReRandomizationHashAlgo::Blake3,
                ReRandomizationHashAlgo::Shake256,
            ] {
                let seed_hasher = ReRandomizationSeedHasher::new(
                    rerand_hash_algo,
                    crate::shortint::oprf::TFHE_PRF_RERAND_DOMAIN_SEPARATOR,
                );
                let prf_rerand_context = PrfReRandomizationContext::new_with_hasher(
                    crate::shortint::public_key::compact::TFHE_PKE_DOMAIN_SEPARATOR,
                    seed_hasher,
                );

                shuffled_rerand.push(
                    re_randomized_keys_bitonic_shuffle(
                        encrypted.clone(),
                        key_size,
                        seed,
                        ReRandomizationMode::UseAvailableMode,
                        &prf_rerand_context,
                    )
                    .unwrap(),
                );
            }

            shuffled_rerand
        };

        let decrypted_ref: Vec<i8> = shuffled.iter().map(|ct| ct.decrypt(&cks)).collect();

        clear_values.sort_unstable();
        let decrypted_sorted = {
            let mut tmp = decrypted_ref.clone();
            tmp.sort_unstable();
            tmp
        };

        assert_eq!(decrypted_sorted, clear_values);

        for (idx, rerand_result) in shuffled_rerand.into_iter().enumerate() {
            let decrypted_rerand: Vec<i8> =
                rerand_result.iter().map(|ct| ct.decrypt(&cks)).collect();

            assert_eq!(
                decrypted_ref, decrypted_rerand,
                "failed at index {idx} of decrypted_rerand"
            );
        }
    }

    #[test]
    fn test_bitonic_shuffle_collision_probability() {
        let cks = setup_default_cpu();
        let mut rng = rand::thread_rng();
        let mut clear_values: Vec<u8> = (0..15).map(|_| rng.gen()).collect();

        let encrypted: Vec<FheUint8> = clear_values
            .iter()
            .map(|&v| FheUint8::try_encrypt(v, &cks).unwrap())
            .collect();

        let seed = new_seeder().seed();
        println!("seed: {seed:?}");
        // For n = 15, ceil(log2(15^2 / (2 * 4e-8))) = 32 bits of key.
        let key_size = BitonicShuffleKeySize::collision_probability(4e-8);
        let shuffled = bitonic_shuffle(encrypted, key_size, seed).unwrap();

        let mut decrypted: Vec<u8> = shuffled.iter().map(|ct| ct.decrypt(&cks)).collect();

        clear_values.sort_unstable();
        decrypted.sort_unstable();
        assert_eq!(decrypted, clear_values);
    }

    #[cfg(feature = "gpu")]
    #[test]
    fn test_bitonic_shuffle_fheuint_gpu() {
        for setup_fn in GPU_SETUP_FN {
            let cks = setup_fn();
            let mut rng = rand::thread_rng();
            let mut clear_values: Vec<u8> = (0..15).map(|_| rng.gen()).collect();

            let encrypted: Vec<FheUint8> = clear_values
                .iter()
                .map(|&v| FheUint8::try_encrypt(v, &cks).unwrap())
                .collect();

            let seed = new_seeder().seed();
            let shuffled =
                bitonic_shuffle(encrypted, BitonicShuffleKeySize::num_bits(32), seed).unwrap();

            let mut decrypted: Vec<u8> = shuffled.iter().map(|ct| ct.decrypt(&cks)).collect();

            clear_values.sort_unstable();
            decrypted.sort_unstable();
            assert_eq!(decrypted, clear_values);
        }
    }

    #[cfg(feature = "gpu")]
    #[test]
    fn test_bitonic_shuffle_fheint_gpu() {
        for setup_fn in GPU_SETUP_FN {
            let cks = setup_fn();
            let mut rng = rand::thread_rng();
            let mut clear_values: Vec<i8> = (0..15).map(|_| rng.gen()).collect();

            let encrypted: Vec<FheInt8> = clear_values
                .iter()
                .map(|&v| FheInt8::try_encrypt(v, &cks).unwrap())
                .collect();

            let seed = new_seeder().seed();
            let shuffled =
                bitonic_shuffle(encrypted, BitonicShuffleKeySize::num_bits(32), seed).unwrap();

            let mut decrypted: Vec<i8> = shuffled.iter().map(|ct| ct.decrypt(&cks)).collect();

            clear_values.sort_unstable();
            decrypted.sort_unstable();
            assert_eq!(decrypted, clear_values);
        }
    }

    /// Generates some key sets and sorts on encrypted data
    /// with bitonic sort. Compares FHE results to clear-text results
    #[cfg(feature = "gpu")]
    fn common_test_bitonic_sort_order_cpu_vs_gpu<CT, ET>()
    where
        CT: Copy + Eq + Debug + Ord,
        ET: FheIntegerType + FheTryEncrypt<CT, ClientKey> + FheDecrypt<CT> + Clone,
        Standard: rand_distr::Distribution<CT>,
        u32: CastFrom<CT>,
    {
        use crate::high_level_api::global_state;
        use crate::high_level_api::keys::InternalServerKey;
        use crate::high_level_api::re_randomization::ReRandomizationMetadata;

        let mut rng = rand::thread_rng();

        let ns: &[usize] = if is_sanitizer_run() {
            &[2, 5, 11]
        } else {
            &[2, 5, 9, 11, 3, 6, 7, 10]
        };

        // Pre-generate clear data: three categories of key patterns.
        let cases: Vec<(Vec<u32>, Vec<CT>)> = ns
            .iter()
            .enumerate()
            .map(|(i, &n)| {
                let keys: Vec<u32> = if i < ns.len() / 3 {
                    // Descending keys: the sort should reverse the list of values
                    (0..n).rev().map(|i| i as u32).collect()
                } else if i < 2 * ns.len() / 3 {
                    // Duplicate keys: cycle through n/2+1 distinct values to
                    // force ties and exercise the bitonic network's equal-key
                    // tie-breaking (which differs from a stable sort)
                    (0..n).map(|j| j as u32 % (n as u32 / 2 + 1)).collect()
                } else {
                    // Random full-range u32 keys: simulates shuffle
                    (0..n).map(|_| rng.gen::<u32>()).collect()
                };
                let data: Vec<CT> = (0..n).map(|_| rng.gen()).collect();
                (keys, data)
            })
            .collect();

        // Clear-text reference: simulate the exact bitonic network (with its
        // non-stable equal-key tie-breaking) so the expected output matches the
        // GPU even when two keys collide (e.g. small CT types like i8/i16).
        let clear_refs: Vec<Vec<CT>> = cases
            .iter()
            .map(|(clear_keys, clear_data)| {
                use crate::integer::server_key::radix_parallel::tests_unsigned::test_bitonic_shuffle::clear_bitonic_shuffle_with_keys;
                let n = clear_data.len();
                let indices: Vec<u32> = (0..n as u32).collect();
                let sorted_indices = clear_bitonic_shuffle_with_keys(&indices, clear_keys);
                sorted_indices.iter().map(|&i| clear_data[i as usize]).collect()
            })
            .collect();

        // GPU: compare each result against the CPU reference, all crypto-parameter types
        for setup_fn in GPU_SETUP_FN {
            let cks = setup_fn();
            for (i, (clear_keys, clear_data)) in cases.iter().enumerate() {
                let n = ns[i];
                let enc_keys: Vec<FheUint32> = clear_keys
                    .iter()
                    .map(|&v| FheUint32::try_encrypt(v, &cks).unwrap())
                    .collect();
                let enc_data: Vec<ET> = clear_data
                    .iter()
                    .map(|&v| ET::try_encrypt(v, &cks).unwrap())
                    .collect();

                let sorted: Vec<ET> = global_state::with_internal_keys(|key| {
                    let InternalServerKey::Cuda(cuda_server_key) = key else {
                        panic!("expected CUDA server key");
                    };
                    let streams = &cuda_server_key.streams;
                    let gpu_keys = enc_keys
                        .into_iter()
                        .map(|k| k.into_gpu(streams))
                        .collect::<Vec<_>>();
                    let gpu_data = enc_data
                        .into_iter()
                        .map(|d| d.into_gpu(streams))
                        .collect::<Vec<_>>();
                    let r = cuda_server_key
                        .pbs_key()
                        .bitonic_shuffle_with_keys(gpu_data, gpu_keys, streams)
                        .unwrap();
                    r.into_iter()
                        .map(|ct| {
                            ET::from_gpu(
                                ct,
                                cuda_server_key.tag.clone(),
                                ReRandomizationMetadata::default(),
                            )
                        })
                        .collect::<Vec<_>>()
                });

                let gpu_dec: Vec<CT> = sorted.iter().map(|ct| ct.decrypt(&cks)).collect();
                assert_eq!(gpu_dec, clear_refs[i], "GPU/CPU mismatch for n={n}");
            }
        }
    }

    #[cfg(feature = "gpu")]
    #[test]
    fn test_bitonic_sort_order_cpu_vs_gpu() {
        common_test_bitonic_sort_order_cpu_vs_gpu::<i16, FheInt16>();
        if !is_sanitizer_run() {
            common_test_bitonic_sort_order_cpu_vs_gpu::<i8, FheInt8>();
            common_test_bitonic_sort_order_cpu_vs_gpu::<u32, FheUint32>();
        }
    }

    #[cfg(feature = "gpu")]
    fn common_test_bitonic_shuffle_seed_unique_gpu<CT, ET>()
    where
        CT: Copy + Eq + Debug + Ord,
        ET: FheIntegerType + FheTryEncrypt<CT, ClientKey> + FheDecrypt<CT> + Clone,
        Standard: rand_distr::Distribution<CT>,
    {
        for setup_fn in GPU_SETUP_FN {
            let cks = setup_fn();
            let mut rng = rand::thread_rng();
            let mut clear_values: Vec<CT> = (0..15).map(|_| rng.gen()).collect();

            let encrypted: Vec<ET> = clear_values
                .iter()
                .map(|&v| ET::try_encrypt(v, &cks).unwrap())
                .collect();

            let seed1 = new_seeder().seed();
            let shuffled1 = bitonic_shuffle(
                encrypted.clone(),
                BitonicShuffleKeySize::num_bits(32),
                seed1,
            )
            .unwrap();

            let seed2 = new_seeder().seed();
            let shuffled2 =
                bitonic_shuffle(encrypted, BitonicShuffleKeySize::num_bits(32), seed2).unwrap();

            let mut decrypted1: Vec<CT> = shuffled1.iter().map(|ct| ct.decrypt(&cks)).collect();
            let mut decrypted2: Vec<CT> = shuffled2.iter().map(|ct| ct.decrypt(&cks)).collect();

            assert_ne!(decrypted1, decrypted2, "For the same input, two shuffles with a different seed produced the same shuffled list");

            clear_values.sort_unstable();
            decrypted1.sort_unstable();
            assert_eq!(decrypted1, clear_values);

            decrypted2.sort_unstable();
            assert_eq!(decrypted2, clear_values);
        }
    }
    #[cfg(feature = "gpu")]
    #[test]
    fn test_bitonic_shuffle_unique_seed_gpu() {
        common_test_bitonic_shuffle_seed_unique_gpu::<u32, FheUint32>();
        if !is_sanitizer_run() {
            common_test_bitonic_shuffle_seed_unique_gpu::<i16, FheInt16>();
            common_test_bitonic_shuffle_seed_unique_gpu::<i8, FheInt8>();
        }
    }

    #[cfg(feature = "gpu")]
    #[test]
    fn test_bitonic_shuffle_collision_probability_gpu() {
        for setup_fn in GPU_SETUP_FN {
            let cks = setup_fn();
            let mut rng = rand::thread_rng();
            let mut clear_values: Vec<u8> = (0..15).map(|_| rng.gen()).collect();

            let encrypted: Vec<FheUint8> = clear_values
                .iter()
                .map(|&v| FheUint8::try_encrypt(v, &cks).unwrap())
                .collect();

            let seed = new_seeder().seed();
            let key_size = BitonicShuffleKeySize::collision_probability(4e-8);
            let shuffled = bitonic_shuffle(encrypted, key_size, seed).unwrap();

            let mut decrypted: Vec<u8> = shuffled.iter().map(|ct| ct.decrypt(&cks)).collect();

            clear_values.sort_unstable();
            decrypted.sort_unstable();
            assert_eq!(decrypted, clear_values);
        }
    }

    #[cfg(feature = "gpu")]
    #[test]
    fn test_bitonic_shuffle_rerand_fheuint_gpu() {
        let cks = {
            let config = ConfigBuilder::default()
                .use_dedicated_oprf_key(true)
                .enable_ciphertext_re_randomization(
                    ReRandomizationParameters::DerivedCPKWithoutKeySwitch,
                )
                .build();
            let cks = ClientKey::generate(config);
            let compressed_sks = CompressedServerKey::new(&cks);
            let sks = compressed_sks.decompress_to_gpu();
            set_server_key(sks);
            cks
        };
        let mut rng = rand::thread_rng();
        let mut clear_values: Vec<u8> = (0..15).map(|_| rng.gen()).collect();

        let encrypted: Vec<FheUint8> = clear_values
            .iter()
            .map(|&v| FheUint8::try_encrypt(v, &cks).unwrap())
            .collect();

        let seed = new_seeder().seed();
        println!("seed: {seed:?}");
        let key_size = BitonicShuffleKeySize::num_bits(32);
        let shuffled = bitonic_shuffle(encrypted.clone(), key_size, seed).unwrap();
        let shuffled_rerand = {
            let mut shuffled_rerand = vec![];
            for rerand_hash_algo in [
                ReRandomizationHashAlgo::Blake3,
                ReRandomizationHashAlgo::Shake256,
            ] {
                let seed_hasher = ReRandomizationSeedHasher::new(
                    rerand_hash_algo,
                    crate::shortint::oprf::TFHE_PRF_RERAND_DOMAIN_SEPARATOR,
                );
                let prf_rerand_context = PrfReRandomizationContext::new_with_hasher(
                    crate::shortint::public_key::compact::TFHE_PKE_DOMAIN_SEPARATOR,
                    seed_hasher,
                );
                shuffled_rerand.push(
                    re_randomized_keys_bitonic_shuffle(
                        encrypted.clone(),
                        key_size,
                        seed,
                        ReRandomizationMode::UseAvailableMode,
                        &prf_rerand_context,
                    )
                    .unwrap(),
                );
            }
            shuffled_rerand
        };

        let decrypted_ref: Vec<u8> = shuffled.iter().map(|ct| ct.decrypt(&cks)).collect();
        clear_values.sort_unstable();
        let decrypted_sorted = {
            let mut tmp = decrypted_ref.clone();
            tmp.sort_unstable();
            tmp
        };
        assert_eq!(decrypted_sorted, clear_values);

        for (idx, rerand_result) in shuffled_rerand.into_iter().enumerate() {
            let decrypted_rerand: Vec<u8> =
                rerand_result.iter().map(|ct| ct.decrypt(&cks)).collect();
            assert_eq!(
                decrypted_ref, decrypted_rerand,
                "failed at index {idx} of decrypted_rerand"
            );
        }
    }
}