On Polynomial-Factor Approximations to the Shortest Lattice Vector Length

DOI10.1137/S0895480100379981zbMath1040.11096OpenAlexW2080218862MaRDI QIDQ4443098

D. Sivakumar, Ravi Kumar

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100379981

zbMATH Keywords

shortest lattice vectorSVPlattice algorithms

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ Asymptotically Efficient Lattice-Based Digital Signatures

This page was built for publication: On Polynomial-Factor Approximations to the Shortest Lattice Vector Length