New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
From MaRDI portal
Publication:393183
DOI10.1016/j.disc.2013.10.020zbMath1281.11068OpenAlexW2003397294MaRDI QIDQ393183
Chengliang Tian, Wei Wei, Xiao-Yun Wang
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
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Mean value and transfer theorems (11H60)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- New bounds in some transference theorems in the geometry of numbers
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- On the complexity of computing short linearly independent vectors and short bases in a lattice
- Integer Programming with a Fixed Number of Variables
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- A Remark on Stirling's Formula
- An Introduction to the Geometry of Numbers
- Lattice problems in NP ∩ coNP
- Trapdoors for hard lattices and new cryptographic constructions
- Improved cryptographic hash functions with worst-case/average-case connection
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- A Digital Signature Scheme Based on CVP ∞
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- On lattices, learning with errors, random linear codes, and cryptography
