Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
From MaRDI portal
(Redirected from Publication:742507)
Recommendations
- Gaussian Sampling in Lattice Based Cryptography
- An efficient and parallel Gaussian sampler for lattices
- High precision discrete Gaussian sampling on FPGAs
- Gaussian sampling over the integers: efficient, generic, constant-time
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
Cites work
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 3614066 (Why is no real title available?)
- A toolkit for ring-LWE cryptography
- An efficient and parallel Gaussian sampler for lattices
- An improved compression technique for signatures based on learning with errors
- Better key sizes (and attacks) for LWE-based encryption
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- High precision discrete Gaussian sampling on FPGAs
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- Minimal Three-Variable NOR and NAND Logic Circuits
- NIST handbook of mathematical functions
- New Algorithms for Learning in Presence of Errors
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Sampling exactly from the normal distribution
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(21)- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
- A constant-time sampling algorithm for binary Gaussian distribution over the integers
- Sampling exactly from the normal distribution
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
- Binary decompositions of probability densities and random-bit simulation
- Isochronous Gaussian sampling: from inception to implementation
- An improved exact sampling algorithm for the standard normal distribution
- Analyzing the shuffling side-channel countermeasure for lattice-based signatures
- Pursuit and synchronization in hydrodynamic dipoles
- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
- High precision discrete Gaussian sampling on FPGAs
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
- Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
- How to sample a discrete Gaussian (and more) from a random oracle
- Sampling the Riemann-theta Boltzmann machine
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- A new R-LWE based digital signature scheme
- Gaussian Sampling in Lattice Based Cryptography
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
This page was built for publication: Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742507)
