Lower bounds on lattice sieving and information set decoding (Q2128585): Difference between revisions

@@ Property / describes a project that uses @@
+FALCONN
@@ Property / describes a project that uses: FALCONN / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+G6K
@@ Property / describes a project that uses: G6K / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+FrodoKEM
@@ Property / describes a project that uses: FrodoKEM / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-84245-1_27
+Normal rank
@@ Property / OpenAlex ID @@
+W3186367696
@@ Property / OpenAlex ID: W3186367696 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526993
@@ Property / cites work: Q4526993 / rank @@
+Normal rank
@@ Property / cites work @@
+The general sieve kernel and new records in lattice reduction
+Normal rank
@@ Property / cites work @@
+Solving the Shortest Vector Problem in 2             <sup>n</sup>             Time Using Discrete Gaussian Sampling
+Normal rank
@@ Property / cites work @@
+Beyond Locality-Sensitive Hashing
@@ Property / cites work: Beyond Locality-Sensitive Hashing / rank @@
+Normal rank
@@ Property / cites work @@
+A sieve algorithm for the shortest lattice vector problem
+Normal rank
@@ Property / cites work @@
+Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors
+Normal rank
@@ Property / cites work @@
+Lower bounds on lattice enumeration with extreme pruning
+Normal rank
@@ Property / cites work @@
+Optimal Data-Dependent Hashing for Approximate Near Neighbors
+Normal rank
@@ Property / cites work @@
+New directions in nearest neighbor searching with applications to lattice sieving
+Normal rank
@@ Property / cites work @@
+Round5: compact and fast post-quantum public-key encryption
+Normal rank
@@ Property / cites work @@
+Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
+Normal rank
@@ Property / cites work @@
+Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
+Normal rank
@@ Property / cites work @@
+Tuple lattice sieving
@@ Property / cites work: Tuple lattice sieving / rank @@
+Normal rank
@@ Property / cites work @@
+Decoding linear codes with high error rate and its impact for LPN security
+Normal rank
@@ Property / cites work @@
+Spherical rearrangements, subharmonic functions, and \(\ast\)-functions in \(n\)-space
+Normal rank
@@ Property / cites work @@
+A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
+Normal rank
@@ Property / cites work @@
+Analysis of Information Set Decoding for a Sub-linear Error Weight
+Normal rank
@@ Property / cites work @@
+Sieve, Enumerate, Slice, and Lift:
@@ Property / cites work: Sieve, Enumerate, Slice, and Lift: / rank @@
+Normal rank
@@ Property / cites work @@
+The randomized slicer for CVPP: sharper, faster, smaller, batchier
+Normal rank
@@ Property / cites work @@
+Shortest vector from lattice sieving: a few dimensions for free
+Normal rank
@@ Property / cites work @@
+Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
+Normal rank
@@ Property / cites work @@
+Fully homomorphic encryption using ideal lattices
@@ Property / cites work: Fully homomorphic encryption using ideal lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Candidate Multilinear Maps from Ideal Lattices
@@ Property / cites work: Candidate Multilinear Maps from Ideal Lattices / rank @@
+Normal rank
@@ Property / cites work @@
+Lattice Enumeration Using Extreme Pruning
@@ Property / cites work: Lattice Enumeration Using Extreme Pruning / rank @@
+Normal rank
@@ Property / cites work @@
+Trapdoors for hard lattices and new cryptographic constructions
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
+Normal rank
@@ Property / cites work @@
+Speed-ups and time-memory trade-offs for tuple lattice sieving
+Normal rank
@@ Property / cites work @@
+Extensions of Lipschitz mappings into a Hilbert space
+Normal rank
@@ Property / cites work @@
+Q4952720
@@ Property / cites work: Q4952720 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving
+Normal rank
@@ Property / cites work @@
+The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ             <sub>1</sub>
+Normal rank
@@ Property / cites work @@
+Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
+Normal rank
@@ Property / cites work @@
+Approximate Voronoi cells for lattices, revisited
@@ Property / cites work: Approximate Voronoi cells for lattices, revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing
+Normal rank
@@ Property / cites work @@
+Finding shortest lattice vectors faster using quantum search
+Normal rank
@@ Property / cites work @@
+On Ideal Lattices and Learning with Errors over Rings
+Normal rank
@@ Property / cites work @@
+Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
+Normal rank
@@ Property / cites work @@
+Lower Bounds on Locality Sensitive Hashing
@@ Property / cites work: Lower Bounds on Locality Sensitive Hashing / rank @@
+Normal rank
@@ Property / cites work @@
+On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
+Normal rank
@@ Property / cites work @@
+Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
+Normal rank
@@ Property / cites work @@
+A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
+Normal rank
@@ Property / cites work @@
+Q5417723
@@ Property / cites work: Q5417723 / rank @@
+Normal rank
@@ Property / cites work @@
+Sieve algorithms for the shortest vector problem are practical
+Normal rank
@@ Property / cites work @@
+Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)
+Normal rank
@@ Property / cites work @@
+Entropy based nearest neighbor search in high dimensions
+Normal rank
@@ Property / cites work @@
+On lattices, learning with errors, random linear codes, and cryptography
+Normal rank
@@ Property / cites work @@
+A method for obtaining digital signatures and public-key cryptosystems
+Normal rank
@@ Property / cites work @@
+Efficient Public Key Encryption Based on Ideal Lattices
+Normal rank
@@ Property / cites work @@
+Q3835408
@@ Property / cites work: Q3835408 / rank @@
+Normal rank
@@ Property / cites work @@
+Spherical LSH for Approximate Nearest Neighbor Search on Unit Hypersphere
+Normal rank