循环代数的带误差的非交换环学习
Non-Commutative Ring Learning With Errors From Cyclic Algebras
摘要:
错误学习(LWE)问题是现代基于格的密码学的基本支柱,允许人们在充分研究的计算问题的难度上建立密码学。然而,基于LWE的方案往往是不切实际的,因此Ring LWE被引入作为一种“结构化”LWE的形式,通过在精心选择的环上工作来权衡难以量化的安全损失以提高效率。另一个流行的变体,模块LWE,通过在环上实现模块结构来推广这种交换。在这项工作中,我们引入了一个新的变体LWE循环代数(CLWE)复制的环结构LWE环LWE添加循环结构模块LWE。拟议的建设既比模块LWE更有效,又比环LWE更安全,是两个世界中最好的。我们表明,安全减少预期的LWE问题举行,即减少从某些结构化的格子问题的硬度的CLWE问题的决策变体。作为理论上的贡献,我们认为CLWE作为环LWE的第一个变种,支持非交换乘法运算。该环结构与模块LWE相比是有利的,并且自然地允许用于纠错编码的更大的消息空间。
英文摘要:
The Learning with Errors (LWE) problem is the fundamental backbone of modern lattice based cryptography, allowing one to establish cryptography on the hardness of well-studied computational problems. However, schemes based on LWE are often impractical, so Ring LWE was introduced as a form of `structured' LWE, trading off a hard to quantify loss of security for an increase in efficiency by working over a well chosen ring. Another popular variant, Module LWE, generalizes this exchange by implementing a module structure over a ring. In this work, we introduce a novel variant of LWE over cyclic algebras (CLWE) to replicate the addition of the ring structure taking LWE to Ring LWE by adding cyclic structure to Module LWE. The proposed construction is both more efficient than Module LWE and conjecturally more secure than Ring LWE, the best of both worlds. We show that the security reductions expected for an LWE problem hold, namely a reduction from certain structured lattice problems to the hardness of the decision variant of the CLWE problem. As a contribution of theoretic interest, we view CLWE as the first variant of Ring LWE which supports non-commutative multiplication operations. This ring structure compares favorably with Module LWE, and naturally allows a larger message space for error correction coding.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。