用于模乘的机器学习
Machine learning for modular multiplication
AI总结:
本文针对密码学中的模乘任务,评估循环回归与序列到序列 transformer 两种机器学习方法,并以其有限成效佐证模乘相关问题的困难性。
摘要:
受密码学应用启发,我们研究了两种用于模乘的机器学习方法:即循环回归和序列到序列 transformer 模型。我们的结果所展示的两种方法的有限成功,为密码系统所基于的、涉及模乘的任务的困难性提供了证据。
英文摘要:
Motivated by cryptographic applications, we investigate two machine learning approaches to modular multiplication: namely circular regression and a sequence-to-sequence transformer model. The limited success of both methods demonstrated in our results gives evidence for the hardness of tasks involving modular multiplication upon which cryptosystems are based.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。