Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
From MaRDI portal
Recommendations
- Gaussian Sampling in Lattice Based Cryptography
- Isochronous Gaussian sampling: from inception to implementation
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
- Gaussian sampling over the integers: efficient, generic, constant-time
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
Cites work
- An efficient and parallel Gaussian sampler for lattices
- Authenticated key exchange from ideal lattices
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- scientific article; zbMATH DE number 3614066 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1024060 (Why is no real title available?)
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- New directions in cryptography
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Post-Quantum Cryptography
- Public-key cryptosystems from the worst-case shortest vector problem
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Strengths and Weaknesses of Quantum Computing
Cited in
(2)
This page was built for publication: Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056039)