## Cryptology ePrint Archive: Report 2021/048

Efficient Lattice Gadget Decomposition Algorithm with Bounded Uniform Distribution

Sohyun Jeon and Hyang-Sook Lee and Jeongeun Park

Abstract: A gadget decomposition algorithm is commonly used in many advanced lattice cryptography applications which support homomorphic operation over ciphertexts to control the noise growth. For a special structure of a gadget, the algorithm is digit decomposition. If such algorithm samples from a subgaussian distribution, that is, the output is randomized, it gives more benefits on output quality. One of important advantages is Pythagorean additivity which makes resulting noise contained in a ciphertext grow much less than naive digit decomposition. Therefore, the error analysis becomes cleaner and tighter than the use of other measures like $\ell_2$ and $\ell_\infty$. Even though such advantage can also be achieved by the use of discrete Gaussian sampling, it is not preferable for practical performance due to large factor in resulting noise and the complex computation of exponential function, whereas more relaxed probability condition is required for subgaussian distribution. Nevertheless, subgaussian sampling has barely received an attention so far, thus no practical algorithms was implemented before an efficient algorithm is presented by Genis et al., recently.

In this paper, we present a practically efficient gadget decomposition algorithm where output follows a subgaussian distribution. We parallelize the existing practical subgaussian gadget decomposition algorithm, using bounded uniform distribution. Our algorithm is divided into two independent subalgorithms and only one algorithm depends on input. Therefore, the other algorithm can be considered as pre-computation. As an experimental result, our algorithm performs over 50\% better than the existing algorithm.

Category / Keywords: foundations / Subgaussian distribution, Gadget decomposition, Bounded uniform distribution, Lattice gadget

Original Publication (with minor differences): IEEE Access

Date: received 13 Jan 2021, last revised 7 Feb 2021

Contact author: jeonsh099 at ewhain net,jungeun7430@naver com

Available format(s): PDF | BibTeX Citation

Short URL: ia.cr/2021/048

[ Cryptology ePrint archive ]