Isochronous Gaussian Sampling: From Inception to Implementation
From MaRDI portal
Publication:5041213
DOI10.1007/978-3-030-44223-1_4zbMath1501.94044OpenAlexW3023007605MaRDI QIDQ5041213
Thomas Ricosset, Mélissa Rossi, James Howe, Thomas Prest
Publication date: 13 October 2022
Published in: Post-Quantum Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-44223-1_4
Cryptography (94A60) Sampling theory in information and communication theory (94A20) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (6)
\textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Improved power analysis attacks on Falcon ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ Polar coding for ring-LWE-based public key encryption ⋮ How to sample a discrete Gaussian (and more) from a random oracle ⋮ Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
Uses Software
Cites Work
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Advances in cryptology -- EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 -- June 3, 2010. Proceedings
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Gaussian sampling over the integers: efficient, generic, constant-time
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
- One bit is all it takes: a devastating timing attack on BLISS's non-constant time sign flips
- Sampling the integers with low relative error
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Biased nonce sense: lattice attacks against weak ECDSA signatures in cryptocurrencies
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- Sampling Exactly from the Normal Distribution
- Lattice Signatures and Bimodal Gaussians
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Efficient Identity-Based Encryption over NTRU Lattices
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- An Efficient and Parallel Gaussian Sampler for Lattices
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A class of invariant consistent tests for multivariate normality
- Testing multivariate normality
- CDT-based Gaussian Sampling: From Multi to Double Precision
- Von Neumann's Comparison Method for Random Sampling from the Normal and Other Distributions
- Extensions of Forsythe's Method for Random Sampling from the Normal Distribution
- Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- Enhanced Lattice-Based Signatures on Reconfigurable Hardware
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Measures of multivariate skewness and kurtosis with applications
This page was built for publication: Isochronous Gaussian Sampling: From Inception to Implementation
