Cryptology ePrint Archive: Report 2018/265

Compact, Scalable, and Efficient Discrete Gaussian Samplers for Lattice-Based Cryptography

Ayesha Khalid and James Howe and Ciara Rafferty and Francesco Regazzoni and Maire O’Neill

Abstract: Lattice-based cryptography, one of the leading candidates for post-quantum security, relies heavily on discrete Gaussian samplers to provide necessary uncertainty, obfuscating computations on secret information. For reconfigurable hardware, the cumulative distribution table (CDT) scheme has previously been shown to achieve the highest throughput and the smallest resource utilisation, easily outperforming other existing samplers. However, the CDT sampler does not scale well. In fact, for large parameters, the lookup tables required are far too large to be practically implemented. This research proposes a hierarchy of multiple smaller samplers, extending the Gaussian convolution lemma to compute optimal parameters, where the individual samplers require much smaller lookup tables. A large range of parameter sets, covering encryption, signatures, and key exchange are evaluated. Hardware-optimised parameters are formulated and a practical implementation on Xilinx Artix- 7 FPGA device is realised. The proposed sampling designs demonstrate promising performance on reconfigurable hardware, even for large parameters, that were otherwise thought infeasible.

Category / Keywords: public-key cryptography / lattice-based cryptography, post-quantum cryptography, Gaussian samplers, hardware security, FPGA.

Original Publication (in the same form): IEEE ISCAS 2018

Date: received 12 Mar 2018

Contact author: james howe at bristol ac uk

Available format(s): PDF | BibTeX Citation

Version: 20180313:180117 (All versions of this report)

Short URL: ia.cr/2018/265


[ Cryptology ePrint archive ]