基于梯度的方法学习离散对数的难解性
Intractability of Learning the Discrete Logarithm with Gradient-Based Methods
AI总结:
该研究从理论和实证两方面证明,基于梯度的方法受损失函数梯度集中特性限制,难以高效学习素数阶循环群中离散对数的奇偶位,且该限制与网络架构复杂度无关。
摘要:
离散对数问题是数论中的一项基础挑战,对密码协议具有重要意义。本文研究了在素数阶有限循环群中,基于梯度的方法学习离散对数奇偶位的局限性。我们的核心结果得到了理论分析与实证验证的支持,揭示了损失函数的梯度集中在一个不动点周围,且该集中性与所使用的对数底数无关。这种集中特性导致基于梯度的方法高效学习奇偶位的能力受限,且无论所训练网络架构的复杂度如何,该限制都存在。\n我们的证明基于内积空间中的Boas-Bellman不等式,通过特定矩阵的谱范数建立了离散对数奇偶位函数的近似正交性。采用基于神经网络的方法开展的实证实验进一步验证了梯度学习的局限性,实验表明,随着群阶增大,预测奇偶位的成功率会不断下降。
英文摘要:
The discrete logarithm problem is a fundamental challenge in number theory with significant implications for cryptographic protocols. In this paper, we investigate the limitations of gradient-based methods for learning the parity bit of the discrete logarithm in finite cyclic groups of prime order. Our main result, supported by theoretical analysis and empirical verification, reveals the concentration of the gradient of the loss function around a fixed point, independent of the logarithm's base used. This concentration property leads to a restricted ability to learn the parity bit efficiently using gradient-based methods, irrespective of the complexity of the network architecture being trained. Our proof relies on Boas-Bellman inequality in inner product spaces and it involves establishing approximate orthogonality of discrete logarithm's parity bit functions through the spectral norm of certain matrices. Empirical experiments using a neural network-based approach further verify the limitations of gradient-based learning, demonstrating the decreasing success rate in predicting the parity bit as the group order increases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。