arnaucube/poulpy
1
0
Fork 0
mirror of https://github.com/arnaucube/poulpy.git synced 2026-02-10 05:06:44 +01:00
Code Issues Packages Projects Releases Wiki Activity

moved plaintext ops related to fhevm to fhevm repo

Browse Source
This commit is contained in:
Jean-Philippe Bossuat
2025-01-15 16:11:15 +01:00
parent 2e446c6b76
commit a5838c8726
5 changed files with 6 additions and 514 deletions
Download Patch File Download Diff File Expand all files Collapse all files

158
math/tests/automorphism.rs
View File

@@ -1,7 +1,5 @@
use itertools::izip;
use math::modulus::WordOps;
use math::poly::Poly;
use math::ring::impl_u64::packing::StreamRepacker;
use math::ring::Ring;
#[test]
@@ -53,159 +51,3 @@ fn test_automorphism_u64<const NTT: bool>(ring: &Ring<u64>, nth_root: usize) {
izip!(p0.0, p1.0).for_each(|(a, b)| assert_eq!(a, b));
}
#[test]
fn packing_u64() {
let n: usize = 1 << 5;
let q_base: u64 = 65537u64;
let q_power: usize = 1usize;
let ring: Ring<u64> = Ring::new(n, q_base, q_power);
sub_test("test_packing_u64::<NTT:false>", || {
test_packing_sparse_u64::<false>(&ring, 1)
});
sub_test("test_packing_u64::<NTT:true>", || {
test_packing_sparse_u64::<true>(&ring, 1)
});
sub_test("test_packing_sparse_u64::<NTT:false>", || {
test_packing_sparse_u64::<false>(&ring, 3)
});
sub_test("test_packing_sparse_u64::<NTT:true>", || {
test_packing_sparse_u64::<true>(&ring, 3)
});
}
fn test_packing_sparse_u64<const NTT: bool>(ring: &Ring<u64>, gap: usize) {
let n: usize = ring.n();
let mut result: Vec<Option<&mut Poly<u64>>> = Vec::with_capacity(n);
result.resize_with(n, || None);
let mut polys: Vec<Poly<u64>> = vec![ring.new_poly(); (n+gap-1)/gap];
polys.iter_mut().enumerate().for_each(|(i , poly)|{
poly.fill(&((1 + i*gap) as u64));
if NTT {
ring.ntt_inplace::<false>(poly);
}
result[i*gap] = Some(poly);
});
ring.pack::<true, NTT>(&mut result, ring.log_n());
if let Some(poly) = result[0].as_mut() {
if NTT {
ring.intt_inplace::<false>(poly);
}
poly.0.iter().enumerate().for_each(|(i, x)| {
if i % gap == 0 {
assert_eq!(*x, (1+i) as u64)
} else {
assert_eq!(*x, 0u64)
}
});
}
}
#[test]
fn packing_streaming_u64() {
let n: usize = 1 << 5;
let q_base: u64 = 65537u64;
let q_power: usize = 1usize;
let ring: Ring<u64> = Ring::new(n, q_base, q_power);
sub_test("test_packing_streaming_dense_u64::<NTT:true>", || {
test_packing_streaming_dense_u64::<true>(&ring)
});
}
fn test_packing_streaming_dense_u64<const NTT: bool>(ring: &Ring<u64>) {
let n: usize = ring.n();
let mut values: Vec<u64> = vec![0; n];
values
.iter_mut()
.enumerate()
.for_each(|(i, x)| *x = (i + 1) as u64);
let gap: usize = 3;
let mut packer = StreamRepacker::new(ring);
let mut poly: Poly<u64> = ring.new_poly();
for i in 0..n {
let i_rev: usize = i.reverse_bits_msb(ring.log_n() as u32);
if i_rev % gap == 0 {
poly.fill(&values[i_rev]);
if NTT {
ring.ntt_inplace::<false>(&mut poly);
}
packer.add::<NTT>(ring, Some(&poly))
} else {
packer.add::<NTT>(ring, None)
}
}
packer.flush::<NTT>(ring);
let result: &mut Poly<u64> = &mut packer.results[0];
if NTT {
ring.intt_inplace::<false>(result);
}
result.0.iter().enumerate().for_each(|(i, x)| {
if i % gap == 0 {
assert_eq!(*x, values[i] as u64)
} else {
assert_eq!(*x, 0u64)
}
});
}
#[test]
fn trace_u64() {
let n: usize = 1 << 5;
let q_base: u64 = 65537u64;
let q_power: usize = 1usize;
let ring: Ring<u64> = Ring::new(n, q_base, q_power);
sub_test("test_trace::<NTT:false>", || test_trace_u64::<false>(&ring));
sub_test("test_trace::<NTT:true>", || test_trace_u64::<true>(&ring));
}
fn test_trace_u64<const NTT: bool>(ring: &Ring<u64>) {
let n: usize = ring.n();
let mut poly: Poly<u64> = ring.new_poly();
poly.0
.iter_mut()
.enumerate()
.for_each(|(i, x)| *x = (i + 1) as u64);
if NTT {
ring.ntt_inplace::<false>(&mut poly);
}
let step_start: usize = 2;
ring.trace_inplace::<NTT>(step_start, &mut poly);
if NTT {
ring.intt_inplace::<false>(&mut poly);
}
let gap: usize = 1 << (ring.log_n() - step_start);
poly.0.iter().enumerate().for_each(|(i, x)| {
if i % gap == 0 {
assert_eq!(*x, 1 + i as u64)
} else {
assert_eq!(*x, 0u64)
}
});
}