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

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

Latest revision as of 18:37, 28 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds on lattice sieving and information set decoding
scientific article

    Statements

    Lower bounds on lattice sieving and information set decoding (English)
    0 references
    0 references
    0 references
    22 April 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    conditional lower bounds on decoding attacks
    0 references
    cryptanalytic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references