The following pages link to (Q4952720):
Displaying 28 items.
- Gaussian sampling of lattices for cryptographic applications (Q893724) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Exact lattice sampling from non-Gaussian distributions (Q2061936) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography (Q5086199) (← links)
- Kissing Numbers and Transference Theorems from Generalized Tail Bounds (Q5232155) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Predicting Lattice Reduction (Q5458584) (← links)
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm (Q5738781) (← links)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE (Q5738886) (← links)
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians (Q6595915) (← links)
- Provable dual attacks on learning with errors (Q6637724) (← links)
