Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
From MaRDI portal
Publication:2289445
DOI10.1007/978-3-030-17259-6_18OpenAlexW2935641643MaRDI QIDQ2289445FDOQ2289445
Tobias Oder, Tim Güneysu, Tobias M. Schneider, Clara Paglialonga
Publication date: 28 January 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17259-6_18
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 (10)
- Efficiently masking polynomial inversion at arbitrary order
- A lightweight implementation of Saber resistant against side-channel attacks
- Effective and efficient masking with low noise using small-Mersenne-prime ciphers
- One-hot conversion: towards faster table-based A2B conversion
- On the feasibility of single-trace attacks on the Gaussian sampler using a CDT
- Higher-order masked Saber
- Masking the GLP lattice-based signature scheme at any order
- A lightweight identification protocol based on lattices
- Formal verification of arithmetic masking in hardware and software
- Single trace analysis of comparison operation based constant-time CDT sampling and its countermeasure
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)
