Dear Dr Silverman,
Perhaps this is a stupid question, but the question is:
Is it possible to convert modular arithmetices (espcially) discrete logs in prime fields GF(p) to GF(2) representation ?
Like if we have an diskrete log like a^x mod p = b (which is to solve for x) in a prime field GF(p)  all parameters a,b,x,p elements of this field.
Is there any possibility to convert those number to GF(2) like a,b elements in GF(2), p probably the irreducible polynomial, with the goal to solve the log in this field ?
