Exact lattice sampling from non-Gaussian distributions

DOI10.1007/978-3-030-75245-3_21zbMath1479.94243OpenAlexW3162167817MaRDI QIDQ2061936

Thomas Prest, Maxime Plançon

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75245-3_21

zbMATH Keywords

lattice trapdoorsregular algorithmssquaremonic functionstrapdoor sampling

Mathematics Subject Classification ID

Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06) Sampling theory in information and communication theory (94A20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Advances in cryptology - CRYPTO 2010. 30th annual cryptology conference, Santa Barbara, CA, USA, August 15--19, 2010. Proceedings
• On Lovász' lattice reduction and the nearest lattice point problem
• A probabilistic approach to the geometry of the \(\ell^n_p\)-ball
• Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
• Approximate trapdoors for lattices and smaller hash-and-sign signatures
• Sharper bounds in lattice-based cryptography using the Rényi divergence
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
• Solving the Shortest Vector Problem in 2 ⁿ Time Using Discrete Gaussian Sampling
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• An Efficient and Parallel Gaussian Sampler for Lattices
• Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
• Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
• Classical and Multilinear Harmonic Analysis
• Attribute-Based Functional Encryption on Lattices
• Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
• Classical hardness of learning with errors
• 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: Exact lattice sampling from non-Gaussian distributions