IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Regular Section
A New Discrete Gaussian Sampler over Orthogonal Lattices
Dianyan XIAOYang YUJingguo BI
Author information
JOURNALS RESTRICTED ACCESS

2018 Volume E101.A Issue 11 Pages 1880-1887

Details
Abstract

Discrete Gaussian is a cornerstone of many lattice-based cryptographic constructions. Aiming at the orthogonal lattice of a vector, we propose a discrete Gaussian rejection sampling algorithm, by modifying the dynamic programming process for subset sum problems. Within O(nq2) time, our algorithm generates a distribution statistically indistinguishable from discrete Gaussian at width s>ω(log n). Moreover, we apply our sampling algorithm to general high-dimensional dense lattices, and orthogonal lattices of matrices $\matA\in\Z_q^{O(1)\times n}$. Compared with previous polynomial-time discrete Gaussian samplers, our algorithm does not rely on the short basis.

Information related to the author
© 2018 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top