From: Generic, efficient and isochronous Gaussian sampling over the integers
Algorithm | Isochronyb | σ | Memory (KB) | Number of samples (× 106/s) |
---|---|---|---|---|
Convolution Sampler Micciancio and Walter (2017) | Type I | \(3-2^{15}\) | \(O(1)\ (\approx 2^{5.4})\) | 1.53 |
Karney’s Sampler Karney (2016) | \(\times\) | \(1-2^{20}\) | \(O(1)\ (<1)\) | 8.10 |
DWZ Sampler Du et al. (2019) | \(\times\) | \(4-2^{20}\) | \(O(1)\ (<1)\) | 13.97 |
FALCON’s Sampler Howe et al. (2020) | Type I | \(1.29-1.82\) | \(O(\sigma _{\mathrm{max}}) (<1)\) | 7.53 |
COSAC Sampler (AVX2) Zhao et al. (2020a) | Type IIId | \(2-2^{20}\) | \(O(1)\ (<1)\) | 6.81 |
Our work Algorithm 4c | Type I | \(2-2^{20}\) | \(O(1)\ (<1)\) | 7.12 |
Type II | \(2-2^{20}\) | \(O(1) (<1)\) | 13.55 | |
Our work Algorithm 8 (AVX2) | Type IIId | \(2-2^{20}\) | \(O(1) (<1)\) | 11.07 |