scientific article; zbMATH DE number 1852143

zbMATH Open1006.11035MaRDI QIDQ4787207FDOQ4787207

Authors: Mårten Trolin 

Publication date: 9 January 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2146/21460194

Title of this publication is not available (Why is that?)

Recommendations

• STACS 2004
• scientific article; zbMATH DE number 1775383
• A relation of primal--dual lattices and the complexity of shortest lattice vector problem
• scientific article; zbMATH DE number 2196508
• On the unique shortest lattice vector problem

zbMATH Keywords

latticesLLL algorithmshortest vector problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quadratic forms (reduction theory, extreme forms, etc.) (11H55) Number-theoretic algorithms; complexity (11Y16)

Cited In (5)

• Explicit Hard Instances of the Shortest Vector Problem
• On the SVP for low-dimensional circulant lattices
• Counting lattice vectors
• Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time
• On the unique shortest lattice vector problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787207)