poly.rs 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691
  1. #[cfg(target_feature = "avx2")]
  2. use std::arch::x86_64::*;
  3. use rand::distributions::Standard;
  4. use rand::Rng;
  5. use std::cell::RefCell;
  6. use std::ops::{Add, Mul, Neg};
  7. use crate::{aligned_memory::*, arith::*, discrete_gaussian::*, ntt::*, params::*, util::*};
  8. const SCRATCH_SPACE: usize = 8192;
  9. thread_local!(static SCRATCH: RefCell<AlignedMemory64> = RefCell::new(AlignedMemory64::new(SCRATCH_SPACE)));
  10. pub trait PolyMatrix<'a> {
  11. fn is_ntt(&self) -> bool;
  12. fn get_rows(&self) -> usize;
  13. fn get_cols(&self) -> usize;
  14. fn get_params(&self) -> &Params;
  15. fn num_words(&self) -> usize;
  16. fn zero(params: &'a Params, rows: usize, cols: usize) -> Self;
  17. fn random(params: &'a Params, rows: usize, cols: usize) -> Self;
  18. fn random_rng<T: Rng>(params: &'a Params, rows: usize, cols: usize, rng: &mut T) -> Self;
  19. fn as_slice(&self) -> &[u64];
  20. fn as_mut_slice(&mut self) -> &mut [u64];
  21. fn zero_out(&mut self) {
  22. for item in self.as_mut_slice() {
  23. *item = 0;
  24. }
  25. }
  26. fn get_poly(&self, row: usize, col: usize) -> &[u64] {
  27. let num_words = self.num_words();
  28. let start = (row * self.get_cols() + col) * num_words;
  29. &self.as_slice()[start..start + num_words]
  30. }
  31. fn get_poly_mut(&mut self, row: usize, col: usize) -> &mut [u64] {
  32. let num_words = self.num_words();
  33. let start = (row * self.get_cols() + col) * num_words;
  34. &mut self.as_mut_slice()[start..start + num_words]
  35. }
  36. fn copy_into(&mut self, p: &Self, target_row: usize, target_col: usize) {
  37. assert!(target_row < self.get_rows());
  38. assert!(target_col < self.get_cols());
  39. assert!(target_row + p.get_rows() <= self.get_rows());
  40. assert!(target_col + p.get_cols() <= self.get_cols());
  41. for r in 0..p.get_rows() {
  42. for c in 0..p.get_cols() {
  43. let pol_src = p.get_poly(r, c);
  44. let pol_dst = self.get_poly_mut(target_row + r, target_col + c);
  45. pol_dst.copy_from_slice(pol_src);
  46. }
  47. }
  48. }
  49. fn submatrix(&self, target_row: usize, target_col: usize, rows: usize, cols: usize) -> Self;
  50. fn pad_top(&self, pad_rows: usize) -> Self;
  51. }
  52. pub struct PolyMatrixRaw<'a> {
  53. pub params: &'a Params,
  54. pub rows: usize,
  55. pub cols: usize,
  56. pub data: AlignedMemory64,
  57. }
  58. pub struct PolyMatrixNTT<'a> {
  59. pub params: &'a Params,
  60. pub rows: usize,
  61. pub cols: usize,
  62. pub data: AlignedMemory64,
  63. }
  64. impl<'a> PolyMatrix<'a> for PolyMatrixRaw<'a> {
  65. fn is_ntt(&self) -> bool {
  66. false
  67. }
  68. fn get_rows(&self) -> usize {
  69. self.rows
  70. }
  71. fn get_cols(&self) -> usize {
  72. self.cols
  73. }
  74. fn get_params(&self) -> &Params {
  75. &self.params
  76. }
  77. fn as_slice(&self) -> &[u64] {
  78. self.data.as_slice()
  79. }
  80. fn as_mut_slice(&mut self) -> &mut [u64] {
  81. self.data.as_mut_slice()
  82. }
  83. fn num_words(&self) -> usize {
  84. self.params.poly_len
  85. }
  86. fn zero(params: &'a Params, rows: usize, cols: usize) -> PolyMatrixRaw<'a> {
  87. let num_coeffs = rows * cols * params.poly_len;
  88. let data = AlignedMemory64::new(num_coeffs);
  89. PolyMatrixRaw {
  90. params,
  91. rows,
  92. cols,
  93. data,
  94. }
  95. }
  96. fn random_rng<T: Rng>(params: &'a Params, rows: usize, cols: usize, rng: &mut T) -> Self {
  97. let mut iter = rng.sample_iter(&Standard);
  98. let mut out = PolyMatrixRaw::zero(params, rows, cols);
  99. for r in 0..rows {
  100. for c in 0..cols {
  101. for i in 0..params.poly_len {
  102. let val: u64 = iter.next().unwrap();
  103. out.get_poly_mut(r, c)[i] = val % params.modulus;
  104. }
  105. }
  106. }
  107. out
  108. }
  109. fn random(params: &'a Params, rows: usize, cols: usize) -> Self {
  110. let mut rng = rand::thread_rng();
  111. Self::random_rng(params, rows, cols, &mut rng)
  112. }
  113. fn pad_top(&self, pad_rows: usize) -> Self {
  114. let mut padded = Self::zero(self.params, self.rows + pad_rows, self.cols);
  115. padded.copy_into(&self, pad_rows, 0);
  116. padded
  117. }
  118. fn submatrix(&self, target_row: usize, target_col: usize, rows: usize, cols: usize) -> Self {
  119. let mut m = Self::zero(self.params, rows, cols);
  120. assert!(target_row < self.rows);
  121. assert!(target_col < self.cols);
  122. assert!(target_row + rows <= self.rows);
  123. assert!(target_col + cols <= self.cols);
  124. for r in 0..rows {
  125. for c in 0..cols {
  126. let pol_src = self.get_poly(target_row + r, target_col + c);
  127. let pol_dst = m.get_poly_mut(r, c);
  128. pol_dst.copy_from_slice(pol_src);
  129. }
  130. }
  131. m
  132. }
  133. }
  134. impl<'a> PolyMatrixRaw<'a> {
  135. pub fn identity(params: &'a Params, rows: usize, cols: usize) -> PolyMatrixRaw<'a> {
  136. let num_coeffs = rows * cols * params.poly_len;
  137. let mut data = AlignedMemory::new(num_coeffs);
  138. for r in 0..rows {
  139. let c = r;
  140. let idx = r * cols * params.poly_len + c * params.poly_len;
  141. data[idx] = 1;
  142. }
  143. PolyMatrixRaw {
  144. params,
  145. rows,
  146. cols,
  147. data,
  148. }
  149. }
  150. pub fn noise<T: Rng>(
  151. params: &'a Params,
  152. rows: usize,
  153. cols: usize,
  154. dg: &mut DiscreteGaussian<T>,
  155. ) -> Self {
  156. let mut out = PolyMatrixRaw::zero(params, rows, cols);
  157. dg.sample_matrix(&mut out);
  158. out
  159. }
  160. pub fn ntt(&self) -> PolyMatrixNTT<'a> {
  161. to_ntt_alloc(&self)
  162. }
  163. pub fn reduce_mod(&mut self, modulus: u64) {
  164. for r in 0..self.rows {
  165. for c in 0..self.cols {
  166. for z in 0..self.params.poly_len {
  167. self.get_poly_mut(r, c)[z] %= modulus;
  168. }
  169. }
  170. }
  171. }
  172. pub fn to_vec(&self, modulus_bits: usize, num_coeffs: usize) -> Vec<u8> {
  173. let sz_bits = self.rows * self.cols * num_coeffs * modulus_bits;
  174. let sz_bytes = f64::ceil((sz_bits as f64) / 8f64) as usize + 32;
  175. let sz_bytes_roundup_16 = ((sz_bytes + 15) / 16) * 16;
  176. let mut data = vec![0u8; sz_bytes_roundup_16];
  177. let mut bit_offs = 0;
  178. for r in 0..self.rows {
  179. for c in 0..self.cols {
  180. for z in 0..num_coeffs {
  181. write_arbitrary_bits(
  182. data.as_mut_slice(),
  183. self.get_poly(r, c)[z],
  184. bit_offs,
  185. modulus_bits,
  186. );
  187. bit_offs += modulus_bits;
  188. }
  189. // round bit_offs down to nearest byte boundary
  190. bit_offs = (bit_offs / 8) * 8
  191. }
  192. }
  193. data
  194. }
  195. pub fn single_value(params: &'a Params, value: u64) -> PolyMatrixRaw<'a> {
  196. let mut out = Self::zero(params, 1, 1);
  197. out.data[0] = value;
  198. out
  199. }
  200. }
  201. impl<'a> PolyMatrix<'a> for PolyMatrixNTT<'a> {
  202. fn is_ntt(&self) -> bool {
  203. true
  204. }
  205. fn get_rows(&self) -> usize {
  206. self.rows
  207. }
  208. fn get_cols(&self) -> usize {
  209. self.cols
  210. }
  211. fn get_params(&self) -> &Params {
  212. &self.params
  213. }
  214. fn as_slice(&self) -> &[u64] {
  215. self.data.as_slice()
  216. }
  217. fn as_mut_slice(&mut self) -> &mut [u64] {
  218. self.data.as_mut_slice()
  219. }
  220. fn num_words(&self) -> usize {
  221. self.params.poly_len * self.params.crt_count
  222. }
  223. fn zero(params: &'a Params, rows: usize, cols: usize) -> PolyMatrixNTT<'a> {
  224. let num_coeffs = rows * cols * params.poly_len * params.crt_count;
  225. let data = AlignedMemory::new(num_coeffs);
  226. PolyMatrixNTT {
  227. params,
  228. rows,
  229. cols,
  230. data,
  231. }
  232. }
  233. fn random_rng<T: Rng>(params: &'a Params, rows: usize, cols: usize, rng: &mut T) -> Self {
  234. let mut iter = rng.sample_iter(&Standard);
  235. let mut out = PolyMatrixNTT::zero(params, rows, cols);
  236. for r in 0..rows {
  237. for c in 0..cols {
  238. for i in 0..params.crt_count {
  239. for j in 0..params.poly_len {
  240. let idx = calc_index(&[i, j], &[params.crt_count, params.poly_len]);
  241. let val: u64 = iter.next().unwrap();
  242. out.get_poly_mut(r, c)[idx] = val % params.moduli[i];
  243. }
  244. }
  245. }
  246. }
  247. out
  248. }
  249. fn random(params: &'a Params, rows: usize, cols: usize) -> Self {
  250. let mut rng = rand::thread_rng();
  251. Self::random_rng(params, rows, cols, &mut rng)
  252. }
  253. fn pad_top(&self, pad_rows: usize) -> Self {
  254. let mut padded = Self::zero(self.params, self.rows + pad_rows, self.cols);
  255. padded.copy_into(&self, pad_rows, 0);
  256. padded
  257. }
  258. fn submatrix(&self, target_row: usize, target_col: usize, rows: usize, cols: usize) -> Self {
  259. let mut m = Self::zero(self.params, rows, cols);
  260. assert!(target_row < self.rows);
  261. assert!(target_col < self.cols);
  262. assert!(target_row + rows <= self.rows);
  263. assert!(target_col + cols <= self.cols);
  264. for r in 0..rows {
  265. for c in 0..cols {
  266. let pol_src = self.get_poly(target_row + r, target_col + c);
  267. let pol_dst = m.get_poly_mut(r, c);
  268. pol_dst.copy_from_slice(pol_src);
  269. }
  270. }
  271. m
  272. }
  273. }
  274. impl<'a> PolyMatrixNTT<'a> {
  275. pub fn raw(&self) -> PolyMatrixRaw<'a> {
  276. from_ntt_alloc(&self)
  277. }
  278. }
  279. pub fn multiply_poly(params: &Params, res: &mut [u64], a: &[u64], b: &[u64]) {
  280. for c in 0..params.crt_count {
  281. for i in 0..params.poly_len {
  282. let idx = c * params.poly_len + i;
  283. res[idx] = multiply_modular(params, a[idx], b[idx], c);
  284. }
  285. }
  286. }
  287. pub fn multiply_add_poly(params: &Params, res: &mut [u64], a: &[u64], b: &[u64]) {
  288. for c in 0..params.crt_count {
  289. for i in 0..params.poly_len {
  290. let idx = c * params.poly_len + i;
  291. res[idx] = multiply_add_modular(params, a[idx], b[idx], res[idx], c);
  292. }
  293. }
  294. }
  295. pub fn add_poly(params: &Params, res: &mut [u64], a: &[u64], b: &[u64]) {
  296. for c in 0..params.crt_count {
  297. for i in 0..params.poly_len {
  298. let idx = c * params.poly_len + i;
  299. res[idx] = add_modular(params, a[idx], b[idx], c);
  300. }
  301. }
  302. }
  303. pub fn add_poly_into(params: &Params, res: &mut [u64], a: &[u64]) {
  304. for c in 0..params.crt_count {
  305. for i in 0..params.poly_len {
  306. let idx = c * params.poly_len + i;
  307. res[idx] = add_modular(params, res[idx], a[idx], c);
  308. }
  309. }
  310. }
  311. pub fn invert_poly(params: &Params, res: &mut [u64], a: &[u64]) {
  312. for i in 0..params.poly_len {
  313. res[i] = params.modulus - a[i];
  314. }
  315. }
  316. pub fn automorph_poly(params: &Params, res: &mut [u64], a: &[u64], t: usize) {
  317. let poly_len = params.poly_len;
  318. for i in 0..poly_len {
  319. let num = (i * t) / poly_len;
  320. let rem = (i * t) % poly_len;
  321. if num % 2 == 0 {
  322. res[rem] = a[i];
  323. } else {
  324. res[rem] = params.modulus - a[i];
  325. }
  326. }
  327. }
  328. #[cfg(target_feature = "avx2")]
  329. pub fn multiply_add_poly_avx(params: &Params, res: &mut [u64], a: &[u64], b: &[u64]) {
  330. for c in 0..params.crt_count {
  331. for i in (0..params.poly_len).step_by(4) {
  332. unsafe {
  333. let p_x = &a[c * params.poly_len + i] as *const u64;
  334. let p_y = &b[c * params.poly_len + i] as *const u64;
  335. let p_z = &mut res[c * params.poly_len + i] as *mut u64;
  336. let x = _mm256_load_si256(p_x as *const __m256i);
  337. let y = _mm256_load_si256(p_y as *const __m256i);
  338. let z = _mm256_load_si256(p_z as *const __m256i);
  339. let product = _mm256_mul_epu32(x, y);
  340. let out = _mm256_add_epi64(z, product);
  341. _mm256_store_si256(p_z as *mut __m256i, out);
  342. }
  343. }
  344. }
  345. }
  346. pub fn modular_reduce(params: &Params, res: &mut [u64]) {
  347. for c in 0..params.crt_count {
  348. for i in 0..params.poly_len {
  349. let idx = c * params.poly_len + i;
  350. res[idx] = barrett_coeff_u64(params, res[idx], c);
  351. }
  352. }
  353. }
  354. #[cfg(not(target_feature = "avx2"))]
  355. pub fn multiply(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT, b: &PolyMatrixNTT) {
  356. assert!(res.rows == a.rows);
  357. assert!(res.cols == b.cols);
  358. assert!(a.cols == b.rows);
  359. let params = res.params;
  360. for i in 0..a.rows {
  361. for j in 0..b.cols {
  362. for z in 0..params.poly_len * params.crt_count {
  363. res.get_poly_mut(i, j)[z] = 0;
  364. }
  365. for k in 0..a.cols {
  366. let params = res.params;
  367. let res_poly = res.get_poly_mut(i, j);
  368. let pol1 = a.get_poly(i, k);
  369. let pol2 = b.get_poly(k, j);
  370. multiply_add_poly(params, res_poly, pol1, pol2);
  371. }
  372. }
  373. }
  374. }
  375. #[cfg(target_feature = "avx2")]
  376. pub fn multiply(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT, b: &PolyMatrixNTT) {
  377. assert_eq!(res.rows, a.rows);
  378. assert_eq!(res.cols, b.cols);
  379. assert_eq!(a.cols, b.rows);
  380. let params = res.params;
  381. for i in 0..a.rows {
  382. for j in 0..b.cols {
  383. for z in 0..params.poly_len * params.crt_count {
  384. res.get_poly_mut(i, j)[z] = 0;
  385. }
  386. let res_poly = res.get_poly_mut(i, j);
  387. for k in 0..a.cols {
  388. let pol1 = a.get_poly(i, k);
  389. let pol2 = b.get_poly(k, j);
  390. multiply_add_poly_avx(params, res_poly, pol1, pol2);
  391. }
  392. modular_reduce(params, res_poly);
  393. }
  394. }
  395. }
  396. pub fn add(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT, b: &PolyMatrixNTT) {
  397. assert!(res.rows == a.rows);
  398. assert!(res.cols == a.cols);
  399. assert!(a.rows == b.rows);
  400. assert!(a.cols == b.cols);
  401. let params = res.params;
  402. for i in 0..a.rows {
  403. for j in 0..a.cols {
  404. let res_poly = res.get_poly_mut(i, j);
  405. let pol1 = a.get_poly(i, j);
  406. let pol2 = b.get_poly(i, j);
  407. add_poly(params, res_poly, pol1, pol2);
  408. }
  409. }
  410. }
  411. pub fn add_into(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT) {
  412. assert!(res.rows == a.rows);
  413. assert!(res.cols == a.cols);
  414. let params = res.params;
  415. for i in 0..res.rows {
  416. for j in 0..res.cols {
  417. let res_poly = res.get_poly_mut(i, j);
  418. let pol2 = a.get_poly(i, j);
  419. add_poly_into(params, res_poly, pol2);
  420. }
  421. }
  422. }
  423. pub fn invert(res: &mut PolyMatrixRaw, a: &PolyMatrixRaw) {
  424. assert!(res.rows == a.rows);
  425. assert!(res.cols == a.cols);
  426. let params = res.params;
  427. for i in 0..a.rows {
  428. for j in 0..a.cols {
  429. let res_poly = res.get_poly_mut(i, j);
  430. let pol1 = a.get_poly(i, j);
  431. invert_poly(params, res_poly, pol1);
  432. }
  433. }
  434. }
  435. pub fn automorph<'a>(res: &mut PolyMatrixRaw<'a>, a: &PolyMatrixRaw<'a>, t: usize) {
  436. assert!(res.rows == a.rows);
  437. assert!(res.cols == a.cols);
  438. let params = res.params;
  439. for i in 0..a.rows {
  440. for j in 0..a.cols {
  441. let res_poly = res.get_poly_mut(i, j);
  442. let pol1 = a.get_poly(i, j);
  443. automorph_poly(params, res_poly, pol1, t);
  444. }
  445. }
  446. }
  447. pub fn automorph_alloc<'a>(a: &PolyMatrixRaw<'a>, t: usize) -> PolyMatrixRaw<'a> {
  448. let mut res = PolyMatrixRaw::zero(a.params, a.rows, a.cols);
  449. automorph(&mut res, a, t);
  450. res
  451. }
  452. pub fn stack<'a>(a: &PolyMatrixRaw<'a>, b: &PolyMatrixRaw<'a>) -> PolyMatrixRaw<'a> {
  453. assert_eq!(a.cols, b.cols);
  454. let mut c = PolyMatrixRaw::zero(a.params, a.rows + b.rows, a.cols);
  455. c.copy_into(a, 0, 0);
  456. c.copy_into(b, a.rows, 0);
  457. c
  458. }
  459. pub fn scalar_multiply(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT, b: &PolyMatrixNTT) {
  460. assert_eq!(a.rows, 1);
  461. assert_eq!(a.cols, 1);
  462. let params = res.params;
  463. let pol2 = a.get_poly(0, 0);
  464. for i in 0..b.rows {
  465. for j in 0..b.cols {
  466. let res_poly = res.get_poly_mut(i, j);
  467. let pol1 = b.get_poly(i, j);
  468. multiply_poly(params, res_poly, pol1, pol2);
  469. }
  470. }
  471. }
  472. pub fn scalar_multiply_alloc<'a>(
  473. a: &PolyMatrixNTT<'a>,
  474. b: &PolyMatrixNTT<'a>,
  475. ) -> PolyMatrixNTT<'a> {
  476. let mut res = PolyMatrixNTT::zero(b.params, b.rows, b.cols);
  477. scalar_multiply(&mut res, a, b);
  478. res
  479. }
  480. pub fn single_poly<'a>(params: &'a Params, val: u64) -> PolyMatrixRaw<'a> {
  481. let mut res = PolyMatrixRaw::zero(params, 1, 1);
  482. res.get_poly_mut(0, 0)[0] = val;
  483. res
  484. }
  485. fn reduce_copy(params: &Params, out: &mut [u64], inp: &[u64]) {
  486. for n in 0..params.crt_count {
  487. for z in 0..params.poly_len {
  488. out[n * params.poly_len + z] = barrett_coeff_u64(params, inp[z], n);
  489. }
  490. }
  491. }
  492. pub fn to_ntt(a: &mut PolyMatrixNTT, b: &PolyMatrixRaw) {
  493. let params = a.params;
  494. for r in 0..a.rows {
  495. for c in 0..a.cols {
  496. let pol_src = b.get_poly(r, c);
  497. let pol_dst = a.get_poly_mut(r, c);
  498. reduce_copy(params, pol_dst, pol_src);
  499. ntt_forward(params, pol_dst);
  500. }
  501. }
  502. }
  503. pub fn to_ntt_no_reduce(a: &mut PolyMatrixNTT, b: &PolyMatrixRaw) {
  504. let params = a.params;
  505. for r in 0..a.rows {
  506. for c in 0..a.cols {
  507. let pol_src = b.get_poly(r, c);
  508. let pol_dst = a.get_poly_mut(r, c);
  509. for n in 0..params.crt_count {
  510. let idx = n * params.poly_len;
  511. pol_dst[idx..idx + params.poly_len].copy_from_slice(pol_src);
  512. }
  513. ntt_forward(params, pol_dst);
  514. }
  515. }
  516. }
  517. pub fn to_ntt_alloc<'a>(b: &PolyMatrixRaw<'a>) -> PolyMatrixNTT<'a> {
  518. let mut a = PolyMatrixNTT::zero(b.params, b.rows, b.cols);
  519. to_ntt(&mut a, b);
  520. a
  521. }
  522. pub fn from_ntt(a: &mut PolyMatrixRaw, b: &PolyMatrixNTT) {
  523. let params = a.params;
  524. SCRATCH.with(|scratch_cell| {
  525. let scratch_vec = &mut *scratch_cell.borrow_mut();
  526. let scratch = scratch_vec.as_mut_slice();
  527. for r in 0..a.rows {
  528. for c in 0..a.cols {
  529. let pol_src = b.get_poly(r, c);
  530. let pol_dst = a.get_poly_mut(r, c);
  531. scratch[0..pol_src.len()].copy_from_slice(pol_src);
  532. ntt_inverse(params, scratch);
  533. for z in 0..params.poly_len {
  534. pol_dst[z] = params.crt_compose(scratch, z);
  535. }
  536. }
  537. }
  538. });
  539. }
  540. pub fn from_ntt_alloc<'a>(b: &PolyMatrixNTT<'a>) -> PolyMatrixRaw<'a> {
  541. let mut a = PolyMatrixRaw::zero(b.params, b.rows, b.cols);
  542. from_ntt(&mut a, b);
  543. a
  544. }
  545. impl<'a, 'b> Neg for &'b PolyMatrixRaw<'a> {
  546. type Output = PolyMatrixRaw<'a>;
  547. fn neg(self) -> Self::Output {
  548. let mut out = PolyMatrixRaw::zero(self.params, self.rows, self.cols);
  549. invert(&mut out, self);
  550. out
  551. }
  552. }
  553. impl<'a, 'b> Mul for &'b PolyMatrixNTT<'a> {
  554. type Output = PolyMatrixNTT<'a>;
  555. fn mul(self, rhs: Self) -> Self::Output {
  556. let mut out = PolyMatrixNTT::zero(self.params, self.rows, rhs.cols);
  557. multiply(&mut out, self, rhs);
  558. out
  559. }
  560. }
  561. impl<'a, 'b> Add for &'b PolyMatrixNTT<'a> {
  562. type Output = PolyMatrixNTT<'a>;
  563. fn add(self, rhs: Self) -> Self::Output {
  564. let mut out = PolyMatrixNTT::zero(self.params, self.rows, self.cols);
  565. add(&mut out, self, rhs);
  566. out
  567. }
  568. }
  569. #[cfg(test)]
  570. mod test {
  571. use super::*;
  572. fn get_params() -> Params {
  573. get_test_params()
  574. }
  575. fn assert_all_zero(a: &[u64]) {
  576. for i in a {
  577. assert_eq!(*i, 0);
  578. }
  579. }
  580. #[test]
  581. fn sets_all_zeros() {
  582. let params = get_params();
  583. let m1 = PolyMatrixNTT::zero(&params, 2, 1);
  584. assert_all_zero(m1.as_slice());
  585. }
  586. #[test]
  587. fn multiply_correctness() {
  588. let params = get_params();
  589. let m1 = PolyMatrixNTT::zero(&params, 2, 1);
  590. let m2 = PolyMatrixNTT::zero(&params, 3, 2);
  591. let m3 = &m2 * &m1;
  592. assert_all_zero(m3.as_slice());
  593. }
  594. #[test]
  595. fn full_multiply_correctness() {
  596. let params = get_params();
  597. let mut m1 = PolyMatrixRaw::zero(&params, 1, 1);
  598. let mut m2 = PolyMatrixRaw::zero(&params, 1, 1);
  599. m1.get_poly_mut(0, 0)[1] = 100;
  600. m2.get_poly_mut(0, 0)[1] = 7;
  601. let m1_ntt = to_ntt_alloc(&m1);
  602. let m2_ntt = to_ntt_alloc(&m2);
  603. let m3_ntt = &m1_ntt * &m2_ntt;
  604. let m3 = from_ntt_alloc(&m3_ntt);
  605. assert_eq!(m3.get_poly(0, 0)[2], 700);
  606. }
  607. #[test]
  608. fn to_vec_correctness() {
  609. let params = get_params();
  610. let mut m1 = PolyMatrixRaw::zero(&params, 1, 1);
  611. for i in 0..params.poly_len {
  612. m1.data[i] = 1;
  613. }
  614. let modulus_bits = 9;
  615. let v = m1.to_vec(modulus_bits, params.poly_len);
  616. for i in 0..v.len() {
  617. println!("{:?}", v[i]);
  618. }
  619. let mut bit_offs = 0;
  620. for i in 0..params.poly_len {
  621. let val = read_arbitrary_bits(v.as_slice(), bit_offs, modulus_bits);
  622. assert_eq!(m1.data[i], val);
  623. bit_offs += modulus_bits;
  624. }
  625. }
  626. }