Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto

DOI10.1007/978-3-030-17259-6_18OpenAlexW2935641643MaRDI QIDQ2289445

Tobias Oder, Tim Güneysu, Tobias Schneider, Clara Paglialonga

Publication date: 28 January 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17259-6_18

zbMATH Keywords

lattice-based cryptographylearning with errorsbinomial sampler

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

One-hot conversion: towards faster table-based A2B conversion ⋮ On the feasibility of single-trace attacks on the Gaussian sampler using a CDT ⋮ A lightweight identification protocol based on lattices ⋮ Higher-order masked Saber ⋮ A lightweight implementation of Saber resistant against side-channel attacks ⋮ Efficiently masking polynomial inversion at arbitrary order ⋮ 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