A new parallel lattice reduction algorithm for BKZ reduced bases
From MaRDI portal
Publication:2335926
DOI10.1007/s11432-013-4967-6zbMath1423.68578OpenAlexW2032183969MaRDI QIDQ2335926
Zheng Wang, Xing Fang, Xianghui Liu, Xianghui Xie
Publication date: 18 November 2019
Published in: Science China. Information Sciences (Search for Journal in Brave)
Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-4967-6
parallel algorithmlattice reductionBKZ algorithmmultiprocessor computer architectureGoldstein-type lattices
Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Lattices and convex bodies (number-theoretic aspects) (11H06)
Cites Work
- Factoring polynomials with rational coefficients
- Geometric algorithms and combinatorial optimization.
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Finding a Small Root of a Univariate Modular Equation
- A Tutorial on High Performance Computing Applied to Cryptanalysis
- Block Reduced Lattice Bases and Successive Minima
- On an attack on RSA with small CRT-exponents
- Hermite’s Constant and Lattice Algorithms
- Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
- Algorithmic Number Theory
This page was built for publication: A new parallel lattice reduction algorithm for BKZ reduced bases