Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
From MaRDI portal
Publication:742507
DOI10.1007/S00200-014-0218-3zbMATH Open1372.94425OpenAlexW2038619601WikidataQ57568003 ScholiaQ57568003MaRDI QIDQ742507FDOQ742507
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Ideal Lattices and Learning with Errors over Rings
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- New Algorithms for Learning in Presence of Errors
- Lattice Signatures without Trapdoors
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Sampling exactly from the normal distribution
- High Precision Discrete Gaussian Sampling on FPGAs
- Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers
- An Efficient and Parallel Gaussian Sampler for Lattices
- 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
- Minimal Three-Variable NOR and NAND Logic Circuits
Cited In (20)
- Isochronous Gaussian Sampling: From Inception to Implementation
- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- A constant-time sampling algorithm for binary Gaussian distribution over the integers
- Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
- An improved exact sampling algorithm for the standard normal distribution
- How to sample a discrete Gaussian (and more) from a random oracle
- Sampling the Riemann-theta Boltzmann machine
- Pursuit and synchronization in hydrodynamic dipoles
- High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers
- Binary decompositions of probability densities and random-bit simulation
- Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
- Gaussian Sampling in Lattice Based Cryptography
- Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures
- A new R-LWE based digital signature scheme
- 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
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
- Sampling exactly from the normal distribution
Uses Software
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)
