scientific article; zbMATH DE number 5764780

MaRDI QIDQ3579369zbMATH OpenFDO

Authors Daniele Micciancio

Publication date 6 August 2010

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Approximation algorithms (68W25)

Cited in

(13)

• Sampling methods for shortest vectors, closest vectors and successive minima
• On lattice-based algebraic feedback shift registers synthesis for multisequences
• Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors
• The remote set problem on lattices
• Algorithms for the shortest and closest lattice vector problems
• Approximating the closest vector problem using an approximate shortest vector oracle
• The reductions for the approximating covering radius problem
• New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
• Minimization of even conic functions on the two-dimensional integral lattice
• Hardness of bounded distance decoding on lattices in lp norms
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
• On the ability to approximate k-DSP of HKZ, BKZ and slide reduction

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 Q3579369)