Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
From MaRDI portal
Publication:5086199
DOI10.1007/978-3-319-61204-1_1OpenAlexW2709659740MaRDI QIDQ5086199
Carlos Aguilar-Melchor, Thomas Ricosset, Martin R. Albrecht
Publication date: 1 July 2022
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://oatao.univ-toulouse.fr/22271/1/Aguilar_Melchor_22271.pdf
Related Items
COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ How to sample a discrete Gaussian (and more) from a random oracle
Uses Software
Cites Work
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- On Lovász' lattice reduction and the nearest lattice point problem
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Implementing Candidate Graded Encoding Schemes from Ideal Lattices
- A Decade of Lattice Cryptography
- Sampling Exactly from the Normal Distribution
- Lattice Signatures and Bimodal Gaussians
- Lattice Signatures without Trapdoors
- Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers
- MPFR
- Trapdoors for hard lattices and new cryptographic constructions
- On Ideal Lattices and Learning with Errors over Rings
- An Efficient and Parallel Gaussian Sampler for Lattices
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A Fast, Easily Implemented Method for Sampling from Decreasing or Symmetric Unimodal Density Functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Asymptotically Efficient Lattice-Based Digital Signatures
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography
