The following pages link to (Q5465355):
Displayed 13 items.
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Lattice Point Enumeration on Block Reduced Bases (Q2947536) (← links)
- The Geometry of Lattice Cryptography (Q3092183) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Asymptotically Efficient Lattice-Based Digital Signatures (Q5445497) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)