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

wip

Browse Source
This commit is contained in:
Jean-Philippe Bossuat
2025-01-04 23:35:35 +01:00
parent affb0b47ef
commit 78cc0514ec
8 changed files with 137 additions and 83 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
math/src/ring/impl_u64/rescaling_rns.rs
View File

@@ -1,6 +1,6 @@
use crate::ring::RingRNS;
use crate::poly::{Poly, PolyRNS};
use crate::modulus::barrett::Barrett;
use crate::modulus::barrett::BarrettRNS;
use crate::modulus::ONCE;
extern crate test;
@@ -11,12 +11,12 @@ impl RingRNS<'_, u64>{
pub fn div_floor_by_last_modulus_ntt(&self, a: &PolyRNS<u64>, buf: &mut PolyRNS<u64>, b: &mut PolyRNS<u64>){
assert!(b.level() >= a.level()-1, "invalid input b: b.level()={} < a.level()-1={}", b.level(), a.level()-1);
let level = self.level();
self.0[level].intt::<true>(a.at(level), buf.at_mut(0));
let rescaling_constants: Vec<Barrett<u64>> = self.rescaling_constant();
self.0[level].intt::<false>(a.at(level), buf.at_mut(0));
let rescaling_constants: BarrettRNS<u64> = self.rescaling_constant();
let (buf_ntt_q_scaling, buf_ntt_qi_scaling) = buf.0.split_at_mut(1);
for (i, r) in self.0[0..level].iter().enumerate(){
r.ntt::<true>(&buf_ntt_q_scaling[0], &mut buf_ntt_qi_scaling[0]);
r.sum_aqqmb_prod_c_scalar_barrett::<ONCE>(&buf_ntt_qi_scaling[0], a.at(i), &rescaling_constants[i], b.at_mut(i));
r.ntt::<false>(&buf_ntt_q_scaling[0], &mut buf_ntt_qi_scaling[0]);
r.sum_aqqmb_prod_c_scalar_barrett::<ONCE>(&buf_ntt_qi_scaling[0], a.at(i), &rescaling_constants.0[i], b.at_mut(i));
}
}
@@ -25,11 +25,11 @@ impl RingRNS<'_, u64>{
pub fn div_floor_by_last_modulus_ntt_inplace(&self, buf: &mut PolyRNS<u64>, b: &mut PolyRNS<u64>){
let level = self.level();
self.0[level].intt::<true>(b.at(level), buf.at_mut(0));
let rescaling_constants: Vec<Barrett<u64>> = self.rescaling_constant();
let rescaling_constants: BarrettRNS<u64> = self.rescaling_constant();
let (buf_ntt_q_scaling, buf_ntt_qi_scaling) = buf.0.split_at_mut(1);
for (i, r) in self.0[0..level].iter().enumerate(){
r.ntt::<true>(&buf_ntt_q_scaling[0], &mut buf_ntt_qi_scaling[0]);
r.sum_aqqmb_prod_c_scalar_barrett_inplace::<ONCE>(&buf_ntt_qi_scaling[0], &rescaling_constants[i], b.at_mut(i));
r.sum_aqqmb_prod_c_scalar_barrett_inplace::<ONCE>(&buf_ntt_qi_scaling[0], &rescaling_constants.0[i], b.at_mut(i));
}
}
@@ -37,19 +37,19 @@ impl RingRNS<'_, u64>{
pub fn div_floor_by_last_modulus(&self, a: &PolyRNS<u64>, b: &mut PolyRNS<u64>){
assert!(b.level() >= a.level()-1, "invalid input b: b.level()={} < a.level()-1={}", b.level(), a.level()-1);
let level = self.level();
let rescaling_constants: Vec<Barrett<u64>> = self.rescaling_constant();
let rescaling_constants:crate::modulus::barrett::BarrettRNS<u64> = self.rescaling_constant();
for (i, r) in self.0[0..level].iter().enumerate(){
r.sum_aqqmb_prod_c_scalar_barrett::<ONCE>(a.at(level), a.at(i), &rescaling_constants[i], b.at_mut(i));
r.sum_aqqmb_prod_c_scalar_barrett::<ONCE>(a.at(level), a.at(i), &rescaling_constants.0[i], b.at_mut(i));
}
}
/// Updates a to floor(b / q[b.level()]).
pub fn div_floor_by_last_modulus_inplace(&self, a: &mut PolyRNS<u64>){
let level = self.level();
let rescaling_constants: Vec<Barrett<u64>> = self.rescaling_constant();
let rescaling_constants: BarrettRNS<u64> = self.rescaling_constant();
let (a_i, a_level) = a.split_at_mut(level);
for (i, r) in self.0[0..level].iter().enumerate(){
r.sum_aqqmb_prod_c_scalar_barrett_inplace::<ONCE>(&a_level[0], &rescaling_constants[i], &mut a_i[i]);
r.sum_aqqmb_prod_c_scalar_barrett_inplace::<ONCE>(&a_level[0], &rescaling_constants.0[i], &mut a_i[i]);
}
}
@@ -76,6 +76,7 @@ impl RingRNS<'_, u64>{
#[cfg(test)]
mod tests {
use num_bigint::BigInt;
use crate::ring::Ring;
use crate::ring::impl_u64::ring_rns::new_rings;
use super::*;
@@ -83,16 +84,36 @@ mod tests {
#[test]
fn test_div_floor_by_last_modulus_ntt() {
let n = 1<<10;
let moduli: Vec<u64> = vec![0x1fffffffffe00001u64, 0x1fffffffffc80001u64];
let moduli: Vec<u64> = vec![0x1fffffffffc80001u64, 0x1fffffffffe00001u64];
let rings: Vec<Ring<u64>> = new_rings(n, moduli);
let ring_rns = RingRNS::new(&rings);
let a: PolyRNS<u64> = ring_rns.new_polyrns();
let mut a: PolyRNS<u64> = ring_rns.new_polyrns();
let mut b: PolyRNS<u64> = ring_rns.new_polyrns();
let mut c: PolyRNS<u64> = ring_rns.new_polyrns();
let mut c: PolyRNS<u64> = ring_rns.at_level(ring_rns.level()-1).new_polyrns();
// Allocates an rns poly with values [0..n]
let mut coeffs_a: Vec<BigInt> = (0..n).map(|i|{BigInt::from(i)}).collect();
ring_rns.from_bigint_inplace(&coeffs_a, 1, &mut a);
// Scales by q_level both a and coeffs_a
let scalar: u64 = ring_rns.0[ring_rns.level()].modulus.q;
ring_rns.mul_scalar_inplace::<ONCE>(&scalar, &mut a);
let scalar_big = BigInt::from(scalar);
coeffs_a.iter_mut().for_each(|a|{*a *= &scalar_big});
// Performs c = intt(ntt(a) / q_level)
ring_rns.ntt_inplace::<false>(&mut a);
ring_rns.div_floor_by_last_modulus_ntt(&a, &mut b, &mut c);
ring_rns.at_level(c.level()).intt_inplace::<false>(&mut c);
//assert!(m_precomp.mul_external::<ONCE>(y_mont, x) == (x as u128 * y as u128 % q as u128) as u64);
// Exports c to coeffs_c
let mut coeffs_c = vec![BigInt::from(0);c.n()];
ring_rns.at_level(c.level()).to_bigint_inplace(&c, 1, &mut coeffs_c);
// Performs floor division on a
coeffs_a.iter_mut().for_each(|a|{*a /= &scalar_big});
assert!(coeffs_a == coeffs_c);
}
}