Discrete Gaussian sampling in lattice cryptography is vulnerable to power analysis attacks. Existing masked samplers are slow and rely on costly comparison tree

Discrete Gaussian sampling in lattice cryptography is vulnerable to power analysis attacks. Existing masked samplers are slow and rely on costly comparison trees. This paper introduces a rejection-based sampler using bitslicing that is 4–20x faster. #sca [📷](https://pbs.…