In class we discussed the method of index calculus for solving Discrete Log Problem. The idea was to

In class we discussed the method of index calculus for solving Discrete Log Problem. The idea was to compute discrete logs (where basis corresponds to the group generator g) of some small prime base B. Thus to solve X = g x for a given X we would compute logg b for all b ? B. a) Given a prime number 83 check efficiently whether 2 is a generator of Z * 83 = {1, 2, . . . , 82}. Use the fact that 28 = 7 (mod 83). Apply square and multiply method and show your computations !