通过自定义数据分布和损失正则化简化难题:模运算案例研究
Making Hard Problems Easier with Custom Data Distributions and Loss Regularization: A Case Study in Modular Arithmetic
AI总结:
针对ML攻击在复杂LWE场景扩展难的问题,本文开发自定义数据分布和损失函数技术提升模型模运算性能,使模型能处理N=128元素模q≤974269求和,应用于LWE可恢复2倍难的秘密,还改善其他任务性能。
摘要:
近期研究表明,基于机器学习(ML)的环学习同态加密(Learning with Errors,LWE)攻击在特定场景下优于经典代数攻击,而LWE是后量子密码学中的难题。尽管前景良好,但ML攻击难以扩展到更复杂的LWE场景。此前研究将该问题与训练ML模型执行模运算的难度相关联,模运算是LWE问题的核心特征。为解决这一问题,我们开发了显著提升ML模型在模运算任务上性能的技术,使模型能够对N=128个元素进行模q≤974269的求和。我们的核心创新是使用自定义训练数据分布和精心设计的损失函数,以更好地表示问题结构。我们将技术的初步概念验证应用于LWE,发现其能恢复比先前研究难2倍的秘密。我们的技术还有助于ML模型更好地学习其他研究充分的问题,包括复制、关联回忆和奇偶校验,为进一步研究提供了动力。
英文摘要:
Recent work showed that ML-based attacks on Learning with Errors (LWE), a hard problem used in post-quantum cryptography, outperform classical algebraic attacks in certain settings. Although promising, ML attacks struggle to scale to more complex LWE settings. Prior work connected this issue to the difficulty of training ML models to do modular arithmetic, a core feature of the LWE problem. To address this, we develop techniques that significantly boost the performance of ML models on modular arithmetic tasks, enabling the models to sum up to $N=128$ elements modulo $q \le 974269$. Our core innovation is the use of custom training data distributions and a carefully designed loss function that better represents the problem structure. We apply an initial proof of concept of our techniques to LWE specifically and find that they allow recovery of 2x harder secrets than prior work. Our techniques also help ML models learn other well-studied problems better, including copy, associative recall, and parity, motivating further study.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。