Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
From MaRDI portal
Publication:2289445
Recommendations
- On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Gaussian sampling of lattices for cryptographic applications
- Succinct LWE sampling, random polynomials, and obfuscation
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Gaussian Sampling in Lattice Based Cryptography
- Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
- Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
Cited in
(11)- Efficiently masking polynomial inversion at arbitrary order
- Higher-order masked Saber
- Single trace analysis of comparison operation based constant-time CDT sampling and its countermeasure
- A lightweight implementation of Saber resistant against side-channel attacks
- A lightweight identification protocol based on lattices
- Masking the GLP lattice-based signature scheme at any order
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- One-hot conversion: towards faster table-based A2B conversion
- Formal verification of arithmetic masking in hardware and software
- On the feasibility of single-trace attacks on the Gaussian sampler using a CDT
- Masking the GLP lattice-based signature scheme at any order
This page was built for publication: Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289445)
