FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers

DOI10.1109/TC.2019.2940949MaRDI QIDQ5211771zbMATH OpenOpenAlexFDO

Authors Raymond K. Zhao, Ron Steinfeld, Amin Sakzad

Publication date 28 January 2020

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2019.2940949

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(14)

• A constant-time sampling algorithm for binary Gaussian distribution over the integers
• An improved exact sampling algorithm for the standard normal distribution
• \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
• Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
• Isochronous Gaussian sampling: from inception to implementation
• COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
• On the feasibility of single-trace attacks on the Gaussian sampler using a CDT
• A lightweight identification protocol based on lattices
• Polar coding for ring-LWE-based public key encryption
• Efficient lattice-based inner-product functional encryption
• How to sample a discrete Gaussian (and more) from a random oracle
• A Secure Algorithm for Rounded Gaussian Sampling
• NTRU+Sign: compact NTRU-based signatures using bimodal distributions
• Thorough power analysis on Falcon Gaussian samplers and practical countermeasure

Describes a project that uses

Uses Software

• FACCT

This page was built for publication: FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211771)