Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3037078523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimate all the {LWE, NTRU} schemes! / 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: Estimating quantum speedups for lattice sieves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting the expected cost of solving uSVP and applications to LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slide reduction, revisited -- filling the gaps in SVP approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lattice enumeration and tweaking discrete pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the concrete hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / 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: Measuring, simulating and exploiting the head concavity phenomenon in BKZ / 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: Shortest vector from lattice sieving: a few dimensions for free / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting Lattice Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Enumeration Using Extreme Pruning / 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: Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progressive lattice sieving / 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: Practical, Predictable Lattice Basis Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LLL algorithm. Survey and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418644 / 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: Second order statistical behavior of LLL and BKZ / rank
 
Normal rank

Latest revision as of 19:35, 30 July 2024

scientific article
Language Label Description Also known as
English
Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
scientific article

    Statements

    Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2022
    0 references
    0 references
    lattice reduction algorithm
    0 references
    enumeration-based algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references