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

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

Marcio Barbado Junior

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 …

cryptography eprint report fast