[Resource Topic] 2022/1490: Efficient Gaussian sampling for RLWE-based cryptography through a fast Fourier transform

Welcome to the resource topic for 2022/1490

Title:
Efficient Gaussian sampling for RLWE-based cryptography through a fast Fourier transform

Authors: Marcio Barbado Junior

Abstract:

Quantum computing threatens classical cryptography, leading to the search for stronger alternatives. The cryptographic approach based on lattices is considered as a viable option. Schemes with that approach use Gaussian sampling, a design which brings along two concerns: efficiency and information leakage. This work addresses those concerns in the RLWE formulation, for digital signatures. Efficiency mitigation uses the central limit theorem, and the Walsh–Hadamard transform, whereas the information leakage risk is reduced via isochronous implementation. Up to ( 2^{23} ) samples are queried, and the results are compared against those of a cumulative distribution table sampler. Statistical metrics show the suitability of the presented sampler in a number of contexts.

ePrint: https://eprint.iacr.org/2022/1490

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .