On computing logarithms over GF(2p)
In this paper we present a new, heuristic method for computing logarithms over GF(2P). When 2P-1 is a Mersenne prime <231-1 it works in very short running times on a general purpose computer. It is based on the interdependent relations f,~(t) = t-2~f(t) 2" and log f~s(t) = - 2' + 2" log f(t), where f and frs are polynomials over GF(2). Its cryptographic significance is discussed and it can be cons
