Just how hard are rotations of Z n ? Algorithms and cryptography with the simplest lattice
Just how hard are rotations of Z n ? Algorithms and cryptography with the simplest lattice
复制标题
DOI：
--
复制
发表时间：
2021
影响因子：
5.4
通讯作者：
Huck Bennett;Atul Ganju;Pura Peetathawatchai;Noah Stephens-Davidowitz
中科院分区：
文献类型：
--
作者：
Huck Bennett;Atul Ganju;Pura Peetathawatchai;Noah Stephens-Davidowitz
,