Integral matrix Gram root and lattice Gaussian sampling without floats
From MaRDI portal
Publication:2119026
DOI10.1007/978-3-030-45724-2_21zbMath1492.94092OpenAlexW2941530069MaRDI QIDQ2119026
Léo Ducas, Steven D. Galbraith, Yang Yu, Thomas Prest
Publication date: 23 March 2022
Full work available at URL: https://ir.cwi.nl/pub/30031
Related Items (7)
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Gadget-based iNTRU lattice trapdoors ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ Improved power analysis attacks on Falcon ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Gaussian sampling over the integers: efficient, generic, constant-time
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- FHE Circuit Privacy Almost for Free
- Hardness of SIS and LWE with Small Parameters
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Improved Short Lattice Signatures in the Standard Model
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Efficient Identity-Based Encryption over NTRU Lattices
- Simpler Efficient Group Signatures from Lattices
- Fast Fourier Orthogonalization
- Functional Encryption for Inner Product Predicates from Learning with Errors
- 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
- An Efficient and Parallel Gaussian Sampler for Lattices
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Randomized algorithms in number theory
- Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
- Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
- Fully homomorphic encryption using ideal lattices
- Enhanced Lattice-Based Signatures on Reconfigurable Hardware
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Attribute-based encryption for circuits
- Learning strikes again: the case of the DRS signature scheme
This page was built for publication: Integral matrix Gram root and lattice Gaussian sampling without floats
