Pages that link to "Item:Q4575576"
From MaRDI portal
The following pages link to New directions in nearest neighbor searching with applications to lattice sieving (Q4575576):
Displayed 50 items.
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Dual lattice attacks for closest vector problems (with preprocessing) (Q826277) (← links)
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- Identifying an unknown code by partial Gaussian elimination (Q1727382) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Index structures for fast similarity search for real-valued vectors. I (Q1745711) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← links)
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
- How to meet ternary LWE keys (Q2128581) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- How to find ternary LWE keys using locality sensitive hashing (Q2149799) (← links)
- Making the BKW algorithm practical for LWE (Q2152043) (← links)
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes (Q2152045) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} (Q2170090) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Fast neighbor search by using revised \(k\)-d tree (Q2200699) (← links)
- The lattice-based digital signature scheme qTESLA (Q2229291) (← links)
- Binary vectors for fast distance and similarity estimation (Q2362826) (← links)
- Estimation of the hardness of the learning with errors problem with a restricted number of samples (Q2415419) (← links)
- Predicting the concrete security of LWE against the dual attack using binary search (Q2673056) (← links)
- Estimating quantum speedups for lattice sieves (Q2692396) (← links)
- Gauss Sieve Algorithm on GPUs (Q2975795) (← links)
- A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$ (Q2988333) (← links)
- Lattice-based locality sensitive hashing is optimal (Q4993309) (← links)
- (Q5034914) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Decryption Failure Is More Likely After Success (Q5041221) (← links)
- Homomorphic Encryption Standard (Q5044564) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- On the Security of OSIDH (Q5087250) (← links)
- (Q5091027) (← links)
- (Q5111221) (← links)
- (Q5115825) (← links)
- Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP) (Q5240427) (← links)
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm (Q5738781) (← links)