View Single Post
Old 2008-02-19, 04:44   #2
maxal's Avatar
Feb 2005

3758 Posts

time to compute discrete logs modulo prime p is very sensitive to prime factorization of p-1. in particular, it becomes easy if all prime factors of p-1 are small, and hard if p-1 has a large prime factor.

as of algorithms - take a look at
maxal is offline   Reply With Quote