I have some trouble understanding the linearization of the degree 2t polynomial generated by multiplication in BGW. It would be great if someone could decode this linearization in simple terms from a 2t degree polynomial to a t degree polynomial.
I've understood that in multiplication, we calculate r(x) = p(x)q(x) but this means that r(x) is a polynomial of degree 2t. How is this polynomial distributed linearly in the circuit?
Addition in BGW is easy to understand but multiplication has been difficult to comprehend.
Reference: https://www.csa.iisc.ac.in/~arpita/SecureComputation15/Lecture18.pdf
2tdegree polynomial becomestdegree in the end and how the linear case works. I know how Shamir's scheme works but I'm still finding it hard to comprehend this. – rakshit naidu Apr 27 '20 at 07:34Playing around with those functions may help you understand more concretely that these things work (for example, there is explicit code implementing the creation of the Vandermonde matrix, and the code responsible for the
– Mark Schultz-Wu Apr 27 '20 at 08:382tdegree polynomial becomingtdegree is theprojmatrix in thetrunc_matrixfunction).@mean ? My guess is*but I just want to be sure :) – rakshit naidu Apr 27 '20 at 09:09