Analyzing pump and jump BKZ algorithm using dynamical systems

DOI10.1007/978-3-031-62743-9_14MaRDI QIDQ7034562zbMATH OpenFDO

Authors Leizhang Wang

Publication date 31 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-62743-9_14

zbMATH Keywords

dynamical systemslattice reductionpnj-BKZ

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• Advanced lattice sieving on GPUs, with tensor cores
• BKZ 2.0: Better lattice security estimates
• Factoring polynomials with rational coefficients
• Faster exponential time algorithms for the shortest vector problem
• Finding short lattice vectors within Mordell's inequality
• scientific article; zbMATH DE number 1346524 (Why is no real title available?)
• Improved algorithms for the approximate k-List problem in Euclidean norm
• Improved progressive BKZ algorithms and their precise cost estimation by sharp simulator
• Improving convergence and practicality of slide-type reductions
• Lattice enumeration using extreme pruning
• New directions in nearest neighbor searching with applications to lattice sieving
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Practical, Predictable Lattice Basis Reduction
• Progressive lattice sieving
• Shortest vector from lattice sieving: a few dimensions for free
• Sieve algorithms for the shortest vector problem are practical
• Speed-ups and time-memory trade-offs for tuple lattice sieving
• The general sieve kernel and new records in lattice reduction

This page was built for publication: Analyzing pump and jump BKZ algorithm using dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034562)