Score:2

What is the exact assumption behind OW-CPA of NTRU?

jp flag

As shown in this paper the IND-CPA of NTRU is based on both the decision key cracking problem and the decision ciphertext cracking problem. However, I often see claims (such as in this paper) that the OW-CPA of NTRU only relies on decision key cracking problem. I don't see a way to prove this.

Suppose that in the OW-CPA game we replace the key generation step with uniform sampling, it is not apparent to me that the game cannot be won with non-negligible probability. In that case I do not see a way to build a distinguisher to break decision key cracking problem. So what is the exact assumption on which OW-CPA of NTRU is based?

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.