A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829): Difference between revisions

From MaRDI portal
Added link to MaRDI 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-319-15943-0_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W144050527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526993 / 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: BKZ 2.0: Better Lattice Security Estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Enumeration Using Extreme Pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Blockwise Lattice Algorithms Using Dynamical Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to construct Minkowski reduced and Hermite reduced lattice bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829810 / 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: Lattice-based Cryptography / 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: Fast Lattice Point Enumeration with Minimal Overhead / 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: New lattice-based cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank

Latest revision as of 18:54, 10 July 2024

scientific article
Language Label Description Also known as
English
A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors
scientific article

    Statements

    A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references
    lattice-based cryptography
    0 references
    shortest vector problem (SVP)
    0 references
    \(y\)-sparse representation
    0 references
    phase-based enumeration algorithm
    0 references

    Identifiers