scientific article
From MaRDI portal
Publication:3549646
zbMath1232.68066MaRDI QIDQ3549646
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (16)
Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! ⋮ Revisiting lower dimension lattice attacks on NTRU ⋮ Improving convergence and practicality of slide-type reductions ⋮ Lower bounds of shortest vector lengths in random NTRU lattices ⋮ Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH ⋮ Approximate CVP_p in Time 2^{0.802 n} ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Restricted parameter range promise set cover problems are easy ⋮ LLL: A Tool for Effective Diophantine Approximation ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem ⋮ Sampling methods for shortest vectors, closest vectors and successive minima ⋮ Approximate CVP\(_p\) in time \(2^{0.802n}\) ⋮ Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle ⋮ The Geometry of Lattice Cryptography
This page was built for publication:
