Unformatted text preview: exactly the template given in class. Work modulo q = 11, and assume that in the ﬁrst iteration the veriﬁer chooses “random value” 1, then “random value” 2, ..., etc. (This is only to make it easier for the TA to grade — in a real execution of the protocol, the veriﬁer would of course need to choose the random values at random, and we would have to take q larger than 11.) 1...
View Full Document
- Fall '08
- Computational complexity theory, Professor Jonathan Katz