Exact lattice sampling from non-Gaussian distributions
type: Item
instance of: scholarly article
title: Exact lattice sampling from non-Gaussian distributions
zbMATH Open document ID: 1479.94243
DOI: 10.1007/978-3-030-75245-3_21
author: Maxime Plançon
author: Thomas Prest
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A20
Mathematics Subject Classification ID: 11H06
zbMATH DE Number: 7450193
zbMATH Keywords: trapdoor sampling
zbMATH Keywords: lattice trapdoors
zbMATH Keywords: squaremonic functions
zbMATH Keywords: regular algorithms
MaRDI profile type: Publication
full work available at URL: 978-3-030-75245-3 21
OpenAlex ID: W3162167817
cites work: Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
cites work: Efficient Lattice (H)IBE in the Standard Model
cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: A probabilistic approach to the geometry of the \(\ell^n_p\)-ball
cites work: Attribute-Based Functional Encryption on Lattices
cites work: Classical hardness of learning with errors
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Approximate trapdoors for lattices and smaller hash-and-sign signatures
cites work: Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
cites work: Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
cites work: Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: Advances in cryptology -- EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 -- June 3, 2010. Proceedings
cites work: Q4952720
cites work: Analysis.
cites work: Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Classical and Multilinear Harmonic Analysis
cites work: An Efficient and Parallel Gaussian Sampler for Lattices
cites work: Sharper bounds in lattice-based cryptography using the Rényi divergence
cites work: Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Q3142876
Recommended article: An Efficient and Parallel Gaussian Sampler for Lattices
Recommended article: Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
Recommended article: Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions
Recommended article: Sampling from non-smooth distributions through Langevin diffusion
Recommended article: Optimal Lattices for Sampling
Recommended article: Q4633813
Recommended article: Building an efficient lattice gadget toolkit: Subgaussian sampling and more
description: scientific article; zbMATH DE number 7450193