Entropic hardness of module-LWE from module-NTRU

摘要: The Module Learning With Errors problem () has gained popularity in recent years for its security-efficiency balance,and its hardness has been established for a number of variants. In this paper, we focus on proving the hardness of (search)  for general secret distributions, provided they carry sufficient min-entropy. This is called entropic hardness of . First, we adapt the line of proof of Brakerski and Döttling on  (TCC’20) to prove that the existence of certain distributions implies the entropic hardness of . Then, we provide one such distribution whose required properties rely on the hardness of the decisional Module- problem.