scientific article

DOI10.4086/toc.2008.v004a002zbMath1213.68325OpenAlexW348047409MaRDI QIDQ3002791

Miklós Ajtai

Publication date: 24 May 2011

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2008.v004a002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

latticeapproximation algorithmshortest vector problemrandom latticegeometry of numbersbasis reductionLLL reductionKorkine-Zolotareff basisSchnorr's algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Geometric probability and stochastic geometry (60D05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Approximation algorithms (68W25) Quadratic forms (reduction theory, extreme forms, etc.) (11H55)

Related Items (3)

Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients ⋮ Sharper bounds on four lattice constants ⋮ The Restricted Isometry Property of Subsampled Fourier Matrices

This page was built for publication: