Score:0

What class of complexity theory does a trapdoor function belong to

cn flag

Let's suppose we have a protocol X (symmetric or assymetric codec) and it encrypts a message M and the only way to get decode M is to use the hidden information and impossible otherwise to crack. To what class of complexity theory does such a protocol belong?

meshcollider avatar
gb flag
If you can verify the trapdoor is correct in polynomial time, then it would belong to NP
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.