Gaussian sampling of lattices for cryptographic applications

DOI10.1007/s11432-013-4843-4zbMath1357.94067OpenAlexW2030090127MaRDI QIDQ893724

Wenzheng Zhang, Fenghe Wang, Hao Lei, Yu Pu 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

zbMATH Keywords

CVPGaussian samplinglattice based public-key cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Uses Software

• NTRUSign

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Lovász' lattice reduction and the nearest lattice point problem
• A Group Signature Scheme from Lattice Assumptions
• Lattice-Based Blind Signatures
• 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
• An Efficient and Parallel Gaussian Sampler for Lattices
• Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
• NTRUSign With a New Perturbation
• Lattice-based linearly homomorphic signature scheme over binary field

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