Bowen Zhou, Bing Xiang, et al.
SSST 2008
A method for determining logarithms in GF (2n) is presented. Its asymptotic running time is O(exp(cn1/3 log2/3 n)) for a small constant c, while, by comparison, Adleman's scheme runs in time O(exp(c′n1/2 1og1/2 n)). The ideas give a dramatic improvement even for moderate-sized fields such as GF (2127), and make (barely) possible computations in fields of size around 2400. The method is not applicable to GF (q) for a large prime q. © 1984 IEEE.
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Hendrik F. Hamann
InterPACK 2013
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking