Score:1

Hardness of a modified version of NTRU

sz flag

Let the modified NTRU be $h=f/g$ such that $f$ is not necessarily a short polynomial, is the NTRU problem still hard in this case?

Score:2
ru flag

Finding an answer is not hard, but answers will not be unique. Given $h$, pick your favourite short polynomial $g$ then compute $f=gh$ using multiplication mod $X^n-1$. As $f$ is unconstrained the resulting answer is a legitimate solution.

Don Freecs avatar
sz flag
Thanks dear professor
Don Freecs avatar
sz flag
I don't know if I need to open another question or keep discussing here, another question how about distinguishing from uniform?
Daniel S avatar
ru flag
@DonFreecs I think the answers will be pretty uniform as well; fixing invertible $g$ and letting $h$ run over all possible values will give all values of $f$ and vice-versa.
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.