Pseudorandomness of Ring-LWE for Any Ring and Modulus.

IACR Cryptology ePrint Archive(2017)

引用 256|浏览230
暂无评分
摘要
We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to decision (Ring-)LWE. This extends to decision all the worst-case hardness results that were previously known for the search version, for the same or even better parameters and with no algebraic restrictions on the modulus or number field. Indeed, our reduction is the first that works for decision Ring-LWE with any number field and any modulus.
更多
查看译文
关键词
Learning with Errors,lattices
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要