首页 | 官方网站   微博 | 高级检索  
     


On the hardness of NTRU problems
Authors:Yang WANG  Mingqiang WANG
Affiliation:1. School of Mathematics, Shandong University, Jinan 250100, China2. Key Laboratory of Cryptologic Technology and Information Security, Shandong University, Jinan 250100, China
Abstract:
Keywords:lattice-based cryptography  algebraic nmber fields  NTRU Problems  Ring-LWE  computational complexity  
点击此处可从《Frontiers of Computer Science》浏览原始摘要信息
点击此处可从《Frontiers of Computer Science》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号