International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Rounded Gaussians

Authors:
Andreas Hülsing
Tanja Lange
Kit Smeets
Download:
DOI: 10.1007/978-3-319-76581-5_25
Search ePrint
Search Google
Conference: PKC 2018
Abstract: This paper suggests to use rounded Gaussians in place of discrete Gaussians in rejection-sampling-based lattice signature schemes like BLISS or Lyubashevsky’s signature scheme. We show that this distribution can efficiently be sampled from while additionally making it easy to sample in constant time, systematically avoiding recent timing-based side-channel attacks on lattice-based signatures.We show the effectiveness of the new sampler by applying it to BLISS, prove analogues of the security proofs for BLISS, and present an implementation that runs in constant time. Our implementation needs no precomputed tables and is twice as fast as the variable-time CDT sampler posted by the BLISS authors with precomputed tables.
BibTeX
@inproceedings{pkc-2018-28908,
  title={Rounded Gaussians},
  booktitle={Public-Key Cryptography – PKC 2018},
  series={Public-Key Cryptography – PKC 2018},
  publisher={Springer},
  volume={10770},
  pages={728-757},
  doi={10.1007/978-3-319-76581-5_25},
  author={Andreas Hülsing and Tanja Lange and Kit Smeets},
  year=2018
}