poly.rs 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544
  1. #[cfg(target_feature = "avx2")]
  2. use std::arch::x86_64::*;
  3. use std::ops::{Add, Mul, Neg};
  4. use std::cell::RefCell;
  5. use rand::Rng;
  6. use rand::distributions::Standard;
  7. use crate::{arith::*, params::*, ntt::*, util::*, discrete_gaussian::*};
  8. const SCRATCH_SPACE: usize = 8192;
  9. thread_local!(static SCRATCH: RefCell<Vec<u64>> = RefCell::new(vec![0u64; 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 as_slice(&self) -> &[u64];
  19. fn as_mut_slice(&mut self) -> &mut [u64];
  20. fn zero_out(&mut self) {
  21. for item in self.as_mut_slice() {
  22. *item = 0;
  23. }
  24. }
  25. fn get_poly(&self, row: usize, col: usize) -> &[u64] {
  26. let num_words = self.num_words();
  27. let start = (row * self.get_cols() + col) * num_words;
  28. &self.as_slice()[start..start + num_words]
  29. }
  30. fn get_poly_mut(&mut self, row: usize, col: usize) -> &mut [u64] {
  31. let num_words = self.num_words();
  32. let start = (row * self.get_cols() + col) * num_words;
  33. &mut self.as_mut_slice()[start..start + num_words]
  34. }
  35. fn copy_into(&mut self, p: &Self, target_row: usize, target_col: usize) {
  36. assert!(target_row < self.get_rows());
  37. assert!(target_col < self.get_cols());
  38. assert!(target_row + p.get_rows() < self.get_rows());
  39. assert!(target_col + p.get_cols() < self.get_cols());
  40. for r in 0..p.get_rows() {
  41. for c in 0..p.get_cols() {
  42. let pol_src = p.get_poly(r, c);
  43. let pol_dst = self.get_poly_mut(target_row + r, target_col + c);
  44. pol_dst.copy_from_slice(pol_src);
  45. }
  46. }
  47. }
  48. fn pad_top(&self, pad_rows: usize) -> Self;
  49. }
  50. pub struct PolyMatrixRaw<'a> {
  51. pub params: &'a Params,
  52. pub rows: usize,
  53. pub cols: usize,
  54. pub data: Vec<u64>,
  55. }
  56. pub struct PolyMatrixNTT<'a> {
  57. pub params: &'a Params,
  58. pub rows: usize,
  59. pub cols: usize,
  60. pub data: Vec<u64>,
  61. }
  62. impl<'a> PolyMatrix<'a> for PolyMatrixRaw<'a> {
  63. fn is_ntt(&self) -> bool {
  64. false
  65. }
  66. fn get_rows(&self) -> usize {
  67. self.rows
  68. }
  69. fn get_cols(&self) -> usize {
  70. self.cols
  71. }
  72. fn get_params(&self) -> &Params {
  73. &self.params
  74. }
  75. fn as_slice(&self) -> &[u64] {
  76. self.data.as_slice()
  77. }
  78. fn as_mut_slice(&mut self) -> &mut [u64] {
  79. self.data.as_mut_slice()
  80. }
  81. fn num_words(&self) -> usize {
  82. self.params.poly_len
  83. }
  84. fn zero(params: &'a Params, rows: usize, cols: usize) -> PolyMatrixRaw<'a> {
  85. let num_coeffs = rows * cols * params.poly_len;
  86. let data: Vec<u64> = vec![0; num_coeffs];
  87. PolyMatrixRaw {
  88. params,
  89. rows,
  90. cols,
  91. data,
  92. }
  93. }
  94. fn random(params: &'a Params, rows: usize, cols: usize) -> Self {
  95. let rng = rand::thread_rng();
  96. let mut iter = rng.sample_iter(&Standard);
  97. let mut out = PolyMatrixRaw::zero(params, rows, cols);
  98. for r in 0..rows {
  99. for c in 0..cols {
  100. for i in 0..params.poly_len {
  101. let val: u64 = iter.next().unwrap();
  102. out.get_poly_mut(r, c)[i] = val % params.modulus;
  103. }
  104. }
  105. }
  106. out
  107. }
  108. fn pad_top(&self, pad_rows: usize) -> Self {
  109. let mut padded = Self::zero(self.params, self.rows + pad_rows, self.cols);
  110. padded.copy_into(&self, pad_rows, 0);
  111. padded
  112. }
  113. }
  114. impl<'a> PolyMatrixRaw<'a> {
  115. pub fn identity(params: &'a Params, rows: usize, cols: usize) -> PolyMatrixRaw<'a> {
  116. let num_coeffs = rows * cols * params.poly_len;
  117. let mut data: Vec<u64> = vec![0; num_coeffs];
  118. for r in 0..rows {
  119. let c = r;
  120. let idx = r * cols * params.poly_len + c * params.poly_len;
  121. data[idx] = 1;
  122. }
  123. PolyMatrixRaw {
  124. params,
  125. rows,
  126. cols,
  127. data,
  128. }
  129. }
  130. pub fn noise(params: &'a Params, rows: usize, cols: usize, dg: &mut DiscreteGaussian) -> Self {
  131. let mut out = PolyMatrixRaw::zero(params, rows, cols);
  132. dg.sample_matrix(&mut out);
  133. out
  134. }
  135. pub fn ntt(&self) -> PolyMatrixNTT<'a> {
  136. to_ntt_alloc(&self)
  137. }
  138. }
  139. impl<'a> PolyMatrix<'a> for PolyMatrixNTT<'a> {
  140. fn is_ntt(&self) -> bool {
  141. true
  142. }
  143. fn get_rows(&self) -> usize {
  144. self.rows
  145. }
  146. fn get_cols(&self) -> usize {
  147. self.cols
  148. }
  149. fn get_params(&self) -> &Params {
  150. &self.params
  151. }
  152. fn as_slice(&self) -> &[u64] {
  153. self.data.as_slice()
  154. }
  155. fn as_mut_slice(&mut self) -> &mut [u64] {
  156. self.data.as_mut_slice()
  157. }
  158. fn num_words(&self) -> usize {
  159. self.params.poly_len * self.params.crt_count
  160. }
  161. fn zero(params: &'a Params, rows: usize, cols: usize) -> PolyMatrixNTT<'a> {
  162. let num_coeffs = rows * cols * params.poly_len * params.crt_count;
  163. let data: Vec<u64> = vec![0; num_coeffs];
  164. PolyMatrixNTT {
  165. params,
  166. rows,
  167. cols,
  168. data,
  169. }
  170. }
  171. fn random(params: &'a Params, rows: usize, cols: usize) -> Self {
  172. let rng = rand::thread_rng();
  173. let mut iter = rng.sample_iter(&Standard);
  174. let mut out = PolyMatrixNTT::zero(params, rows, cols);
  175. for r in 0..rows {
  176. for c in 0..cols {
  177. for i in 0..params.crt_count {
  178. for j in 0..params.poly_len {
  179. let idx = calc_index(&[i, j], &[params.crt_count, params.poly_len]);
  180. let val: u64 = iter.next().unwrap();
  181. out.get_poly_mut(r, c)[idx] = val % params.moduli[i];
  182. }
  183. }
  184. }
  185. }
  186. out
  187. }
  188. fn pad_top(&self, pad_rows: usize) -> Self {
  189. let mut padded = Self::zero(self.params, self.rows + pad_rows, self.cols);
  190. padded.copy_into(&self, pad_rows, 0);
  191. padded
  192. }
  193. }
  194. impl<'a> PolyMatrixNTT<'a> {
  195. pub fn raw(&self) -> PolyMatrixRaw<'a> {
  196. from_ntt_alloc(&self)
  197. }
  198. }
  199. pub fn multiply_poly(params: &Params, res: &mut [u64], a: &[u64], b: &[u64]) {
  200. for c in 0..params.crt_count {
  201. for i in 0..params.poly_len {
  202. let idx = c * params.poly_len + i;
  203. res[idx] = multiply_modular(params, a[idx], b[idx], c);
  204. }
  205. }
  206. }
  207. pub fn multiply_add_poly(params: &Params, res: &mut [u64], a: &[u64], b: &[u64]) {
  208. for c in 0..params.crt_count {
  209. for i in 0..params.poly_len {
  210. let idx = c * params.poly_len + i;
  211. res[idx] = multiply_add_modular(params, a[idx], b[idx], res[idx], c);
  212. }
  213. }
  214. }
  215. pub fn add_poly(params: &Params, res: &mut [u64], a: &[u64], b: &[u64]) {
  216. for c in 0..params.crt_count {
  217. for i in 0..params.poly_len {
  218. let idx = c * params.poly_len + i;
  219. res[idx] = add_modular(params, a[idx], b[idx], c);
  220. }
  221. }
  222. }
  223. pub fn invert_poly(params: &Params, res: &mut [u64], a: &[u64]) {
  224. for c in 0..params.crt_count {
  225. for i in 0..params.poly_len {
  226. let idx = c * params.poly_len + i;
  227. res[idx] = invert_modular(params, a[idx], c);
  228. }
  229. }
  230. }
  231. pub fn automorph_poly(params: &Params, res: &mut [u64], a: &[u64], t: usize) {
  232. let poly_len = params.poly_len;
  233. for i in 0..poly_len {
  234. let num = (i * t) / poly_len;
  235. let rem = (i * t) % poly_len;
  236. if num % 2 == 0 {
  237. res[rem] = a[i];
  238. } else {
  239. res[rem] = params.modulus - a[i];
  240. }
  241. }
  242. }
  243. #[cfg(target_feature = "avx2")]
  244. pub fn multiply_add_poly_avx(params: &Params, res: &mut [u64], a: &[u64], b: &[u64]) {
  245. for c in 0..params.crt_count {
  246. for i in (0..params.poly_len).step_by(4) {
  247. unsafe {
  248. let p_x = &a[c*params.poly_len + i] as *const u64;
  249. let p_y = &b[c*params.poly_len + i] as *const u64;
  250. let p_z = &mut res[c*params.poly_len + i] as *mut u64;
  251. let x = _mm256_loadu_si256(p_x as *const __m256i);
  252. let y = _mm256_loadu_si256(p_y as *const __m256i);
  253. let z = _mm256_loadu_si256(p_z as *const __m256i);
  254. let product = _mm256_mul_epu32(x, y);
  255. let out = _mm256_add_epi64(z, product);
  256. _mm256_storeu_si256(p_z as *mut __m256i, out);
  257. }
  258. }
  259. }
  260. }
  261. pub fn modular_reduce(params: &Params, res: &mut [u64]) {
  262. for c in 0..params.crt_count {
  263. for i in 0..params.poly_len {
  264. res[c*params.poly_len + i] %= params.moduli[c];
  265. }
  266. }
  267. }
  268. #[cfg(not(target_feature = "avx2"))]
  269. pub fn multiply(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT, b: &PolyMatrixNTT) {
  270. assert!(res.rows == a.rows);
  271. assert!(res.cols == b.cols);
  272. assert!(a.cols == b.rows);
  273. let params = res.params;
  274. for i in 0..a.rows {
  275. for j in 0..b.cols {
  276. for z in 0..params.poly_len*params.crt_count {
  277. res.get_poly_mut(i, j)[z] = 0;
  278. }
  279. for k in 0..a.cols {
  280. let params = res.params;
  281. let res_poly = res.get_poly_mut(i, j);
  282. let pol1 = a.get_poly(i, k);
  283. let pol2 = b.get_poly(k, j);
  284. multiply_add_poly(params, res_poly, pol1, pol2);
  285. }
  286. }
  287. }
  288. }
  289. #[cfg(target_feature = "avx2")]
  290. pub fn multiply(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT, b: &PolyMatrixNTT) {
  291. assert!(res.rows == a.rows);
  292. assert!(res.cols == b.cols);
  293. assert!(a.cols == b.rows);
  294. let params = res.params;
  295. for i in 0..a.rows {
  296. for j in 0..b.cols {
  297. for z in 0..params.poly_len*params.crt_count {
  298. res.get_poly_mut(i, j)[z] = 0;
  299. }
  300. let res_poly = res.get_poly_mut(i, j);
  301. for k in 0..a.cols {
  302. let pol1 = a.get_poly(i, k);
  303. let pol2 = b.get_poly(k, j);
  304. multiply_add_poly_avx(params, res_poly, pol1, pol2);
  305. }
  306. modular_reduce(params, res_poly);
  307. }
  308. }
  309. }
  310. pub fn add(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT, b: &PolyMatrixNTT) {
  311. assert!(res.rows == a.rows);
  312. assert!(res.cols == a.cols);
  313. assert!(a.rows == b.rows);
  314. assert!(a.cols == b.cols);
  315. let params = res.params;
  316. for i in 0..a.rows {
  317. for j in 0..a.cols {
  318. let res_poly = res.get_poly_mut(i, j);
  319. let pol1 = a.get_poly(i, j);
  320. let pol2 = b.get_poly(i, j);
  321. add_poly(params, res_poly, pol1, pol2);
  322. }
  323. }
  324. }
  325. pub fn invert(res: &mut PolyMatrixRaw, a: &PolyMatrixRaw) {
  326. assert!(res.rows == a.rows);
  327. assert!(res.cols == a.cols);
  328. let params = res.params;
  329. for i in 0..a.rows {
  330. for j in 0..a.cols {
  331. let res_poly = res.get_poly_mut(i, j);
  332. let pol1 = a.get_poly(i, j);
  333. invert_poly(params, res_poly, pol1);
  334. }
  335. }
  336. }
  337. pub fn automorph<'a>(res: &mut PolyMatrixRaw<'a>, a: &PolyMatrixRaw<'a>, t: usize) {
  338. assert!(res.rows == a.rows);
  339. assert!(res.cols == a.cols);
  340. let params = res.params;
  341. for i in 0..a.rows {
  342. for j in 0..a.cols {
  343. let res_poly = res.get_poly_mut(i, j);
  344. let pol1 = a.get_poly(i, j);
  345. automorph_poly(params, res_poly, pol1, t);
  346. }
  347. }
  348. }
  349. pub fn automorph_alloc<'a>(a: &PolyMatrixRaw<'a>, t: usize) -> PolyMatrixRaw<'a> {
  350. let mut res = PolyMatrixRaw::zero(a.params, a.rows, a.cols);
  351. automorph(&mut res, a, t);
  352. res
  353. }
  354. pub fn stack<'a>(a: &PolyMatrixRaw<'a>, b: &PolyMatrixRaw<'a>) -> PolyMatrixRaw<'a> {
  355. assert_eq!(a.cols, b.cols);
  356. let mut c = PolyMatrixRaw::zero(a.params, a.rows + b.rows, a.cols);
  357. c.copy_into(a, 0, 0);
  358. c.copy_into(b, a.rows, 0);
  359. c
  360. }
  361. pub fn scalar_multiply(res: &mut PolyMatrixNTT, a: &PolyMatrixNTT, b: &PolyMatrixNTT) {
  362. assert_eq!(a.rows, 1);
  363. assert_eq!(a.cols, 1);
  364. let params = res.params;
  365. let pol2 = a.get_poly(0, 0);
  366. for i in 0..b.rows {
  367. for j in 0..b.cols {
  368. let res_poly = res.get_poly_mut(i, j);
  369. let pol1 = b.get_poly(i, j);
  370. multiply_poly(params, res_poly, pol1, pol2);
  371. }
  372. }
  373. }
  374. pub fn scalar_multiply_alloc<'a>(a: &PolyMatrixNTT<'a>, b: &PolyMatrixNTT<'a>) -> PolyMatrixNTT<'a> {
  375. let mut res = PolyMatrixNTT::zero(b.params, b.rows, b.cols);
  376. scalar_multiply(&mut res, a, b);
  377. res
  378. }
  379. pub fn single_poly<'a>(params: &'a Params, val: u64) -> PolyMatrixRaw<'a> {
  380. let mut res = PolyMatrixRaw::zero(params, 1, 1);
  381. res.get_poly_mut(0, 0)[0] = val;
  382. res
  383. }
  384. pub fn to_ntt(a: &mut PolyMatrixNTT, b: &PolyMatrixRaw) {
  385. let params = a.params;
  386. for r in 0..a.rows {
  387. for c in 0..a.cols {
  388. let pol_src = b.get_poly(r, c);
  389. let pol_dst = a.get_poly_mut(r, c);
  390. for n in 0..params.crt_count {
  391. for z in 0..params.poly_len {
  392. pol_dst[n * params.poly_len + z] = pol_src[z] % params.moduli[n];
  393. }
  394. }
  395. ntt_forward(params, pol_dst);
  396. }
  397. }
  398. }
  399. pub fn to_ntt_alloc<'a>(b: &PolyMatrixRaw<'a>) -> PolyMatrixNTT<'a> {
  400. let mut a = PolyMatrixNTT::zero(b.params, b.rows, b.cols);
  401. to_ntt(&mut a, b);
  402. a
  403. }
  404. pub fn from_ntt(a: &mut PolyMatrixRaw, b: &PolyMatrixNTT) {
  405. let params = a.params;
  406. SCRATCH.with(|scratch_cell| {
  407. let scratch_vec = &mut *scratch_cell.borrow_mut();
  408. let scratch = scratch_vec.as_mut_slice();
  409. for r in 0..a.rows {
  410. for c in 0..a.cols {
  411. let pol_src = b.get_poly(r, c);
  412. let pol_dst = a.get_poly_mut(r, c);
  413. scratch[0..pol_src.len()].copy_from_slice(pol_src);
  414. ntt_inverse(params, scratch);
  415. for z in 0..params.poly_len {
  416. pol_dst[z] = params.crt_compose_2(scratch[z], scratch[params.poly_len + z]);
  417. }
  418. }
  419. }
  420. });
  421. }
  422. pub fn from_ntt_alloc<'a>(b: &PolyMatrixNTT<'a>) -> PolyMatrixRaw<'a> {
  423. let mut a = PolyMatrixRaw::zero(b.params, b.rows, b.cols);
  424. from_ntt(&mut a, b);
  425. a
  426. }
  427. impl<'a, 'b> Neg for &'b PolyMatrixRaw<'a> {
  428. type Output = PolyMatrixRaw<'a>;
  429. fn neg(self) -> Self::Output {
  430. let mut out = PolyMatrixRaw::zero(self.params, self.rows, self.cols);
  431. invert(&mut out, self);
  432. out
  433. }
  434. }
  435. impl<'a, 'b> Mul for &'b PolyMatrixNTT<'a> {
  436. type Output = PolyMatrixNTT<'a>;
  437. fn mul(self, rhs: Self) -> Self::Output {
  438. let mut out = PolyMatrixNTT::zero(self.params, self.rows, rhs.cols);
  439. multiply(&mut out, self, rhs);
  440. out
  441. }
  442. }
  443. impl<'a, 'b> Add for &'b PolyMatrixNTT<'a> {
  444. type Output = PolyMatrixNTT<'a>;
  445. fn add(self, rhs: Self) -> Self::Output {
  446. let mut out = PolyMatrixNTT::zero(self.params, self.rows, self.cols);
  447. add(&mut out, self, rhs);
  448. out
  449. }
  450. }
  451. #[cfg(test)]
  452. mod test {
  453. use super::*;
  454. fn get_params() -> Params {
  455. get_test_params()
  456. }
  457. fn assert_all_zero(a: &[u64]) {
  458. for i in a {
  459. assert_eq!(*i, 0);
  460. }
  461. }
  462. #[test]
  463. fn sets_all_zeros() {
  464. let params = get_params();
  465. let m1 = PolyMatrixNTT::zero(&params, 2, 1);
  466. assert_all_zero(m1.as_slice());
  467. }
  468. #[test]
  469. fn multiply_correctness() {
  470. let params = get_params();
  471. let m1 = PolyMatrixNTT::zero(&params, 2, 1);
  472. let m2 = PolyMatrixNTT::zero(&params, 3, 2);
  473. let m3 = &m2 * &m1;
  474. assert_all_zero(m3.as_slice());
  475. }
  476. #[test]
  477. fn full_multiply_correctness() {
  478. let params = get_params();
  479. let mut m1 = PolyMatrixRaw::zero(&params, 1, 1);
  480. let mut m2 = PolyMatrixRaw::zero(&params, 1, 1);
  481. m1.get_poly_mut(0, 0)[1] = 100;
  482. m2.get_poly_mut(0, 0)[1] = 7;
  483. let m1_ntt = to_ntt_alloc(&m1);
  484. let m2_ntt = to_ntt_alloc(&m2);
  485. let m3_ntt = &m1_ntt * &m2_ntt;
  486. let m3 = from_ntt_alloc(&m3_ntt);
  487. assert_eq!(m3.get_poly(0, 0)[2], 700);
  488. }
  489. }