Gadget-based iNTRU lattice trapdoors

Related Items (1)

On the (M)iNTRU assumption in the integer case

Cites Work

Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
Gaussian sampling over the integers: efficient, generic, constant-time
NTRU prime: reducing attack surface at low cost
Integral matrix Gram root and lattice Gaussian sampling without floats
Homomorphic encryption for finite automata
Approximate trapdoors for lattices and smaller hash-and-sign signatures
Sharper bounds in lattice-based cryptography using the Rényi divergence
A Decade of Lattice Cryptography
A Subfield Lattice Attack on Overstretched NTRU Assumptions
Improved Short Lattice Signatures in the Standard Model
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Efficient Identity-Based Encryption over NTRU Lattices
Leveled Fully Homomorphic Signatures from Standard Lattices
Fast Fourier Orthogonalization
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
Trapdoors for hard lattices and new cryptographic constructions
On Ideal Lattices and Learning with Errors over Rings
An Efficient and Parallel Gaussian Sampler for Lattices
Generalized Compact Knapsacks Are Collision Resistant
New directions in nearest neighbor searching with applications to lattice sieving
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
Fully homomorphic encryption using ideal lattices
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Revisiting Lattice Attacks on Overstretched NTRU Parameters
Theory of Cryptography
On lattices, learning with errors, random linear codes, and cryptography
Unnamed Item
Unnamed Item

This page was built for publication: Gadget-based iNTRU lattice trapdoors