The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice
From MaRDI portal
Publication:3581274
DOI10.1145/780542.780602zbMath1192.68336OpenAlexW2078376369MaRDI QIDQ3581274
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780602
Related Items (4)
Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Fast LLL-type lattice reduction ⋮ Hermite’s Constant and Lattice Algorithms ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions
This page was built for publication: The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice
