(r,q,r,r,r); // 1/r mod q multiply(k,s,tmp0); subtract(tmp0,hash,tmp0); multiply(r,tmp0,x); divide(x,q,q); // mod q hashing(flag, strlen(flag), hash); xgcd(r,q,r,r,r); // inverse the inverse of r xgcd(k,q,k,k,k); // 1/k mod q mad(x,r,hash,q,...
but I remember it being pretty easy to use. I would occasionally multiply my number of questions answered by 1.5 to make sure I was on track to get through every question. For example, after answering question 40, I could check that I was well under one hour into the exam. You can ta...