Join Log in
Score:1
Per Mertesacker avatar Crypto

Frobenius inner product polynomial rings

cn flag
Per Mertesacker

I'm trying to implement the zero-knowledge proof presented in this paper. The proof has a rejection step (page 14), which can be computed as follows:

Rejection step

Where B and Z are in $R^{m \times n}$ for some ring. Although I understand how it works for the ring $R=\mathbb{Z}$, I don't get the point of how could work when $R=\mathbb{Z}[x]/(x^{n}+1)$. If I am not misunderstanding something, the Frobenius product between two matrices would output an element in the ring, and thus, the previous algorithm could only operate over integers.

What I am missing? Thanks in advance for your help.

85
0 + 0
sis
Score:4
Vadim L. avatar Crypto
us flag
Vadim L.

Like $||B||^2$ is defined in Section 2.1 to be the norm of the vector of the integer coefficients comprising the elements of $B$, $<Z,B>$ is the inner product of these two integer vectors. Basically, flatten Z and B into integer vectors, and take the inner product. Sorry, it should have been defined. And also, in Figure 1, where this rejection sampling step is used, B=SC.

0 + 0
ธงชาติไทย
Elon Musk
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.