arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.08681cs.ITcs.CRmath.IT
收藏

RLWE信道的信息和编码理论分析

Information- and Coding-Theoretic Analysis of the RLWE Channel

Georg Maringer, Sven Puchinger, Antonia Wachter-Zeh

摘要:

在NIST后量子密码学标准化过程中已经提出了基于\emph{Ring Learning with Errors}(RLWE)问题的几种密码系统,例如,新希望此外,还有像Kyber这样的系统,它们基于密切相关的MLWE假设。前面提到的两种方案都导致非零的解密失败率(DFR)。这些算法的加密和解密的组合可以被解释为在噪声信道上的数据传输。据我们所知,本文是第一个工作,分析了该通道的容量。我们展示了如何修改加密方案,使得相应通道的输入字母增加。特别是,我们提出了他们的能力,这表明,传输速率可以显着增加的下限相比,在文献中的标准建议。此外,在随机独立系数失效的共同假设下,我们给出了基于Gilbert-Varshamov界和使用BCH码的具体码构造的可实现速率的下界。通过我们的构造,我们可以在保证相同DFR的同时增加总比特率(对于Kyber增加$1.84$的因子,对于NewHope增加$7$的因子),或者对于相同的比特率,我们可以显著降低本工作中考虑的所有方案的DFR(例如,对于NewHope,从$2^{-216}$到$2^{-12769}$)。

英文摘要:

Several cryptosystems based on the \emph{Ring Learning with Errors} (RLWE) problem have been proposed within the NIST post-quantum cryptography standardization process, e.g., NewHope. Furthermore, there are systems like Kyber which are based on the closely related MLWE assumption. Both previously mentioned schemes result in a non-zero decryption failure rate (DFR). The combination of encryption and decryption for these kinds of algorithms can be interpreted as data transmission over a noisy channel. To the best of our knowledge this paper is the first work that analyzes the capacity of this channel. We show how to modify the encryption schemes such that the input alphabets of the corresponding channels are increased. In particular, we present lower bounds on their capacities which show that the transmission rate can be significantly increased compared to standard proposals in the literature. Furthermore, under the common assumption of stochastically independent coefficient failures, we give lower bounds on achievable rates based on both the Gilbert-Varshamov bound and concrete code constructions using BCH codes. By means of our constructions, we can either increase the total bitrate (by a factor of $1.84$ for Kyber and by factor of $7$ for NewHope) while guaranteeing the same DFR or for the same bitrate, we can significantly reduce the DFR for all schemes considered in this work (e.g., for NewHope from $2^{-216}$ to $2^{-12769}$).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑