当前位置:
X-MOL 学术
›
Adv. Math. Commun.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Giophantus distinguishing attack is a low dimensional learning with errors problem
Advances in Mathematics of Communications ( IF 0.7 ) Pub Date : 2019-09-11 , DOI: 10.3934/amc.2020030 Jintai Ding , , Joshua Deaton , Kurt Schmidt
Advances in Mathematics of Communications ( IF 0.7 ) Pub Date : 2019-09-11 , DOI: 10.3934/amc.2020030 Jintai Ding , , Joshua Deaton , Kurt Schmidt
In this paper, we attack the recent NIST submission Giophantus, a public key encryption scheme. We find that the complicated structure of Giophantus's ciphertexts leaks information via a correspondence from a low dimensional lattice. This allows us to distinguish encrypted data from random data by the LLL algorithm. This is a more efficient attack than previous proposed attacks.
中文翻译:
Giophantus区分攻击是具有错误问题的低维学习
在本文中,我们攻击了最近NIST提交的Giophantus,这是一种公共密钥加密方案。我们发现Giophantus密文的复杂结构是通过低维格子的对应关系泄漏信息的。这使我们可以通过LLL算法将加密数据与随机数据区分开。与以前提出的攻击相比,这是一种更有效的攻击。
更新日期:2019-09-11
中文翻译:
Giophantus区分攻击是具有错误问题的低维学习
在本文中,我们攻击了最近NIST提交的Giophantus,这是一种公共密钥加密方案。我们发现Giophantus密文的复杂结构是通过低维格子的对应关系泄漏信息的。这使我们可以通过LLL算法将加密数据与随机数据区分开。与以前提出的攻击相比,这是一种更有效的攻击。