Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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-662-47989-6_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1447686308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post-Quantum Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219187 / 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: Parallel Gauss Sieve Algorithm: Solving the SVP Challenge over a 128-Dimensional Ideal Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Key Sizes (and Attacks) for LWE-Based Encryption / 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: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating Key Sizes for High Dimensional Lattice-Based Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieving for Shortest Vectors in Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Three-Level Sieve Algorithm for the Shortest Vector Problem / rank
 
Normal rank

Latest revision as of 04:20, 11 July 2024

scientific article
Language Label Description Also known as
English
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
scientific article

    Statements

    Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (English)
    0 references
    0 references
    10 December 2015
    0 references
    lattices
    0 references
    shortest vector problem (SVP)
    0 references
    sieving algorithms
    0 references
    approximate nearest neighbor problem
    0 references
    locality-sensitive hashing (LSH)
    0 references

    Identifiers