The following pages link to (Q5465355):
Displaying 24 items.
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- A note on the minimal volume of almost cubic parallelepipeds (Q1864132) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- The remote set problem on lattices (Q2353188) (← links)
- On the probability of generating a lattice (Q2437315) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- Counting lattice vectors (Q2643017) (← 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)
- (Q3570242) (← links)
- (Q3972530) (← 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)
- Trace-based cryptanalysis of cyclotomic \(R_{q, 0} \times R_q\)-PLWE for the non-split case (Q6594641) (← links)
- On the LWE cryptosystem with more general disturbance (Q6608568) (← links)
- Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work (Q6652963) (← links)
