New transference theorems on lattices possessing n^-unique shortest vectors
From MaRDI portal
Publication:393183
DOI10.1016/J.DISC.2013.10.020zbMATH Open1281.11068OpenAlexW2003397294MaRDI QIDQ393183FDOQ393183
Authors: Chengliang Tian, Xiao-Yun Wang, Wei Wei 
Publication date: 16 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.10.020
Recommendations
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- A New Transference Theorem in the Geometry of Numbers
- Measure inequalities and the transference theorem in the geometry of numbers
- New bounds in some transference theorems in the geometry of numbers
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Mean value and transfer theorems (11H60)
Cites Work
- Title not available (Why is that?)
- On lattices, learning with errors, random linear codes, and cryptography
- Integer Programming with a Fixed Number of Variables
- A Remark on Stirling's Formula
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- New bounds in some transference theorems in the geometry of numbers
- An Introduction to the Geometry of Numbers
- Title not available (Why is that?)
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- Title not available (Why is that?)
- On the complexity of computing short linearly independent vectors and short bases in a lattice
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- Lattice problems in NP ∩ coNP
- Improved cryptographic hash functions with worst-case/average-case connection
- Title not available (Why is that?)
- A Digital Signature Scheme Based on CVP ∞
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- The complexity of the covering radius problem
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
Cited In (6)
- A New Transference Theorem in the Geometry of Numbers
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- Discrete Gaussian measures and new bounds of the smoothing parameter for lattices
- On the smoothing parameter and last minimum of random orthogonal lattices
- Measure inequalities and the transference theorem in the geometry of numbers
- Mixing time and eigenvalues of the abelian sandpile Markov chain
Uses Software
This page was built for publication: New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393183)
