一类无限族分圆域极大实子域上的快速乘法及 PLWE-RLWE 等价性
Fast Multiplication and the PLWE-RLWE Equivalence for an Infinite Family of Maximal Real Subfields of Cyclotomic Fields
AI总结:
本文证明 2^r3^s 次分圆域极大全实子域上 PLWE 与 RLWE 等价,并基于快速 DCT 和类 Chebyshev 基给出拟线性整数环乘法,还比较了相关域的攻击脆弱性。
摘要:
我们证明了当 r≥3 且 s≥1 时,2^r3^s 次分圆域的极大全实子域上 Ring Learning With Errors(RLWE,环上带错学习)问题与 Polynomial Learning With Errors(PLWE,多项式带错学习)问题的等价性。此外,我们描述了一种快速算法,用于计算这些子域的整数环中两个元素的乘积。该乘法算法利用快速 Discrete Cosine Transform(DCT,离散余弦变换),在域的维数上具有拟线性复杂度。与通常使用的幂基不同,我们的方法假定两个输入多项式以类 Chebyshev 多项式基给出。为验证这一假定,我们证明从幂基到类 Chebyshev 基的基变换可用 O(n log n) 次算术运算计算,其中 n 是问题维数。最后,针对一组合理的密码学规模参数,我们对 p 次分圆域与 4p 次分圆域的极大全实子扩张在若干攻击下的脆弱性进行了启发式和理论比较。
英文摘要:
We prove the equivalence between the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems for the maximal totally real subfield of the $2^r 3^s$-th cyclotomic field for $r \geq 3$ and $s \geq 1$. Moreover, we describe a fast algorithm for computing the product of two elements in the ring of integers of these subfields. This multiplication algorithm has quasilinear complexity in the dimension of the field, as it makes use of the fast Discrete Cosine Transform (DCT). Our approach assumes that the two input polynomials are given in a basis of Chebyshev-like polynomials, in contrast to the customary power basis. To validate this assumption, we prove that the change of basis from the power basis to the Chebyshev-like basis can be computed with $\mathcal{O}(n \log n)$ arithmetic operations, where $n$ is the problem dimension. Finally, we provide a heuristic and theoretical comparison of the vulnerability to some attacks for the $p$-th cyclotomic field versus the maximal totally real subextension of the $4p$-th cyclotomic field for a reasonable set of parameters of cryptographic size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。