The number p = 220375 + 1 = 11466178561 is prime. Estimate an upper bound

for the number of steps to find the discrete logarithm base 2 of N=10321349344

modulo p by brute force and by baby step/giant step. Given the information that (2(p1)/220 )740634 N (p1)/220 (mod p) , (2(p1)/37 )704 N (p1)/37 (mod p), and

(2(p1)/5)2 N(p1)/5 (mod p), explain a way to determine log2(N) in dramatically fewer steps than the previous two methods. Find the discrete logarithm base 2 of N.

4. The number p = 220375 + 1 = 11466178561 is prime. Estimate an upper bound for the number of steps to find the discrete logarithm base 2 of N=10321349344 modulo p by brute force and by baby step/giant step. Given the information that (2(p-1)/220) 740634 = N(p-1)/220 (mod p), (2(p-1)/3)704 = N(p-1)/37 (mod p), and (2(p-1)/5)2 = N(p-1)/5 (mod p), explain a way to determine log2(N) in dramatically fewer steps than the previous two methods. Find the discrete logarithm base 2 of N