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

带有噪声的学习异或的量子方法

Quantum approaches to learning parity with noise

Daniel Shiu

AI总结:

本文探讨了利用量子方法解决带有噪声的学习异或问题,通过构造接近Simon承诺的函数生成新样本,以逐步减少问题规模。

摘要:

学习异或与噪声(LPN)问题是一个已确立的计算挑战,其难度对几种后量子密码原语(如HQC和Classic McEliece)的安全性至关重要。经典方法中,已知的最佳攻击涉及信息集解码方法,其复杂度对于感兴趣的参数化来说是指数级的。在本文中,我们探讨量子方法是否能提供替代方法。这一研究思路受到Regev将某些格问题与隐藏二面体子群问题相关联的启发。我们利用二元域的邻域来产生一个接近满足Simon承诺的函数,其差异等于秘密异或向量。尽管不太可能直接恢复秘密异或向量,但运行Simon算法本质上会产生新的LPN样本。这带来了希望,即我们可能能够生成足够的新样本以忽略一个或多个变量并逐步减少问题。我们不声称这些方法必然能与现有方法竞争,只是认为它们值得更深入的研究。

英文摘要:

The learning parity with noise (LPN) problem is a well-established computational challenge whose difficulty is critical to the security of several post-quantum cryptographic primitives such as HQC and Classic McEliece. Classically, the best-known attacks involve information set decoding methods which are exponential in complexity for parameterisations of interest. In this paper we investigate whether quantum methods might offer alternative approaches. The line of inquiry is inspired by Regev's relating of certain lattice problems to the hidden dihedral subgroup problem. We use neighbourhoods of binary fields to produce a function close to fulfilling Simon's promise with difference equal to the secret parity vector. Although unlikely to recover the secret parity vector directly, running Simon's algorithm essentially produces new LPN samples. This gives the hope that we might be able to produce enough new samples to ignore one or more variables and iteratively reduce the problem. We make no claim that these methods will necessarily be competitive with existing approaches, merely that they warrant deeper investigation.

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

↑