Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance
Decoding and Trapdoor Sampling
release_hdnegnrhxjd7vdfkbfbc5scsvu
by
Zheng Wang, Cong Ling
2017
Abstract
Sampling from the lattice Gaussian distribution plays an important role in
various research fields. In this paper, the Markov chain Monte Carlo
(MCMC)-based sampling technique is advanced in several fronts. Firstly, the
spectral gap for the independent Metropolis-Hastings-Klein (MHK) algorithm is
derived, which is then extended to Peikert's algorithm and rejection sampling;
we show that independent MHK exhibits faster convergence. Then, the performance
of bounded distance decoding using MCMC is analyzed, revealing a flexible
trade-off between the decoding radius and complexity. MCMC is further applied
to trapdoor sampling, again offering a trade-off between security and
complexity. Finally, the independent multiple-try Metropolis-Klein (MTMK)
algorithm is proposed to enhance the convergence rate. The proposed algorithms
allow parallel implementation, which is beneficial for practical applications.
In text/plain
format
Archived Files and Locations
application/pdf 334.6 kB
file_cymahu6bojel5gwpeipshuooxu
|
arxiv.org (repository) web.archive.org (webarchive) |
1704.02673v1
access all versions, variants, and formats of this works (eg, pre-prints)