Integral matrix Gram root and lattice Gaussian sampling without floats
From MaRDI portal
Recommendations
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Gaussian sampling over the integers: efficient, generic, constant-time
- Gaussian Sampling in Lattice Based Cryptography
- An efficient and parallel Gaussian sampler for lattices
- Arbitrary-centered discrete Gaussian sampling over the integers
Cites work
- An efficient and parallel Gaussian sampler for lattices
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Attribute-based encryption for circuits
- Bonsai trees, or how to delegate a lattice basis
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient identity-based encryption over NTRU lattices
- Efficient lattice (H)IBE in the standard model
- Enhanced lattice-based signatures on reconfigurable hardware
- Fast Fourier orthogonalization
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- FHE circuit privacy almost for free
- Fully homomorphic encryption using ideal lattices
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional encryption for inner product predicates from learning with errors
- Gaussian sampling over the integers: efficient, generic, constant-time
- Hardness of SIS and LWE with small parameters
- scientific article; zbMATH DE number 3781253 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Improved short lattice signatures in the standard model
- Lattice-based group signature scheme with verifier-local revocation
- Lattice-based group signatures with logarithmic signature size
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- Learning strikes again: the case of the DRS signature scheme
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Randomized algorithms in number theory
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Simpler efficient group signatures from lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(15)- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- Gadget-based iNTRU lattice trapdoors
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
- Towards a simpler lattice gadget toolkit
- Improved power analysis attacks on Falcon
- Compact lattice gadget and its applications to hash-and-sign signatures
- Fast Fourier Orthogonalization over NTRU Lattices
- Spherical Gaussian leftover hash lemma via the Rényi divergence
- Towards compact identity-based encryption on ideal lattices
- Do not disturb a sleeping Falcon. Floating-point error sensitivity of the Falcon sampler and its consequences
- GPV preimage sampling with weak smoothness and its applications to lattice signatures
- Hardness of M-LWE with general distributions and applications to leaky variants
This page was built for publication: Integral matrix Gram root and lattice Gaussian sampling without floats
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2119026)
