Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
From MaRDI portal
Publication:742507
DOI10.1007/s00200-014-0218-3zbMath1372.94425OpenAlexW2038619601WikidataQ57568003 ScholiaQ57568003MaRDI QIDQ742507
Steven D. Galbraith, Nagarjun C. Dwarakanath
Publication date: 18 September 2014
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-014-0218-3
Related Items
A constant-time sampling algorithm for binary Gaussian distribution over the integers ⋮ Isochronous Gaussian Sampling: From Inception to Implementation ⋮ An improved exact sampling algorithm for the standard normal distribution ⋮ Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite ⋮ Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures ⋮ Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers ⋮ Sampling the Riemann-theta Boltzmann machine ⋮ How to sample a discrete Gaussian (and more) from a random oracle ⋮ Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Pursuit and synchronization in hydrodynamic dipoles ⋮ Sampling Exactly from the Normal Distribution ⋮ Binary decompositions of probability densities and random-bit simulation ⋮ On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling Exactly from the Normal Distribution
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice Signatures without Trapdoors
- High Precision Discrete Gaussian Sampling on FPGAs
- Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers
- New Algorithms for Learning in Presence of Errors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- 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
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
- A Toolkit for Ring-LWE Cryptography
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Minimal Three-Variable NOR and NAND Logic Circuits
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
