ccs130h Homework Assignment 2Implement the Shanks BabyStep-GiantStep and/or Pollard Rho algorithm in Python in order to solve for the Discrete Log Problem
y = g^x mod psuch that p = 2^31+2^30+7 = 3221225479, g = 3 and y = 2 to find x in [2, p-2].
Carefully experiment with your program to find approximate time it would take, before actually running it to find x. I can assure you it will take longer than just going to the Pizza store and coming back!
Email me your program, and the approximate time it took to find it, the platform (computer) you have run the code, and of course, x.
This assignment is due 11pm, Sunday, December 7.