scientific article; zbMATH DE number 1852137
From MaRDI portal
Publication:4787200
zbMath1006.11034MaRDI QIDQ4787200
Henrik Koy, Claus Peter Schnorr
Publication date: 9 January 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2146/21460067
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
local coordinatesshortest lattice vectorsegmentsdivide and conquerLLL-reductioniterated segmentslocal LLL-reduction
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)
Related Items (12)
Towards faster polynomial-time lattice reduction ⋮ A relative van Hoeij algorithm over number fields ⋮ Segment LLL reduction of lattice bases using modular arithmetic ⋮ Fast practical lattice reduction through iterated compression ⋮ Explicit Hard Instances of the Shortest Vector Problem ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Factoring polynomials and the knapsack problem ⋮ Fast LLL-type lattice reduction ⋮ Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) ⋮ On the reduction of a random basis ⋮ A Vectorized, Cache Efficient LLL Implementation
This page was built for publication:
