New transference theorems on lattices possessing n^-unique shortest vectors

DOI10.1016/J.DISC.2013.10.020MaRDI QIDQ393183zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

smoothing parameterGaussian measuresreductiontransference theorem

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Mean value and transfer theorems (11H60)

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

Cites work

• scientific article; zbMATH DE number 1670828 (Why is no real title available?)
• scientific article; zbMATH DE number 5764780 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 3456979 (Why is no real title available?)
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• A Digital Signature Scheme Based on CVP  ∞
• A Remark on Stirling's Formula
• A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
• An Introduction to the Geometry of Numbers
• Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
• Improved cryptographic hash functions with worst-case/average-case connection
• 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
• Integer Programming with a Fixed Number of Variables
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
• Lattice problems in NP ∩ coNP
• Limits on the hardness of lattice problems in \(\ell_{p}\) norms
• New bounds in some transference theorems in the geometry of numbers
• On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
• On lattices, learning with errors, random linear codes, and cryptography
• On the complexity of computing short linearly independent vectors and short bases in a lattice
• The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
• The complexity of the covering radius problem
• Trapdoors for hard lattices and new cryptographic constructions
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(6)

• 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
• 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

Describes a project that uses

Uses Software

• NTRU

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)