Number Theory If n is constrained to be a prime number p then this forms a galois Field modulo p denoted GF(p and all the normal laws associated with integer arithmetic work Exponentiation in GF(p) many encryption algorithms use exponentiation raising a number a(base) to some power b(exponent) mod p a mod p exponentiation is basically repeated multiplication, which take s O(n)multiplies for a number nNumber Theory • If n is constrained to be a prime number p then this forms a Galois Field modulo p denoted GF(p) and all the normal laws associated with integer arithmetic work • Exponentiation in GF(p) – many encryption algorithms use exponentiation - raising a number a (base) to some power b (exponent) mod p – b = ae mod p – exponentiation is basically repeated multiplication, which take s O(n) multiplies for a number n