Modulo calculation in cryptography (36%) 3. (36%) In this question, you'll do modulo calculation with integers (a) (10%) Elliptic curves in cryptograph are of the form y-x3 + ax + b (mod p), where a and b are integers 0, 1, .., till p-1 Modulo calculation in cryptography (36%) 3. (36%) In this question, you'll do modulo calculation with integers (a) (10%) Elliptic curves in cryptograph are of the form y-x3 + ax + b (mod p), where a and b are integers 0, 1, .., till p-1