Preimage sampleable function families without discrete gaussians
From MaRDI portal
Cites work
- A closer look at \textsc{Falcon}
- A probabilistic approach to the geometry of the \(\ell^n_p\)-ball
- Averaging bounds for lattices and linear codes
- Convex and Discrete Geometry
- Exact lattice sampling from non-Gaussian distributions
- FuLeakage: breaking FuLeeca by learning attacks
- Generating hard instances of the short basis problem
- Generating shorter bases for hard random lattices
- Hardness of SIS and LWE with small parameters
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1559589 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- Lectures on the geometry of numbers. Notes by B. Friedman. Rewritten by Komaravolu Chandrasekharan with the assistance of Rudolf Suter
- Leftover hash lemma(s) over cyclotomic rings
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
- On Lovász' lattice reduction and the nearest lattice point problem
- On rejection sampling in Lyubashevsky's signature scheme
- Polytopes in the Fiat-Shamir with aborts paradigm
- Provable dual attacks on learning with errors
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Weighted sums of certain dependent random variables
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Über einfache und mehrfache Bedeckung des \(n\)-dimensionalen Raumes mit einem Würfelgitter.
This page was built for publication: Preimage sampleable function families without discrete gaussians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443314)