Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
DOI10.1007/s10623-022-01164-7OpenAlexW4315871726MaRDI QIDQ2701491
Publication date: 28 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01164-7
Kullback-Leibler divergenceinteger latticepolar codesRényi divergenceBernoulli samplingdiscrete Gaussian samplingconstant-time
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Sampling theory in information and communication theory (94A20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Gaussian sampling over the integers: efficient, generic, constant-time
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Hardness of SIS and LWE with Small Parameters
- Lattice Signatures and Bimodal Gaussians
- List Decoding of Polar Codes
- A Note on the Generation of Random Normal Deviates
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Constant-Time Discrete Gaussian Sampling
- On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography
- A Semi-Parallel Successive-Cancellation Decoder for Polar Codes
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Log-Logarithmic Time Pruned Polar Coding
- Isochronous Gaussian Sampling: From Inception to Implementation
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- Enhanced Lattice-Based Signatures on Reconfigurable Hardware
- Polar Coding Without Alphabet Extension for Asymmetric Models
- How to Construct Polar Codes
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
