关于Banaszczyk不等式的一则注记
A Note on Banaszczyk's Inequality
AI总结:
本文改进了Banaszczyk不等式,通过引入适当条件获得更优的界,用于研究LWE问题的双攻击。
摘要:
Banaszczyk的不等式建立了在$\mathbb{R}^n$中离散高斯测度的尾估计。这一经典结果对基于格的密码学有重要影响。Tian, Liu和Xu给出了不等式的改进版本,并提供了透明的证明。本文进一步改进该不等式,通过引入适当条件,获得显著更优的界。此改进的不等式可用于研究LWE问题的双攻击。
英文摘要:
Banaszczyk's inequality establishes a tail estimate for the discrete Gaussian measure on a lattice in $\mathbb{R}^n$. This classic result has been influential and plays an important role in lattice-based cryptography. An improvement of the inequality with a transparent proof was given by Tian, Liu and Xu. In this note, we further improve this inequality by imposing an appropriate condition, obtaining a significantly better bound. This refined inequality can be used to investigate dual attacks against the Learning With Errors (LWE) problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。