Gaussian sampling of lattices for cryptographic applications

DOI10.1007/S11432-013-4843-4zbMATH Open1357.94067OpenAlexW2030090127MaRDI QIDQ893724FDOQ893724

Authors: Hao Lei, Fenghe Wang, Wenzheng Zhang, Yupu Hu 

Publication date: 20 November 2015

Published in: Science China Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-4843-4

Recommendations

• Gaussian Sampling in Lattice Based Cryptography
• An efficient and parallel Gaussian sampler for lattices
• Gaussian sampling over the integers: efficient, generic, constant-time
• Isochronous Gaussian sampling: from inception to implementation
• Discrete Gaussian sampling reduces to CVP and SVP

zbMATH Keywords

CVPGaussian samplinglattice based public-key cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Trapdoors for hard lattices and new cryptographic constructions
• Bonsai trees, or how to delegate a lattice basis
• Efficient lattice (H)IBE in the standard model
• Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
• A Group Signature Scheme from Lattice Assumptions
• Lattice-based blind signatures
• On Lovász' lattice reduction and the nearest lattice point problem
• Title not available (Why is that?)
• An efficient and parallel Gaussian sampler for lattices
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
• NTRUSign With a New Perturbation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lattice-based linearly homomorphic signature scheme over binary field

Cited In (11)

• Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
• On Gaussian sampling, smoothing parameter and application to signatures
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• Discrete Gaussian sampling reduces to CVP and SVP
• Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices
• An efficient and parallel Gaussian sampler for lattices
• Faster Gaussian lattice sampling using lazy floating-point arithmetic
• Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
• Building an efficient lattice gadget toolkit: Subgaussian sampling and more
• Gaussian Sampling in Lattice Based Cryptography
• Simple Lattice Trapdoor Sampling from a Broad Class of Distributions

Uses Software

• NTRUSign

This page was built for publication: Gaussian sampling of lattices for cryptographic applications

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