Is your question the following?

Does there exist a polynomial-time reduction from the problem "Discrete log in GF(p)" to the problem "Discrete log in GF(2^n)" ?

I put the 2^n in there because I know of an *extremely* efficient algorithm to compute discrete logs in GF(2)

Dave