Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
From MaRDI portal
Publication:4911599
DOI10.1007/978-3-642-34961-4_26zbMath1292.94058OpenAlexW65891367MaRDI QIDQ4911599
Publication date: 19 March 2013
Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_26
Related Items (11)
Isochronous Gaussian Sampling: From Inception to Implementation ⋮ COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ How to meet ternary LWE keys ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Sampling from discrete Gaussians for lattice-based cryptography on a constrained device ⋮ Exact lattice sampling from non-Gaussian distributions ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats
Uses Software
This page was built for publication: Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
